oj.uz

답안 #551592

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551592 2022-04-21T06:13:13 Z kshitij_sodani Misspelling (JOI22_misspelling) C++14
100 / 100
 1093 ms 266512 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
#define endl '\n'
const llo mod=1e9+7;
llo n,m;
vector<llo> pre3[500001];
llo dp[500001][26];
vector<pair<llo,llo>> pre2[500001];
llo pre[500001][26];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m;
	for(llo i=0;i<m;i++){
		llo aa,bb;
		cin>>aa>>bb;
		aa--;
		bb--;
		llo cc=0;
		if(aa>bb){
			swap(aa,bb);
			cc=1;
		}
		//c=0 next is smaller
		pre3[aa].pb(cc);
		pre2[bb].pb({aa,cc});
	}
	multiset<llo> cur;
	multiset<llo> cur2;
	for(llo i=0;i<n;i++){
		if(i==0){
			for(llo j=0;j<26;j++){
				dp[i][j]=1;
			}
		}
		
		llo ma=0;
		llo ma2=0;
		if(cur.size()){
			auto j=cur.end();
			j--;
			ma=(*j)+1;
		}
		if(cur2.size()){
			auto j=cur2.end();
			j--;
			ma2=(*j)+1;
		}
		//cout<<i<<":"<<ma<<":"<<ma2<<endl;
		//max(ma,ma2) to i-1
		//min(ma,ma2) to max(ma,ma2)-1
		//rest is impossible
		pair<llo,llo> cur3={max(ma,ma2),i-1};
		if(cur3.a<=cur3.b){
			llo su=0;
			for(llo j=0;j<26;j++){
				su+=(pre[cur3.b+1][j]-pre[cur3.a][j]);
				if(su<0){
					su+=mod;
				}
				if(su>=mod){
					su-=mod;
				}
			}
			for(llo j=0;j<26;j++){
				dp[i][j]+=su;
				if(dp[i][j]>=mod){
					dp[i][j]-=mod;
				}
				llo cot=(pre[cur3.b+1][j]-pre[cur3.a][j]);
				if(cot<0){
					cot+=mod;
				}
				dp[i][j]-=cot;
				if(dp[i][j]<0){
					dp[i][j]+=mod;
				}
				if(dp[i][j]>=mod){
					dp[i][j]-=mod;
				}
			}

		}
	/*	for(llo k=max(ma,ma2);k<=i-1;k++){
			llo su=0;
			for(llo j=0;j<26;j++){
				su+=dp[k][j];
				if(su>=mod){
					su-=mod;
				}
			}
			for(llo j=0;j<26;j++){
				dp[i][j]+=(su-dp[k][j]+mod);
				if(dp[i][j]>=mod){
					dp[i][j]-=mod;
				}
				if(dp[i][j]>=mod){
					dp[i][j]-=mod;
				}
			}
		}*/
		cur3={min(ma,ma2),max(ma,ma2)-1};
		if(cur3.a<=cur3.b){
			if(ma<ma2){
				//no restrictions x>y
				llo su=0;
				for(llo j=25;j>=0;j--){
					dp[i][j]+=su;
					if(dp[i][j]>=mod){
						dp[i][j]-=mod;
					}
					//cout<<cur3.a<<",,"<<cur3.b+1<<endl;
					llo cot=pre[cur3.b+1][j]-pre[cur3.a][j]+mod;
					if(cot>=mod){
						cot-=mod;
					}
					
					su+=cot;
					if(su>=mod){
						su-=mod;
					}
				}
			}
			else{

				//x>y always
				llo su=0;
				for(llo j=0;j<26;j++){
					dp[i][j]+=su;
					if(dp[i][j]>=mod){
						dp[i][j]-=mod;
					}
					llo cot=pre[cur3.b+1][j]-pre[cur3.a][j];
					if(cot<0){
						cot+=mod;
					}
					su+=cot;
					if(su>=mod){
						su-=mod;
					}
				}
			}




		}
	/*	for(llo k=min(ma,ma2);k<=max(ma,ma2)-1;k++){
			if(ma<ma2){
				//no restrictions x>y
				llo su=0;
				for(llo j=25;j>=0;j--){
					dp[i][j]+=su;
					if(dp[i][j]>=mod){
						dp[i][j]-=mod;
					}
					su+=dp[k][j];
					if(su>=mod){
						su-=mod;
					}
				}
			}
			else{

				//x>y always
				llo su=0;
				for(llo j=0;j<26;j++){
					dp[i][j]+=su;
					if(dp[i][j]>=mod){
						dp[i][j]-=mod;
					}
					su+=dp[k][j];
					if(su>=mod){
						su-=mod;
					}
				}
			}
		}*/
	/*	if(ma<ma2){

		}
		else if(ma>ma2){

		}
*/





		for(auto j:pre3[i]){
			if(j==0){
				cur.insert(i);
			}
			else{
				cur2.insert(i);
			}
		}
		for(auto j:pre2[i]){
			if(j.b==1){
				auto jj=cur2.find(j.a);
				cur2.erase(jj);
			}
			else{
				auto jj=cur.find(j.a);
				cur.erase(jj);
			}
		}
		for(int j=0;j<26;j++){
			pre[i+1][j]=pre[i][j]+dp[i][j];
			if(pre[i+1][j]>=mod){
				pre[i+1][j]-=mod;
			}
		}
	}

	llo ans=0;
	for(llo i=0;i<n;i++){
		for(llo j=0;j<26;j++){
			//cout<<i<<":"<<j<<":"<<dp[i][j]<<endl;
			ans=(ans+dp[i][j]);
			if(ans>=mod){
				ans-=mod;
			}
		}	
	}
	cout<<ans<<endl;







	return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23816 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23820 KB Output is correct
