oj.uz

답안 #858845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858845 2023-10-09T09:09:07 Z willychan Misspelling (JOI22_misspelling) C++14
100 / 100
 712 ms 150104 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds

const int MOD = 1000000007;
const int N = 5e5+5;
ll dp[N][26];
priority_queue<int,vector<int>,greater<int> > belongs[4];
ll re[4][26];

void remove(int v,int k){
	//cerr<<"removing "<<v<<" from "<<k<<"\n";
	for(int c=0;c<26;c++){
		re[k][c]-=dp[v][c];
		re[k][c]%=MOD;
	}
}
void add(int v,int k){
	//cerr<<"adding "<<v<<" to "<<k<<"\n";
	for(int c=0;c<26;c++){
		re[k][c]+=dp[v][c];
		re[k][c]%=MOD;
		//cout<<re[k][c]<<" ";
	}
	//cout<<"\n";
}
vector<int> ran[N][2];
void printbelongs(){
	cout<<"--------------------\n";
	cout<<"printing...:\n";
	for(int k=0;k<4;k++){
		priority_queue<int,vector<int>,greater<int> > cloneb = belongs[k];
		while(cloneb.size()) {cout<<cloneb.top()<<" ";cloneb.pop();}
		cout<<"\n";
	}
	cout<<"--------------------\n";
}
void mantain(int r,bool t){
	if(!t){
		while(belongs[0].size() && belongs[0].top()<=r){
			belongs[2].push(belongs[0].top());
			remove(belongs[0].top(),0);
			add(belongs[0].top(),2);
			belongs[0].pop();
		}
		while(belongs[1].size() && belongs[1].top()<=r){
			belongs[3].push(belongs[1].top());
			remove(belongs[1].top(),1);
			add(belongs[1].top(),3);
			belongs[1].pop();
		}
	}else{
		while(belongs[0].size() && belongs[0].top()<=r){
			belongs[1].push(belongs[0].top());
			remove(belongs[0].top(),0);
			add(belongs[0].top(),1);
			belongs[0].pop();
		}
		while(belongs[2].size() && belongs[2].top()<=r){
			belongs[3].push(belongs[2].top());
			remove(belongs[2].top(),2);
			add(belongs[2].top(),3);
			belongs[2].pop();
		}
	}
}

ll getrange(int l,int r,int k){
	if(l>r) return 0;
	ll result = re[k][r];
	if(l) result = (result-re[k][l-1])%MOD;
	return result;
}
int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n,m;cin>>n>>m;	
	for(int i=0;i<m;i++){
		int a,b;cin>>a>>b;	
		bool w=  0;	
		if(a>b){w=1;swap(a,b);}
		ran[a+1][w].push_back(b);
	}
	for(int i=n;i>=1;i--){
		belongs[0].push(i);
		for(int c=1;c<26;c++){
			for(int k=0;k<4;k++){
				re[k][c]=(re[k][c]+re[k][c-1])%MOD;
			}
		}
		for(int c=0;c<26;c++){
			if(i==n) dp[i][c]=1;
			else{
				for(int k=0;k<4;k++){
					if(k==0) dp[i][c]+=(getrange(0,c-1,k)+getrange(c+1,25,k))%MOD;
					if(k==1) dp[i][c]+=getrange(0,c-1,k);
					if(k==2) dp[i][c]+=getrange(c+1,25,k);
					dp[i][c]%=MOD;
				}
				dp[i][c]++;
				dp[i][c]%=MOD;
			}
		//	cout<<dp[i][c]<<" ";
		}
		for(int c=25;c>=1;c--){
			for(int k=0;k<4;k++){
				re[k][c] = (re[k][c]-re[k][c-1])%MOD;
			}
		}
		//cout<<"\n";
		for(int k=0;k<4;k++) if(belongs[k].size() && belongs[k].top()==i) add(i,k);
		for(int b=0;b<2;b++){for(auto v : ran[i][b]) mantain(v,b);}
		/*
		cout<<"k:";
		for(int k=0;k<4;k++){
			for(int c=0;c<26;c++){
			cout<<re[k][c]<<" ";
			}
			cout<<"\n";
		}
		printbelongs();
		*/
	}
	ll ans = 0;
	for(int i=0;i<26;i++) ans=(ans+dp[1][i])%MOD;
	if(ans<0) ans+=MOD;
	cout<<ans<<"\n";
	return 0;
}

