Submission #702483

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
702483	2023-02-24T07:46:14 Z	emptypringlescan	Misspelling (JOI22_misspelling)	C++17	100 / 100	384 ms	224324 KB

misspelling

#include <bits/stdc++.h>
using namespace std;
//we are perpetually trapped in a cycle of death and rebirth
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    int lefu[n],lefd[n];
    memset(lefu,-1,sizeof(lefu));
    memset(lefd,-1,sizeof(lefd));
    vector<pair<int,int> > rangu,rangd;
    for(int i=0; i<m; i++){
		int a,b;
		cin >> a >> b;
		a--; b--;
		if(a<b) rangd.push_back({a,b});
		else rangu.push_back({b,a});
	}
	sort(rangd.begin(),rangd.end());
	sort(rangu.begin(),rangu.end());
	stack<pair<int,int> > s;
	int c1=0,c2=0;
	for(int i=0; i<n; i++){
		while(!s.empty()&&s.top().second<i){
			s.pop();
		}
		while(c1<(int)rangd.size()&&rangd[c1].first<i){
			s.push(rangd[c1]);
			c1++;
		}
		if(!s.empty()) lefd[i]=s.top().first;
	}
	while(!s.empty()){
		s.pop();
	}
	for(int i=0; i<n; i++){
		while(!s.empty()&&s.top().second<i){
			s.pop();
		}
		while(c2<(int)rangu.size()&&rangu[c2].first<i){
			s.push(rangu[c2]);
			c2++;
		}
		if(!s.empty()) lefu[i]=s.top().first;
	}
	long long dv[n][26],v[n][26];
	memset(dv,0,sizeof(dv));
	memset(v,0,sizeof(v));
	for(int i=0; i<26; i++){
		v[0][i]=0;
		dv[0][i]=1;
	}
	long long ts[500005];
	ts[0]=1;
	for(int i=1; i<500005; i++){
		ts[i]=ts[i-1]*26%1000000007;
	}
	for(int i=1; i<n; i++){
		long long cur=0,sum=0;
		for(int j=0; j<26; j++) sum=(sum+v[i-1][j])%1000000007;
		for(int j=25; j>=0; j--){
			v[i][j]+=sum;
			if(v[i][j]>=1000000007) v[i][j]-=1000000007;
			if(lefu[i]==-1) continue;
			if(j<25) cur+=dv[lefu[i]][j+1];
			if(cur>=1000000007) cur-=1000000007;
			v[i][j]+=cur;
			if(v[i][j]>=1000000007) v[i][j]-=1000000007;
		}
		cur=0;
		for(int j=0; j<26; j++){
			if(lefd[i]==-1) continue;
			if(j) cur+=dv[lefd[i]][j-1];
			if(cur>=1000000007) cur-=1000000007;
			v[i][j]+=cur;
			if(v[i][j]>=1000000007) v[i][j]-=1000000007;
		}
		for(int j=0; j<26; j++){
			dv[i][j]=ts[i]-v[i][j]+1000000007;
			if(dv[i][j]>=1000000007) dv[i][j]-=1000000007;
			//cout << v[i][j] << ' ' << dv[i][j] << '\n';
		}
	}
	long long ans=0;
	for(int i=0; i<26; i++) ans=(ans+dv[n-1][i])%1000000007;
	cout << ans;
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	4180 KB	Output is correct
2	Correct	5 ms	4180 KB	Output is correct
3	Correct	5 ms	4180 KB	Output is correct
4	Correct	5 ms	4180 KB	Output is correct
5	Correct	5 ms	4228 KB	Output is correct
6	Correct	5 ms	4180 KB	Output is correct
7	Correct	6 ms	4232 KB	Output is correct
8	Correct	6 ms	4180 KB	Output is correct
9	Correct	6 ms	4180 KB	Output is correct
10	Correct	5 ms	4180 KB	Output is correct
11	Correct	6 ms	4164 KB	Output is correct
12	Correct	5 ms	4180 KB	Output is correct
13	Correct	5 ms	4180 KB	Output is correct
14	Correct	5 ms	4180 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	4180 KB	Output is correct
2	Correct	5 ms	4180 KB	Output is correct
3	Correct	5 ms	4180 KB	Output is correct
4	Correct	5 ms	4180 KB	Output is correct
5	Correct	5 ms	4228 KB	Output is correct
6	Correct	5 ms	4180 KB	Output is correct
7	Correct	6 ms	4232 KB	Output is correct
8	Correct	6 ms	4180 KB	Output is correct
9	Correct	6 ms	4180 KB	Output is correct
10	Correct	5 ms	4180 KB	Output is correct
11	Correct	6 ms	4164 KB	Output is correct
12	Correct	5 ms	4180 KB	Output is correct
13	Correct	5 ms	4180 KB	Output is correct
14	Correct	5 ms	4180 KB	Output is correct
15	Correct	5 ms	4316 KB	Output is correct
16	Correct	5 ms	4308 KB	Output is correct
17	Correct	5 ms	4308 KB	Output is correct
18	Correct	5 ms	4308 KB	Output is correct
19	Correct	5 ms	4308 KB	Output is correct
20	Correct	6 ms	4228 KB	Output is correct
21	Correct	6 ms	4232 KB	Output is correct
22	Correct	8 ms	4520 KB	Output is correct
23	Correct	5 ms	4308 KB	Output is correct
24	Correct	5 ms	4232 KB	Output is correct
25	Correct	6 ms	4228 KB	Output is correct