10 Correct 12 ms 23820 KB Output is correct
11 Correct 12 ms 23824 KB Output is correct
12 Correct 12 ms 23816 KB Output is correct
13 Correct 12 ms 23728 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23816 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23820 KB Output is correct
10 Correct 12 ms 23820 KB Output is correct
11 Correct 12 ms 23824 KB Output is correct
12 Correct 12 ms 23816 KB Output is correct
13 Correct 12 ms 23728 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23824 KB Output is correct
16 Correct 13 ms 23892 KB Output is correct
17 Correct 12 ms 23816 KB Output is correct
18 Correct 14 ms 23892 KB Output is correct
19 Correct 12 ms 23824 KB Output is correct
20 Correct 12 ms 23892 KB Output is correct
21 Correct 13 ms 23892 KB Output is correct
22 Correct 18 ms 24516 KB Output is correct
23 Correct 13 ms 23824 KB Output is correct
24 Correct 13 ms 23892 KB Output is correct
25 Correct 12 ms 23820 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 13 ms 23760 KB Output is correct
5 Correct 368 ms 264696 KB Output is correct
6 Correct 329 ms 264480 KB Output is correct
7 Correct 332 ms 264336 KB Output is correct
8 Correct 352 ms 264428 KB Output is correct
9 Correct 320 ms 264488 KB Output is correct
10 Correct 24 ms 33356 KB Output is correct
11 Correct 12 ms 23816 KB Output is correct
12 Correct 14 ms 23820 KB Output is correct
13 Correct 931 ms 266512 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23816 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23820 KB Output is correct
10 Correct 12 ms 23820 KB Output is correct
11 Correct 12 ms 23824 KB Output is correct
12 Correct 12 ms 23816 KB Output is correct
13 Correct 12 ms 23728 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23824 KB Output is correct
16 Correct 13 ms 23892 KB Output is correct
17 Correct 12 ms 23816 KB Output is correct
18 Correct 14 ms 23892 KB Output is correct
19 Correct 12 ms 23824 KB Output is correct
20 Correct 12 ms 23892 KB Output is correct
21 Correct 13 ms 23892 KB Output is correct
22 Correct 18 ms 24516 KB Output is correct
23 Correct 13 ms 23824 KB Output is correct
24 Correct 13 ms 23892 KB Output is correct
25 Correct 12 ms 23820 KB Output is correct
26 Correct 26 ms 33236 KB Output is correct
27 Correct 33 ms 32776 KB Output is correct
28 Correct 30 ms 32728 KB Output is correct
29 Correct 39 ms 33184 KB Output is correct
30 Correct 32 ms 33284 KB Output is correct
31 Correct 398 ms 54232 KB Output is correct
32 Correct 26 ms 33356 KB Output is correct
33 Correct 24 ms 33308 KB Output is correct
34 Correct 36 ms 33432 KB Output is correct
35 Correct 621 ms 61024 KB Output is correct
36 Correct 20 ms 31956 KB Output is correct
37 Correct 33 ms 33040 KB Output is correct
38 Correct 26 ms 32776 KB Output is correct
39 Correct 25 ms 32268 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23816 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23820 KB Output is correct
10 Correct 12 ms 23820 KB Output is correct
11 Correct 12 ms 23824 KB Output is correct
12 Correct 12 ms 23816 KB Output is correct
13 Correct 12 ms 23728 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23824 KB Output is correct
16 Correct 13 ms 23892 KB Output is correct
17 Correct 12 ms 23816 KB Output is correct
18 Correct 14 ms 23892 KB Output is correct
19 Correct 12 ms 23824 KB Output is correct
20 Correct 12 ms 23892 KB Output is correct
21 Correct 13 ms 23892 KB Output is correct
22 Correct 18 ms 24516 KB Output is correct
23 Correct 13 ms 23824 KB Output is correct
24 Correct 13 ms 23892 KB Output is correct
25 Correct 12 ms 23820 KB Output is correct
26 Correct 15 ms 23764 KB Output is correct
27 Correct 12 ms 23764 KB Output is correct
28 Correct 12 ms 23764 KB Output is correct
29 Correct 13 ms 23760 KB Output is correct
30 Correct 368 ms 264696 KB Output is correct
31 Correct 329 ms 264480 KB Output is correct
32 Correct 332 ms 264336 KB Output is correct
33 Correct 352 ms 264428 KB Output is correct
34 Correct 320 ms 264488 KB Output is correct
35 Correct 24 ms 33356 KB Output is correct
36 Correct 12 ms 23816 KB Output is correct
37 Correct 14 ms 23820 KB Output is correct
38 Correct 931 ms 266512 KB Output is correct
39 Correct 26 ms 33236 KB Output is correct
40 Correct 33 ms 32776 KB Output is correct
41 Correct 30 ms 32728 KB Output is correct
42 Correct 39 ms 33184 KB Output is correct
43 Correct 32 ms 33284 KB Output is correct
44 Correct 398 ms 54232 KB Output is correct
45 Correct 26 ms 33356 KB Output is correct
46 Correct 24 ms 33308 KB Output is correct
47 Correct 36 ms 33432 KB Output is correct
48 Correct 621 ms 61024 KB Output is correct
49 Correct 20 ms 31956 KB Output is correct
50 Correct 33 ms 33040 KB Output is correct
51 Correct 26 ms 32776 KB Output is correct
52 Correct 25 ms 32268 KB Output is correct
53 Correct 492 ms 249364 KB Output is correct
54 Correct 585 ms 249184 KB Output is correct
55 Correct 859 ms 256892 KB Output is correct
56 Correct 889 ms 263508 KB Output is correct
57 Correct 315 ms 264916 KB Output is correct
58 Correct 331 ms 261544 KB Output is correct
59 Correct 306 ms 258776 KB Output is correct
60 Correct 1093 ms 264312 KB Output is correct
61 Correct 208 ms 227232 KB Output is correct
62 Correct 893 ms 259252 KB Output is correct
63 Correct 595 ms 249504 KB Output is correct
64 Correct 378 ms 238848 KB Output is correct