Submission #544543

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
544543	2022-04-02T09:30:30 Z	benson1029	Misspelling (JOI22_misspelling)	C++14	100 / 100	2672 ms	750836 KB

misspelling

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

int n,m;
int mxst1[500005], mxst2[500005];
int lift1[500005][21], lift2[500005][21];
int a[500005], b[500005];
long long dp[500005][28][2];
long long psum[500005][28][2], psum2[500005][28][2];
long long ans = 0;
long long mod = 1e9+7;

int main() {
	ios::sync_with_stdio(false);
	cin >> n >> m;
	for(int i=0; i<m; i++) {
		cin >> a[i] >> b[i];
		if(a[i] > b[i]) {
			mxst1[b[i]] = max(mxst1[b[i]], a[i]);
		} else {
			mxst2[a[i]] = max(mxst2[a[i]], b[i]);
		}
	}
	for(int i=0; i<=20; i++) {
		for(int j=1; j<=n; j++) {
			if(i==0) {
				lift1[j][i] = mxst1[j];
				lift2[j][i] = mxst2[j];
			} else {
				if(j-(1<<(i)) < 0) lift1[j][i] = lift2[j][i] = -1;
				else {
					lift1[j][i] = max(lift1[j][i-1], lift1[j-(1<<(i-1))][i-1]);
					lift2[j][i] = max(lift2[j][i-1], lift2[j-(1<<(i-1))][i-1]);
				} 
			} 
		}
	}
	for(int i=2; i<=n; i++) {
		for(int j=1; j<=26; j++) {
			// case 1: < last
			if(j<26) {
				int tmp = i-1;
				for(int k=20; k>=0; k--) {
					if(lift1[tmp][k]==-1) continue;
					if(lift1[tmp][k] < i) {
						tmp -= (1<<k);
					}
				} 
				if(tmp > 0) {
					// have restrictions
					dp[i][j][0] += psum2[i-1][j+1][1] - psum2[tmp][j+1][1] + psum2[i-1][j+1][0] - psum2[tmp][j+1][0];
				} else {
					// no restrictions
					dp[i][j][0] += psum2[i-1][j+1][0] + psum2[i-1][j+1][1] + 26-j;
				}
				dp[i][j][0] %= mod;
			}
			// case 2: > last
			if(j>1) {
				int tmp = i-1;
				for(int k=20; k>=0; k--) {
					if(lift2[tmp][k]==-1) continue;
					if(lift2[tmp][k] < i) {
						tmp -= (1<<k);
					}
				} 
				if(tmp > 0) {
					dp[i][j][1] += psum[i-1][j-1][0] - psum[tmp][j-1][0] + psum[i-1][j-1][1] - psum[tmp][j-1][1];
				} else {
					dp[i][j][1] += psum[i-1][j-1][0] + psum[i-1][j-1][1] + j-1;
				}
				dp[i][j][1] %= mod;
			}
		}
		for(int j=1; j<=26; j++) {
			psum[i][j][0] = psum[i][j-1][0] + dp[i][j][0];
			psum[i][j][1] = psum[i][j-1][1] + dp[i][j][1];
		}
		for(int j=26; j>=1; j--) {
			psum2[i][j][0] = psum2[i][j+1][0] + dp[i][j][0];
			psum2[i][j][1] = psum2[i][j+1][1] + dp[i][j][1];
		}
		for(int j=1; j<=26; j++) {
			psum[i][j][0] += psum[i-1][j][0];
			psum[i][j][1] += psum[i-1][j][1];
			psum2[i][j][0] += psum2[i-1][j][0];
			psum2[i][j][1] += psum2[i-1][j][1];
			psum[i][j][0] %= mod; psum[i][j][1] %= mod;
			psum2[i][j][0] %= mod; psum2[i][j][1] %= mod;
		}  
		for(int j=1; j<=26; j++) {
			ans += (dp[i][j][0] + dp[i][j][1]);
			ans %= mod;
		}
	}
	ans = (ans+26)%mod;
	if(ans<0) ans+=mod;
	cout << ans << "\n";
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	17 ms	588 KB	Output is correct
18	Correct	2 ms	596 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	2 ms	596 KB	Output is correct
21	Correct	1 ms	596 KB	Output is correct
22	Correct	5 ms	724 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	2 ms	584 KB	Output is correct
25	Correct	2 ms	588 KB	Output is correct

Subtask #3
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2589 ms	749236 KB	Output is correct
6	Correct	2672 ms	750212 KB	Output is correct
7	Correct	2492 ms	750068 KB	Output is correct
8	Correct	2522 ms	750064 KB	Output is correct
9	Correct	2565 ms	750292 KB	Output is correct
10	Correct	89 ms	30376 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	2581 ms	750272 KB	Output is correct

Subtask #4
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	17 ms	588 KB	Output is correct
18	Correct	2 ms	596 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	2 ms	596 KB	Output is correct
21	Correct	1 ms	596 KB	Output is correct
22	Correct	5 ms	724 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	2 ms	584 KB	Output is correct
25	Correct	2 ms	588 KB	Output is correct
26	Correct	93 ms	30480 KB	Output is correct
27	Correct	81 ms	30216 KB	Output is correct
28	Correct	78 ms	30072 KB	Output is correct
29	Correct	88 ms	30280 KB	Output is correct
30	Correct	89 ms	30428 KB	Output is correct
31	Correct	171 ms	36348 KB	Output is correct
32	Correct	99 ms	30348 KB	Output is correct
33	Correct	89 ms	30504 KB	Output is correct
34	Correct	88 ms	30372 KB	Output is correct
35	Correct	167 ms	36472 KB	Output is correct
36	Correct	94 ms	29908 KB	Output is correct
37	Correct	90 ms	30284 KB	Output is correct
38	Correct	89 ms	30312 KB	Output is correct
39	Correct	84 ms	30164 KB	Output is correct

Subtask #5
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	17 ms	588 KB	Output is correct
18	Correct	2 ms	596 KB	Output is correct
19	Correct	2 ms	596 KB	Output is correct
20	Correct	2 ms	596 KB	Output is correct
21	Correct	1 ms	596 KB	Output is correct
22	Correct	5 ms	724 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	2 ms	584 KB	Output is correct
25	Correct	2 ms	588 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	328 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	2589 ms	749236 KB	Output is correct
31	Correct	2672 ms	750212 KB	Output is correct
32	Correct	2492 ms	750068 KB	Output is correct
33	Correct	2522 ms	750064 KB	Output is correct
34	Correct	2565 ms	750292 KB	Output is correct
35	Correct	89 ms	30376 KB	Output is correct
36	Correct	2 ms	596 KB	Output is correct
37	Correct	1 ms	328 KB	Output is correct
38	Correct	2581 ms	750272 KB	Output is correct
39	Correct	93 ms	30480 KB	Output is correct
40	Correct	81 ms	30216 KB	Output is correct
41	Correct	78 ms	30072 KB	Output is correct
42	Correct	88 ms	30280 KB	Output is correct
43	Correct	89 ms	30428 KB	Output is correct
44	Correct	171 ms	36348 KB	Output is correct
45	Correct	99 ms	30348 KB	Output is correct
46	Correct	89 ms	30504 KB	Output is correct
47	Correct	88 ms	30372 KB	Output is correct
48	Correct	167 ms	36472 KB	Output is correct
49	Correct	94 ms	29908 KB	Output is correct
50	Correct	90 ms	30284 KB	Output is correct
51	Correct	89 ms	30312 KB	Output is correct
52	Correct	84 ms	30164 KB	Output is correct
53	Correct	2453 ms	747480 KB	Output is correct
54	Correct	2032 ms	746492 KB	Output is correct
55	Correct	2671 ms	747572 KB	Output is correct
56	Correct	2563 ms	750284 KB	Output is correct
57	Correct	2623 ms	750452 KB	Output is correct
58	Correct	2511 ms	750836 KB	Output is correct
59	Correct	2292 ms	748044 KB	Output is correct
60	Correct	2361 ms	750444 KB	Output is correct
61	Correct	2416 ms	740080 KB	Output is correct
62	Correct	2330 ms	749648 KB	Output is correct
63	Correct	2294 ms	748836 KB	Output is correct
64	Correct	2256 ms	746708 KB	Output is correct

Submission #544543

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 20.0 / 20.0

Subtask #3 29.0 / 29.0

Subtask #4 32.0 / 32.0

Subtask #5 11.0 / 11.0

Subtask #1
8.0 / 8.0

Subtask #2
20.0 / 20.0

Subtask #3
29.0 / 29.0

Subtask #4
32.0 / 32.0

Subtask #5
11.0 / 11.0