Subtask #3
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	4180 KB	Output is correct
2	Correct	5 ms	4180 KB	Output is correct
3	Correct	5 ms	4180 KB	Output is correct
4	Correct	5 ms	4180 KB	Output is correct
5	Correct	378 ms	215676 KB	Output is correct
6	Correct	331 ms	222348 KB	Output is correct
7	Correct	341 ms	222348 KB	Output is correct
8	Correct	384 ms	222312 KB	Output is correct
9	Correct	367 ms	222348 KB	Output is correct
10	Correct	17 ms	13004 KB	Output is correct
11	Correct	5 ms	4308 KB	Output is correct
12	Correct	5 ms	4180 KB	Output is correct
13	Correct	364 ms	224280 KB	Output is correct

Subtask #4
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	4180 KB	Output is correct
2	Correct	5 ms	4180 KB	Output is correct
3	Correct	5 ms	4180 KB	Output is correct
4	Correct	5 ms	4180 KB	Output is correct
5	Correct	5 ms	4228 KB	Output is correct
6	Correct	5 ms	4180 KB	Output is correct
7	Correct	6 ms	4232 KB	Output is correct
8	Correct	6 ms	4180 KB	Output is correct
9	Correct	6 ms	4180 KB	Output is correct
10	Correct	5 ms	4180 KB	Output is correct
11	Correct	6 ms	4164 KB	Output is correct
12	Correct	5 ms	4180 KB	Output is correct
13	Correct	5 ms	4180 KB	Output is correct
14	Correct	5 ms	4180 KB	Output is correct
15	Correct	5 ms	4316 KB	Output is correct
16	Correct	5 ms	4308 KB	Output is correct
17	Correct	5 ms	4308 KB	Output is correct
18	Correct	5 ms	4308 KB	Output is correct
19	Correct	5 ms	4308 KB	Output is correct
20	Correct	6 ms	4228 KB	Output is correct
21	Correct	6 ms	4232 KB	Output is correct
22	Correct	8 ms	4520 KB	Output is correct
23	Correct	5 ms	4308 KB	Output is correct
24	Correct	5 ms	4232 KB	Output is correct
25	Correct	6 ms	4228 KB	Output is correct
26	Correct	21 ms	13132 KB	Output is correct
27	Correct	15 ms	12856 KB	Output is correct
28	Correct	15 ms	12756 KB	Output is correct
29	Correct	20 ms	13028 KB	Output is correct
30	Correct	18 ms	12956 KB	Output is correct
31	Correct	145 ms	25792 KB	Output is correct
32	Correct	18 ms	13012 KB	Output is correct
33	Correct	18 ms	13012 KB	Output is correct
34	Correct	22 ms	12964 KB	Output is correct
35	Correct	146 ms	23840 KB	Output is correct
36	Correct	12 ms	12524 KB	Output is correct
37	Correct	20 ms	12816 KB	Output is correct
38	Correct	20 ms	12692 KB	Output is correct
39	Correct	19 ms	12628 KB	Output is correct

