Submission #1697381


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef pair<double,int>Q;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
char str[500005];
int q;
int dp[500005][27];
int go[500005][21];
int main(){
	scanf("%s%d",&str,&q); int n = strlen(str);
	rep(i,500005) rep(j,27) dp[i][j] = INF;
	for(int i=0;i<n;i++){
		dp[i][str[i]-'a'] = i;
	}
	while(1){
		bool upd = 0;
		for(int j=1;j<=26;j++){
			for(int i=0;i<n;i++){
				if(dp[i][j-1] < n && dp[dp[i][j-1]+1][j-1] < n && dp[i][j] > dp[dp[i][j-1]+1][j-1]){
					dp[i][j] = dp[dp[i][j-1]+1][j-1];
					upd = 1;
				}
				if(dp[i][26] < n && dp[dp[i][26]+1][j] < n && dp[i][j] > dp[dp[i][26]+1][j]){
					dp[i][j] = dp[dp[i][26]+1][j];
					upd = 1;
				}
			}
		}
		if(!upd) break;
	}
	for(int i=0;i<n;i++){
		go[i][0] = dp[i][26]+1;
		//cout<<i<<" "<<go[i][0]<<endl;
	}
	go[n][0] = n;
	for(int j=0;j<19;j++){
		for(int i=0;i<=n;i++){
			if(go[i][j] >= n) go[i][j+1] = INF;
			else go[i][j+1] = go[go[i][j]][j];
		}
	}
	//cout<<go[0][1]<<endl;
	rep(i,q){
		int x,y; scanf("%d%d",&x,&y); x--;
		for(int i=19;i>=0;i--){
			if(go[x][i] <= y) x = go[x][i];
		}
	//	cout<<x<<" "<<y<<endl;
		puts(x==y?"Yes":"No");
	}
}

Submission Info

Submission Time
Task C - Robot and String
User IH19980412
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1729 Byte
Status TLE
Exec Time 2107 ms
Memory 94848 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:22: warning: format ‘%s’ expects argument of type ‘char*’, but argument 2 has type ‘char (*)[500005]’ [-Wformat=]
  scanf("%s%d",&str,&q); int n = strlen(str);
                      ^
./Main.cpp:27:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s%d",&str,&q); int n = strlen(str);
                       ^
./Main.cpp:61:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int x,y; scanf("%d%d",&x,&y); x--;
                               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1300
Status
AC × 3
AC × 18
TLE × 49
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt
Case Name Status Exec Time Memory
0_00.txt AC 21 ms 53504 KB
0_01.txt AC 20 ms 53504 KB
0_02.txt AC 20 ms 53504 KB
1_00.txt AC 39 ms 53760 KB
1_01.txt AC 39 ms 53760 KB
1_02.txt AC 401 ms 94720 KB
1_03.txt AC 397 ms 94720 KB
1_04.txt AC 442 ms 94848 KB
1_05.txt AC 459 ms 94848 KB
1_06.txt AC 379 ms 94848 KB
1_07.txt AC 375 ms 94848 KB
1_08.txt TLE 2103 ms 53504 KB
1_09.txt TLE 2103 ms 53504 KB
1_10.txt TLE 2103 ms 53504 KB
1_11.txt TLE 2103 ms 53504 KB
1_12.txt TLE 2104 ms 53504 KB
1_13.txt TLE 2103 ms 53504 KB
1_14.txt TLE 2103 ms 53504 KB
1_15.txt TLE 2103 ms 53504 KB
1_16.txt TLE 2103 ms 53504 KB
1_17.txt TLE 2103 ms 53504 KB
1_18.txt TLE 2103 ms 53504 KB
1_19.txt TLE 2103 ms 53504 KB
1_20.txt TLE 2103 ms 53504 KB
1_21.txt TLE 2103 ms 53504 KB
1_22.txt TLE 2103 ms 53504 KB
1_23.txt TLE 2103 ms 53504 KB
1_24.txt TLE 2103 ms 53504 KB
1_25.txt TLE 2103 ms 53504 KB
1_26.txt TLE 2103 ms 53504 KB
1_27.txt TLE 2103 ms 53504 KB
1_28.txt TLE 2103 ms 53504 KB
1_29.txt TLE 2103 ms 53504 KB
1_30.txt TLE 2103 ms 53504 KB
1_31.txt TLE 2103 ms 53504 KB
1_32.txt TLE 2103 ms 53504 KB
1_33.txt AC 526 ms 94848 KB
1_34.txt AC 1840 ms 94848 KB
1_35.txt TLE 2103 ms 53504 KB
1_36.txt TLE 2103 ms 53504 KB
1_37.txt TLE 2103 ms 53504 KB
1_38.txt TLE 2103 ms 53504 KB
1_39.txt TLE 2103 ms 53504 KB
1_40.txt TLE 2103 ms 53504 KB
1_41.txt TLE 2107 ms 53504 KB
1_42.txt TLE 2103 ms 53504 KB
1_43.txt TLE 2103 ms 53504 KB
1_44.txt TLE 2103 ms 53504 KB
1_45.txt TLE 2103 ms 53504 KB
1_46.txt TLE 2103 ms 53504 KB
1_47.txt TLE 2103 ms 53504 KB
1_48.txt TLE 2103 ms 53504 KB
1_49.txt AC 404 ms 94848 KB
1_50.txt AC 379 ms 94848 KB
1_51.txt TLE 2103 ms 53504 KB
1_52.txt TLE 2103 ms 53504 KB
1_53.txt AC 469 ms 94848 KB
1_54.txt AC 394 ms 94848 KB
1_55.txt TLE 2103 ms 53504 KB
1_56.txt TLE 2103 ms 53504 KB
1_57.txt AC 503 ms 94848 KB
1_58.txt TLE 2103 ms 53504 KB
1_59.txt TLE 2103 ms 53504 KB
1_60.txt TLE 2103 ms 53504 KB
1_61.txt TLE 2103 ms 53504 KB
1_62.txt TLE 2103 ms 53504 KB
1_63.txt TLE 2103 ms 53504 KB