oj.uz

Submission #858840

# Submission time Handle Problem Language Result Execution time Memory
858840 2023-10-09T08:58:36 Z willychan Misspelling (JOI22_misspelling) C++14
60 / 100
 4000 ms 125564 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();
		}
	}
}
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=0;c<26;c++){
			if(i==n) dp[i][c]=1;
			else{
				for(int f=0;f<26;f++){
					for(int k=0;k<4;k++){
						if(k==0 && f!=c) dp[i][c]+=re[k][f];
						if(k==1 && f<c) dp[i][c]+=re[k][f];
						if(k==2 && f>c) dp[i][c]+=re[k][f];
						dp[i][c]%=MOD;
					}
				}
				dp[i][c]++;
				dp[i][c]%=MOD;
			}
		//	cout<<dp[i][c]<<" ";
		}
		//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

# Verdict Execution time Memory Grader output
1 Correct 8 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 6 ms 25208 KB Output is correct
5 Correct 7 ms 25180 KB Output is correct
6 Correct 5 ms 25180 KB Output is correct
7 Correct 6 ms 25180 KB Output is correct
8 Correct 5 ms 25180 KB Output is correct
9 Correct 6 ms 25432 KB Output is correct
10 Correct 5 ms 25196 KB Output is correct
11 Correct 5 ms 25180 KB Output is correct
12 Correct 5 ms 25180 KB Output is correct
13 Correct 6 ms 25180 KB Output is correct
14 Correct 5 ms 25180 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 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 6 ms 25208 KB Output is correct
5 Correct 7 ms 25180 KB Output is correct
6 Correct 5 ms 25180 KB Output is correct
7 Correct 6 ms 25180 KB Output is correct
8 Correct 5 ms 25180 KB Output is correct
9 Correct 6 ms 25432 KB Output is correct
10 Correct 5 ms 25196 KB Output is correct
11 Correct 5 ms 25180 KB Output is correct
12 Correct 5 ms 25180 KB Output is correct
13 Correct 6 ms 25180 KB Output is correct
14 Correct 5 ms 25180 KB Output is correct
15 Correct 7 ms 25180 KB Output is correct
16 Correct 7 ms 25260 KB Output is correct
17 Correct 8 ms 25276 KB Output is correct
18 Correct 8 ms 25268 KB Output is correct
19 Correct 7 ms 25436 KB Output is correct
20 Correct 9 ms 25224 KB Output is correct
21 Correct 7 ms 25180 KB Output is correct
22 Correct 10 ms 25180 KB Output is correct
23 Correct 7 ms 25180 KB Output is correct
24 Correct 8 ms 25192 KB Output is correct
25 Correct 9 ms 25180 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 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 25180 KB Output is correct
5 Execution timed out 4081 ms 125564 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 8 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 6 ms 25208 KB Output is correct
5 Correct 7 ms 25180 KB Output is correct
6 Correct 5 ms 25180 KB Output is correct
7 Correct 6 ms 25180 KB Output is correct
8 Correct 5 ms 25180 KB Output is correct
9 Correct 6 ms 25432 KB Output is correct
10 Correct 5 ms 25196 KB Output is correct
11 Correct 5 ms 25180 KB Output is correct
12 Correct 5 ms 25180 KB Output is correct
13 Correct 6 ms 25180 KB Output is correct
14 Correct 5 ms 25180 KB Output is correct
15 Correct 7 ms 25180 KB Output is correct
16 Correct 7 ms 25260 KB Output is correct
17 Correct 8 ms 25276 KB Output is correct
18 Correct 8 ms 25268 KB Output is correct
19 Correct 7 ms 25436 KB Output is correct
20 Correct 9 ms 25224 KB Output is correct
21 Correct 7 ms 25180 KB Output is correct
22 Correct 10 ms 25180 KB Output is correct
23 Correct 7 ms 25180 KB Output is correct
24 Correct 8 ms 25192 KB Output is correct
25 Correct 9 ms 25180 KB Output is correct
26 Correct 219 ms 30808 KB Output is correct
27 Correct 199 ms 29988 KB Output is correct
28 Correct 202 ms 29980 KB Output is correct
29 Correct 213 ms 30292 KB Output is correct
30 Correct 201 ms 30336 KB Output is correct
31 Correct 294 ms 38328 KB Output is correct
32 Correct 203 ms 30640 KB Output is correct
33 Correct 209 ms 30292 KB Output is correct
34 Correct 207 ms 30148 KB Output is correct
35 Correct 289 ms 38616 KB Output is correct
36 Correct 194 ms 29396 KB Output is correct
37 Correct 204 ms 29904 KB Output is correct
38 Correct 200 ms 29784 KB Output is correct
39 Correct 200 ms 29580 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 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 6 ms 25208 KB Output is correct
5 Correct 7 ms 25180 KB Output is correct
6 Correct 5 ms 25180 KB Output is correct
7 Correct 6 ms 25180 KB Output is correct
8 Correct 5 ms 25180 KB Output is correct
9 Correct 6 ms 25432 KB Output is correct
10 Correct 5 ms 25196 KB Output is correct
11 Correct 5 ms 25180 KB Output is correct
12 Correct 5 ms 25180 KB Output is correct
13 Correct 6 ms 25180 KB Output is correct
14 Correct 5 ms 25180 KB Output is correct
15 Correct 7 ms 25180 KB Output is correct
16 Correct 7 ms 25260 KB Output is correct
17 Correct 8 ms 25276 KB Output is correct
18 Correct 8 ms 25268 KB Output is correct
19 Correct 7 ms 25436 KB Output is correct
20 Correct 9 ms 25224 KB Output is correct
21 Correct 7 ms 25180 KB Output is correct
22 Correct 10 ms 25180 KB Output is correct
23 Correct 7 ms 25180 KB Output is correct
24 Correct 8 ms 25192 KB Output is correct
25 Correct 9 ms 25180 KB Output is correct
26 Correct 5 ms 25176 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 25180 KB Output is correct
30 Execution timed out 4081 ms 125564 KB Time limit exceeded
31 Halted 0 ms 0 KB -