Subtask #5
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	4180 KB	Output is correct
2	Correct	5 ms	4180 KB	Output is correct
3	Correct	5 ms	4180 KB	Output is correct
4	Correct	5 ms	4180 KB	Output is correct
5	Correct	5 ms	4228 KB	Output is correct
6	Correct	5 ms	4180 KB	Output is correct
7	Correct	6 ms	4232 KB	Output is correct
8	Correct	6 ms	4180 KB	Output is correct
9	Correct	6 ms	4180 KB	Output is correct
10	Correct	5 ms	4180 KB	Output is correct
11	Correct	6 ms	4164 KB	Output is correct
12	Correct	5 ms	4180 KB	Output is correct
13	Correct	5 ms	4180 KB	Output is correct
14	Correct	5 ms	4180 KB	Output is correct
15	Correct	5 ms	4316 KB	Output is correct
16	Correct	5 ms	4308 KB	Output is correct
17	Correct	5 ms	4308 KB	Output is correct
18	Correct	5 ms	4308 KB	Output is correct
19	Correct	5 ms	4308 KB	Output is correct
20	Correct	6 ms	4228 KB	Output is correct
21	Correct	6 ms	4232 KB	Output is correct
22	Correct	8 ms	4520 KB	Output is correct
23	Correct	5 ms	4308 KB	Output is correct
24	Correct	5 ms	4232 KB	Output is correct
25	Correct	6 ms	4228 KB	Output is correct
26	Correct	5 ms	4180 KB	Output is correct
27	Correct	5 ms	4180 KB	Output is correct
28	Correct	5 ms	4180 KB	Output is correct
29	Correct	5 ms	4180 KB	Output is correct
30	Correct	378 ms	215676 KB	Output is correct
31	Correct	331 ms	222348 KB	Output is correct
32	Correct	341 ms	222348 KB	Output is correct
33	Correct	384 ms	222312 KB	Output is correct
34	Correct	367 ms	222348 KB	Output is correct
35	Correct	17 ms	13004 KB	Output is correct
36	Correct	5 ms	4308 KB	Output is correct
37	Correct	5 ms	4180 KB	Output is correct
38	Correct	364 ms	224280 KB	Output is correct
39	Correct	21 ms	13132 KB	Output is correct
40	Correct	15 ms	12856 KB	Output is correct
41	Correct	15 ms	12756 KB	Output is correct
42	Correct	20 ms	13028 KB	Output is correct
43	Correct	18 ms	12956 KB	Output is correct
44	Correct	145 ms	25792 KB	Output is correct
45	Correct	18 ms	13012 KB	Output is correct
46	Correct	18 ms	13012 KB	Output is correct
47	Correct	22 ms	12964 KB	Output is correct
48	Correct	146 ms	23840 KB	Output is correct
49	Correct	12 ms	12524 KB	Output is correct
50	Correct	20 ms	12816 KB	Output is correct
51	Correct	20 ms	12692 KB	Output is correct
52	Correct	19 ms	12628 KB	Output is correct
53	Correct	321 ms	218980 KB	Output is correct
54	Correct	258 ms	218936 KB	Output is correct
55	Correct	346 ms	224252 KB	Output is correct
56	Correct	336 ms	224324 KB	Output is correct
57	Correct	339 ms	222348 KB	Output is correct
58	Correct	322 ms	222376 KB	Output is correct
59	Correct	352 ms	222396 KB	Output is correct
60	Correct	355 ms	224276 KB	Output is correct
61	Correct	223 ms	211652 KB	Output is correct
62	Correct	312 ms	221084 KB	Output is correct
63	Correct	287 ms	217912 KB	Output is correct
64	Correct	249 ms	214724 KB	Output is correct

Submission #702483

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