oj.uz

Submission #891359

# Submission time Handle Problem Language Result Execution time Memory
891359 2023-12-22T19:41:00 Z amirhoseinfar1385 Misspelling (JOI22_misspelling) C++17
100 / 100
 365 ms 170160 KB 
#include<bits/stdc++.h>
using namespace std;
const long long maxn=500000+10,K=27,mod=1000000007;
long long ps[maxn][K],n,m;
vector<pair<long long,long long>>allq[maxn];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(long long i=0;i<m;i++){
		long long u,v;
		cin>>u>>v;
		if(u>v){
			swap(u,v);
			allq[u].push_back(make_pair(v,1));
		}
		else{
			allq[u].push_back(make_pair(v,0));
		}
	}
	for(long long i=1;i<K;i++){
		ps[1][i]=i;
	}
	set<pair<long long,long long>>stl,str;
	for(long long i=2;i<=n;i++){
		for(auto x:allq[i-1]){
			if(x.second==1){
				str.insert(make_pair(i-1,x.first));
			}
			else{
				stl.insert(make_pair(i-1,x.first));
			}
		}
		while((long long)str.size()>0&&(*str.rbegin()).second<i){
			str.erase(*str.rbegin());
		}
		while((long long)stl.size()>0&&(*stl.rbegin()).second<i){
			stl.erase(*stl.rbegin());
		}
		long long maxl=0,maxr=0;
		if((long long)str.size()>0){
			maxr=(*str.rbegin()).first;
		}
		if((long long)stl.size()>0){
			maxl=(*stl.rbegin()).first;
		}
		//cout<<maxl<<" "<<maxr<<" "<<i<<endl;
		if(maxl==maxr&&maxl!=0){
			for(long long j=0;j<K;j++){
				ps[i][j]=ps[i-1][j];
			}
			continue;
		}
		if(maxl==maxr){
			for(int j=1;j<K;j++){
				ps[i][j]=ps[i-1][K-1]-ps[i-1][j]+ps[i-1][j-1];
				ps[i][j]+=mod*10;
				ps[i][j]%=mod;
			}
			for(long long j=1;j<K;j++){
				ps[i][j]+=ps[i][j-1];
				ps[i][j]+=mod*10;
				ps[i][j]%=mod;
			}
			for(long long j=1;j<K;j++){
				ps[i][j]+=ps[i-1][j];
				ps[i][j]+=mod*10;
				ps[i][j]%=mod;
			}
			continue;
		}
		if(maxl>maxr){
			for(long long j=1;j<K;j++){
				ps[i][j]=ps[i-1][K-1]-ps[maxl][K-1]-(ps[i-1][j]-ps[i-1][j-1]-(ps[maxl][j]-ps[maxl][j-1]));
			}
			for(long long j=1;j<K;j++){
				ps[i][j]+=ps[maxl][K-1]-ps[maxl][j]-(ps[maxr][K-1]-ps[maxr][j]);
			}
			for(long long j=1;j<K;j++){
				ps[i][j]+=ps[i][j-1];
				ps[i][j]+=mod*10;
				ps[i][j]%=mod;
			}
			for(long long j=1;j<K;j++){
				ps[i][j]+=ps[i-1][j];
				ps[i][j]+=mod*10;
				ps[i][j]%=mod;
			}
		}
		else{
			swap(maxl,maxr);
			for(long long j=1;j<K;j++){
				ps[i][j]=ps[i-1][K-1]-ps[maxl][K-1]-(ps[i-1][j]-ps[i-1][j-1]-(ps[maxl][j]-ps[maxl][j-1]));
			}
			for(long long j=1;j<K;j++){
			//	cout<<j<<" "<<maxr<<" "<<ps[i-1][j-1]<<" "<<ps[maxr][j-1]<<endl;
				ps[i][j]+=ps[maxl][j-1]-(ps[maxr][j-1]);
			}
			for(long long j=1;j<K;j++){
				ps[i][j]+=ps[i][j-1];
				ps[i][j]+=mod*10;
				ps[i][j]%=mod;
			}
			for(long long j=1;j<K;j++){
				ps[i][j]+=ps[i-1][j];
				ps[i][j]+=mod*10;
				ps[i][j]%=mod;
			}
		}
	}