// abba works...

/*
4 3
2 3
3 1
1 4
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25180 KB Output is correct
2 Correct 5 ms 25260 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 5 ms 25260 KB Output is correct
5 Correct 5 ms 25180 KB Output is correct
6 Correct 5 ms 25180 KB Output is correct
7 Correct 5 ms 25268 KB Output is correct
8 Correct 5 ms 25180 KB Output is correct
9 Correct 5 ms 25180 KB Output is correct
10 Correct 5 ms 25180 KB Output is correct
11 Correct 6 ms 25180 KB Output is correct
12 Correct 5 ms 25256 KB Output is correct
13 Correct 5 ms 25180 KB Output is correct
14 Correct 5 ms 25200 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25180 KB Output is correct
2 Correct 5 ms 25260 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 5 ms 25260 KB Output is correct
5 Correct 5 ms 25180 KB Output is correct
6 Correct 5 ms 25180 KB Output is correct
7 Correct 5 ms 25268 KB Output is correct
8 Correct 5 ms 25180 KB Output is correct
9 Correct 5 ms 25180 KB Output is correct
10 Correct 5 ms 25180 KB Output is correct
11 Correct 6 ms 25180 KB Output is correct
12 Correct 5 ms 25256 KB Output is correct
13 Correct 5 ms 25180 KB Output is correct
14 Correct 5 ms 25200 KB Output is correct
15 Correct 5 ms 25180 KB Output is correct
16 Correct 5 ms 25200 KB Output is correct
17 Correct 5 ms 25176 KB Output is correct
18 Correct 5 ms 25180 KB Output is correct
19 Correct 5 ms 25272 KB Output is correct
20 Correct 5 ms 25180 KB Output is correct
21 Correct 5 ms 25180 KB Output is correct
22 Correct 6 ms 25432 KB Output is correct
23 Correct 5 ms 25180 KB Output is correct
24 Correct 5 ms 25180 KB Output is correct
25 Correct 5 ms 25180 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25180 KB Output is correct
2 Correct 5 ms 25180 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 5 ms 25252 KB Output is correct
5 Correct 584 ms 143248 KB Output is correct
6 Correct 592 ms 149972 KB Output is correct
7 Correct 583 ms 149912 KB Output is correct
8 Correct 583 ms 150104 KB Output is correct
9 Correct 589 ms 149896 KB Output is correct
10 Correct 28 ms 30288 KB Output is correct
11 Correct 5 ms 25176 KB Output is correct
12 Correct 5 ms 25264 KB Output is correct
13 Correct 710 ms 150060 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25180 KB Output is correct
2 Correct 5 ms 25260 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 5 ms 25260 KB Output is correct
5 Correct 5 ms 25180 KB Output is correct
6 Correct 5 ms 25180 KB Output is correct
7 Correct 5 ms 25268 KB Output is correct
8 Correct 5 ms 25180 KB Output is correct
9 Correct 5 ms 25180 KB Output is correct
10 Correct 5 ms 25180 KB Output is correct
11 Correct 6 ms 25180 KB Output is correct
12 Correct 5 ms 25256 KB Output is correct
13 Correct 5 ms 25180 KB Output is correct
14 Correct 5 ms 25200 KB Output is correct
15 Correct 5 ms 25180 KB Output is correct
16 Correct 5 ms 25200 KB Output is correct
17 Correct 5 ms 25176 KB Output is correct
18 Correct 5 ms 25180 KB Output is correct
19 Correct 5 ms 25272 KB Output is correct
20 Correct 5 ms 25180 KB Output is correct
21 Correct 5 ms 25180 KB Output is correct
22 Correct 6 ms 25432 KB Output is correct
23 Correct 5 ms 25180 KB Output is correct
24 Correct 5 ms 25180 KB Output is correct
25 Correct 5 ms 25180 KB Output is correct
26 Correct 31 ms 30104 KB Output is correct
27 Correct 28 ms 29780 KB Output is correct
28 Correct 26 ms 29788 KB Output is correct
29 Correct 31 ms 30056 KB Output is correct
30 Correct 29 ms 30036 KB Output is correct
31 Correct 96 ms 33016 KB Output is correct
32 Correct 29 ms 30044 KB Output is correct
33 Correct 29 ms 30032 KB Output is correct
34 Correct 30 ms 30044 KB Output is correct
35 Correct 106 ms 33368 KB Output is correct
36 Correct 26 ms 29532 KB Output is correct
37 Correct 30 ms 29776 KB Output is correct
38 Correct 28 ms 29704 KB Output is correct
39 Correct 28 ms 29532 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 25180 KB Output is correct
2 Correct 5 ms 25260 KB Output is correct
3 Correct 5 ms 25180 KB Output is correct
4 Correct 5 ms 25260 KB Output is correct
5 Correct 5 ms 25180 KB Output is correct
6 Correct 5 ms 25180 KB Output is correct
7 Correct 5 ms 25268 KB Output is correct
8 Correct 5 ms 25180 KB Output is correct
9 Correct 5 ms 25180 KB Output is correct
10 Correct 5 ms 25180 KB Output is correct
11 Correct 6 ms 25180 KB Output is correct
12 Correct 5 ms 25256 KB Output is correct
13 Correct 5 ms 25180 KB Output is correct
14 Correct 5 ms 25200 KB Output is correct
15 Correct 5 ms 25180 KB Output is correct
16 Correct 5 ms 25200 KB Output is correct
17 Correct 5 ms 25176 KB Output is correct
18 Correct 5 ms 25180 KB Output is correct
19 Correct 5 ms 25272 KB Output is correct
20 Correct 5 ms 25180 KB Output is correct
21 Correct 5 ms 25180 KB Output is correct
22 Correct 6 ms 25432 KB Output is correct
23 Correct 5 ms 25180 KB Output is correct
24 Correct 5 ms 25180 KB Output is correct
25 Correct 5 ms 25180 KB Output is correct
26 Correct 5 ms 25180 KB Output is correct
27 Correct 5 ms 25180 KB Output is correct
28 Correct 5 ms 25180 KB Output is correct
29 Correct 5 ms 25252 KB Output is correct
30 Correct 584 ms 143248 KB Output is correct
31 Correct 592 ms 149972 KB Output is correct
32 Correct 583 ms 149912 KB Output is correct
33 Correct 583 ms 150104 KB Output is correct
34 Correct 589 ms 149896 KB Output is correct
35 Correct 28 ms 30288 KB Output is correct
36 Correct 5 ms 25176 KB Output is correct
37 Correct 5 ms 25264 KB Output is correct
38 Correct 710 ms 150060 KB Output is correct
39 Correct 31 ms 30104 KB Output is correct
40 Correct 28 ms 29780 KB Output is correct
41 Correct 26 ms 29788 KB Output is correct
42 Correct 31 ms 30056 KB Output is correct
43 Correct 29 ms 30036 KB Output is correct
44 Correct 96 ms 33016 KB Output is correct
45 Correct 29 ms 30044 KB Output is correct
46 Correct 29 ms 30032 KB Output is correct
47 Correct 30 ms 30044 KB Output is correct
48 Correct 106 ms 33368 KB Output is correct
49 Correct 26 ms 29532 KB Output is correct
50 Correct 30 ms 29776 KB Output is correct
51 Correct 28 ms 29704 KB Output is correct
52 Correct 28 ms 29532 KB Output is correct
53 Correct 588 ms 139252 KB Output is correct
54 Correct 531 ms 138956 KB Output is correct
55 Correct 654 ms 148308 KB Output is correct
56 Correct 651 ms 148512 KB Output is correct
57 Correct 590 ms 149952 KB Output is correct
58 Correct 590 ms 150012 KB Output is correct
59 Correct 593 ms 149884 KB Output is correct
60 Correct 712 ms 145876 KB Output is correct
61 Correct 462 ms 129176 KB Output is correct
62 Correct 661 ms 141872 KB Output is correct
63 Correct 620 ms 137656 KB Output is correct
64 Correct 571 ms 133052 KB Output is correct