Submission #1697333


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())
string str;
int q;
ll C[500005];
int nxt[500005],par[500005],dep[500005];
void calc(int beg){
//cout<<beg<<endl;
	if(nxt[beg] != -1) return;
	int sum = 0;
	int id = -1;
	for(int i=beg;i<str.size();i++){
		if(sum%(1<<(str[i]-'a'))!=0){
			id = i; break;
		}
		else{
			sum += (1<<(str[i]-'a'));
			if(sum > (1<<26)){
				nxt[beg] = INF; return;
			}
			else if(sum == (1<<26)){
				nxt[beg] = i; return;
			}
		}
	}
	//if(beg==11) cout<<id<<endl;
	if(id==-1){
		nxt[beg] = INF; return;
	}
	assert(beg<id);
	calc(id);
	for(int i=nxt[id]+1;i<str.size();i++){
		if(sum%(1<<(str[i]-'a'))!=0){
			nxt[beg] = INF; return;
		}
		else{
			sum += (1<<(str[i]-'a'));
			if(sum > (1<<26)){
				nxt[beg] = INF; return;
			}
			else if(sum == (1<<26)){
				nxt[beg] = i; return;
			}
		}
	}
	nxt[beg] = INF; return;
}
void dfs(int v,int pp,int dd){
	par[v] = pp; dep[v] = dd;
//	cout<<v<<" "<<pp<<" "<<dd<<endl;
	if(nxt[v] == INF || v == str.size()) return;
	dfs(nxt[v]+1,pp,dd+1);
}
int main(){
	cin>>str>>q;
	memset(nxt,-1,sizeof(nxt));
	memset(par,-1,sizeof(par));
	memset(dep,-1,sizeof(dep));
	rep(i,str.size()) calc(i);
//	for(int i=0;i<str.size();i++)cout<<nxt[i]<<" "<<i<<endl;
//	return 0;
	rep(i,str.size()){
		if(par[i]==-1 || dep[i]==-1){
			dfs(i,i,0);
		}
	}
	rep(i,q){
		int x,y; cin>>x>>y; x--;
		while(x<y){
			x = nxt[x]+1;
		}
		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 2078 Byte
Status WA
Exec Time 2103 ms
Memory 7428 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1300
Status
AC × 3
AC × 6
WA × 42
TLE × 19
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 3 ms 6400 KB
0_01.txt AC 3 ms 6400 KB
0_02.txt AC 2 ms 6400 KB
1_00.txt AC 184 ms 6656 KB
1_01.txt AC 188 ms 6656 KB
1_02.txt TLE 2103 ms 7044 KB
1_03.txt TLE 2103 ms 7044 KB
1_04.txt TLE 2103 ms 7044 KB
1_05.txt TLE 2103 ms 7044 KB
1_06.txt TLE 2103 ms 7044 KB
1_07.txt TLE 2103 ms 7044 KB
1_08.txt WA 257 ms 7300 KB
1_09.txt WA 254 ms 7300 KB
1_10.txt WA 253 ms 7300 KB
1_11.txt WA 254 ms 7300 KB
1_12.txt WA 255 ms 7300 KB
1_13.txt WA 254 ms 7300 KB
1_14.txt WA 252 ms 7300 KB
1_15.txt WA 262 ms 7300 KB
1_16.txt WA 257 ms 7300 KB
1_17.txt WA 256 ms 7300 KB
1_18.txt WA 254 ms 7300 KB
1_19.txt WA 263 ms 7300 KB
1_20.txt WA 257 ms 7300 KB
1_21.txt WA 256 ms 7300 KB
1_22.txt WA 257 ms 7300 KB
1_23.txt WA 257 ms 7300 KB
1_24.txt WA 264 ms 7300 KB
1_25.txt WA 262 ms 7300 KB
1_26.txt WA 259 ms 7300 KB
1_27.txt WA 266 ms 7300 KB
1_28.txt WA 266 ms 7300 KB
1_29.txt WA 259 ms 7300 KB
1_30.txt WA 257 ms 7300 KB
1_31.txt WA 260 ms 7300 KB
1_32.txt WA 288 ms 7300 KB
1_33.txt AC 257 ms 7428 KB
1_34.txt WA 259 ms 7300 KB
1_35.txt WA 257 ms 7300 KB
1_36.txt WA 255 ms 7300 KB
1_37.txt WA 252 ms 7300 KB
1_38.txt WA 261 ms 7300 KB
1_39.txt WA 257 ms 7300 KB
1_40.txt WA 272 ms 7300 KB
1_41.txt WA 281 ms 7300 KB
1_42.txt WA 311 ms 7300 KB
1_43.txt WA 354 ms 7300 KB
1_44.txt WA 445 ms 7300 KB
1_45.txt WA 631 ms 7300 KB
1_46.txt WA 1078 ms 7300 KB
1_47.txt WA 1184 ms 7300 KB
1_48.txt TLE 2103 ms 7172 KB
1_49.txt TLE 2103 ms 7044 KB
1_50.txt TLE 2103 ms 7044 KB
1_51.txt TLE 2103 ms 7044 KB
1_52.txt TLE 2103 ms 7044 KB
1_53.txt TLE 2103 ms 7044 KB
1_54.txt TLE 2103 ms 7044 KB
1_55.txt TLE 2103 ms 7044 KB
1_56.txt TLE 2103 ms 7044 KB
1_57.txt TLE 2103 ms 7044 KB
1_58.txt TLE 2103 ms 7172 KB
1_59.txt TLE 2103 ms 7044 KB
1_60.txt TLE 2103 ms 7172 KB
1_61.txt WA 270 ms 7300 KB
1_62.txt WA 261 ms 7428 KB
1_63.txt WA 283 ms 7428 KB