//	for(long long i=1;i<=n;i++){
//		for(long long j=1;j<K;j++){
//			cout<<ps[i][j]<<" ";
//		}
//		cout<<"\n";
//	}
	cout<<ps[n][K-1]<<endl;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12900 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 3 ms 12912 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12900 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 3 ms 12912 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 3 ms 12948 KB Output is correct
16 Correct 3 ms 12900 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 3 ms 12916 KB Output is correct
21 Correct 2 ms 12892 KB Output is correct
22 Correct 6 ms 13660 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 3 ms 12948 KB Output is correct
25 Correct 3 ms 12888 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 306 ms 157516 KB Output is correct
6 Correct 289 ms 156752 KB Output is correct
7 Correct 300 ms 158036 KB Output is correct
8 Correct 289 ms 160748 KB Output is correct
9 Correct 297 ms 158176 KB Output is correct
10 Correct 13 ms 18776 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 315 ms 162040 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12900 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 3 ms 12912 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 3 ms 12948 KB Output is correct
16 Correct 3 ms 12900 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 3 ms 12916 KB Output is correct
21 Correct 2 ms 12892 KB Output is correct
22 Correct 6 ms 13660 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 3 ms 12948 KB Output is correct
25 Correct 3 ms 12888 KB Output is correct
26 Correct 13 ms 19032 KB Output is correct
27 Correct 11 ms 18012 KB Output is correct
28 Correct 12 ms 18024 KB Output is correct
29 Correct 14 ms 19036 KB Output is correct
30 Correct 13 ms 18852 KB Output is correct
31 Correct 199 ms 64656 KB Output is correct
32 Correct 13 ms 18268 KB Output is correct
33 Correct 14 ms 18268 KB Output is correct
34 Correct 15 ms 19032 KB Output is correct
35 Correct 199 ms 65044 KB Output is correct
36 Correct 9 ms 16984 KB Output is correct
37 Correct 12 ms 18524 KB Output is correct
38 Correct 11 ms 18072 KB Output is correct
39 Correct 9 ms 17496 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12900 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 3 ms 12912 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 3 ms 12948 KB Output is correct
16 Correct 3 ms 12900 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 3 ms 12916 KB Output is correct
21 Correct 2 ms 12892 KB Output is correct
22 Correct 6 ms 13660 KB Output is correct
23 Correct 3 ms 12892 KB Output is correct
24 Correct 3 ms 12948 KB Output is correct
25 Correct 3 ms 12888 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 2 ms 12892 KB Output is correct
28 Correct 2 ms 12892 KB Output is correct
29 Correct 2 ms 12892 KB Output is correct
30 Correct 306 ms 157516 KB Output is correct
31 Correct 289 ms 156752 KB Output is correct
32 Correct 300 ms 158036 KB Output is correct
33 Correct 289 ms 160748 KB Output is correct
34 Correct 297 ms 158176 KB Output is correct
35 Correct 13 ms 18776 KB Output is correct
36 Correct 2 ms 12892 KB Output is correct
37 Correct 2 ms 12892 KB Output is correct
38 Correct 315 ms 162040 KB Output is correct
39 Correct 13 ms 19032 KB Output is correct
40 Correct 11 ms 18012 KB Output is correct
41 Correct 12 ms 18024 KB Output is correct
42 Correct 14 ms 19036 KB Output is correct
43 Correct 13 ms 18852 KB Output is correct
44 Correct 199 ms 64656 KB Output is correct
45 Correct 13 ms 18268 KB Output is correct
46 Correct 14 ms 18268 KB Output is correct
47 Correct 15 ms 19032 KB Output is correct
48 Correct 199 ms 65044 KB Output is correct
49 Correct 9 ms 16984 KB Output is correct
50 Correct 12 ms 18524 KB Output is correct
51 Correct 11 ms 18072 KB Output is correct
52 Correct 9 ms 17496 KB Output is correct
53 Correct 209 ms 144596 KB Output is correct
54 Correct 246 ms 144840 KB Output is correct
55 Correct 339 ms 170068 KB Output is correct
56 Correct 337 ms 170160 KB Output is correct
57 Correct 290 ms 164176 KB Output is correct
58 Correct 289 ms 156756 KB Output is correct
59 Correct 287 ms 159212 KB Output is correct
60 Correct 365 ms 168784 KB Output is correct
61 Correct 129 ms 117848 KB Output is correct
62 Correct 306 ms 156220 KB Output is correct
63 Correct 243 ms 143592 KB Output is correct
64 Correct 189 ms 130856 KB Output is correct