Submission #2076345


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()

const int MN = 500010;

int tor[MN][27]; //26 for ""
int nx[20][MN];

int main() {
	string s;
	cin >> s;
	int n = s.size();

	rep(i, 27) tor[n][i] = MN;

	for (int i = n-1; i >= 0; --i) {
		int c = s[i] - 'a';
		tor[i][c] = i + 1;

		for (int j = c + 1; j < 27; ++j) {
			tor[i][j] = (tor[i][j-1] == MN ? MN : tor[tor[i][j-1]][j-1]);
		}

		nx[0][i] = tor[i][26];

		for (int j = 0; j < c; ++j) {
			tor[i][j] = (tor[i][26] == MN ? MN : tor[tor[i][26]][j]);
		}
	}

	rep(i, 20) nx[i][n] = MN;

	rep(i, 19) {
		rep(j, n) {
			nx[i+1][j] = (nx[i][j] == MN ? MN : nx[i][nx[i][j]]);
		}
	}

	int q;
	cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		--l;

		for (int i = 19; i >= 0; --i) {
			if (nx[i][l] <= r) {
				l = nx[i][l];
			}
		}

		puts(l == r ? "Yes" : "No");
	}

	return 0;
}

Submission Info

Submission Time
Task C - Robot and String
User satashun
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 1192 Byte
Status AC
Exec Time 383 ms
Memory 93060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1300 / 1300
Status
AC × 3
AC × 67
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 9 ms 39168 KB
0_01.txt AC 9 ms 39168 KB
0_02.txt AC 9 ms 39168 KB
1_00.txt AC 206 ms 39424 KB
1_01.txt AC 208 ms 39424 KB
1_02.txt AC 351 ms 92932 KB
1_03.txt AC 348 ms 92932 KB
1_04.txt AC 343 ms 93060 KB
1_05.txt AC 355 ms 93060 KB
1_06.txt AC 375 ms 93060 KB
1_07.txt AC 382 ms 93060 KB
1_08.txt AC 313 ms 93060 KB
1_09.txt AC 313 ms 93060 KB
1_10.txt AC 313 ms 93060 KB
1_11.txt AC 312 ms 93060 KB
1_12.txt AC 310 ms 93060 KB
1_13.txt AC 316 ms 93060 KB
1_14.txt AC 314 ms 93060 KB
1_15.txt AC 316 ms 93060 KB
1_16.txt AC 317 ms 93060 KB
1_17.txt AC 324 ms 93060 KB
1_18.txt AC 331 ms 93060 KB
1_19.txt AC 314 ms 93060 KB
1_20.txt AC 317 ms 93060 KB
1_21.txt AC 327 ms 93060 KB
1_22.txt AC 326 ms 93060 KB
1_23.txt AC 321 ms 93060 KB
1_24.txt AC 323 ms 93060 KB
1_25.txt AC 323 ms 93060 KB
1_26.txt AC 332 ms 93060 KB
1_27.txt AC 341 ms 93060 KB
1_28.txt AC 346 ms 93060 KB
1_29.txt AC 349 ms 93060 KB
1_30.txt AC 359 ms 93060 KB
1_31.txt AC 362 ms 93060 KB
1_32.txt AC 358 ms 93060 KB
1_33.txt AC 311 ms 92932 KB
1_34.txt AC 309 ms 91524 KB
1_35.txt AC 311 ms 92420 KB
1_36.txt AC 312 ms 91140 KB
1_37.txt AC 315 ms 92292 KB
1_38.txt AC 314 ms 92932 KB
1_39.txt AC 314 ms 92932 KB
1_40.txt AC 324 ms 92420 KB
1_41.txt AC 322 ms 92932 KB
1_42.txt AC 325 ms 92036 KB
1_43.txt AC 338 ms 92932 KB
1_44.txt AC 324 ms 92932 KB
1_45.txt AC 328 ms 92676 KB
1_46.txt AC 342 ms 92804 KB
1_47.txt AC 332 ms 92292 KB
1_48.txt AC 359 ms 92932 KB
1_49.txt AC 343 ms 93060 KB
1_50.txt AC 352 ms 93060 KB
1_51.txt AC 341 ms 93060 KB
1_52.txt AC 383 ms 93060 KB
1_53.txt AC 327 ms 93060 KB
1_54.txt AC 355 ms 93060 KB
1_55.txt AC 332 ms 93060 KB
1_56.txt AC 353 ms 93060 KB
1_57.txt AC 322 ms 93060 KB
1_58.txt AC 341 ms 93060 KB
1_59.txt AC 369 ms 93060 KB
1_60.txt AC 357 ms 93060 KB
1_61.txt AC 337 ms 93060 KB
1_62.txt AC 311 ms 93060 KB
1_63.txt AC 338 ms 93060 KB