oj.uz

Submission #737100

# Submission time Handle Problem Language Result Execution time Memory
737100 2023-05-06T15:46:31 Z myrcella Misspelling (JOI22_misspelling) C++17
100 / 100
 421 ms 151540 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 5e5+10;

int dp[maxn][26],sum[maxn][26];
pq <pii> q1,q2;
vector <int> r1[maxn],r2[maxn];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	int n,m;
	cin>>n>>m;
	rep(i,0,m) {
		int u,v;
		cin>>u>>v;
		if (u<v) r1[u+1].pb(v);
		else r2[v+1].pb(u);
	}
	q1.push({1,n}),q2.push({1,n});
	rep(i,0,26) dp[1][i] = sum[1][i] = 1;
	rep(i,2,n+1) {
		for (auto it:r1[i]) q1.push({i,it});
		for (auto it:r2[i]) q2.push({i,it});
		while (q1.top().se<i) q1.pop();
		while (q2.top().se<i) q2.pop();
		int cur1 = q1.top().fi, cur2 = q2.top().fi;
//		debug(cur1),debug(cur2);
		int cur = max(cur1,cur2);
		int tmp = 0;
		if(cur!=i) {
			rep(j,0,26) inc(tmp,(sum[i-1][j] - sum[cur-1][j] + mod)%mod);
			rep(j,0,26) inc(dp[i][j],tmp),inc(dp[i][j],(-sum[i-1][j] + sum[cur-1][j] + mod)%mod);
		}
		if (cur1<cur2) { //larger
			tmp = (sum[cur2-1][0] - sum[cur1-1][0] + mod)%mod;
			rep(j,1,26) {
				inc(dp[i][j],tmp);
				inc(tmp,(sum[cur2-1][j] - sum[cur1-1][j] + mod)%mod);
			}
		}
		else if (cur2<cur1){ //smaller
			tmp = (sum[cur1-1][25] - sum[cur2-1][25] + mod)%mod;
			for (int j = 24;j>=0;j--) {
				inc(dp[i][j],tmp);
				inc(tmp,(sum[cur1-1][j] - sum[cur2-1][j] + mod)%mod);
			}
		}
		rep(j,0,26) {
			sum[i][j] = (sum[i-1][j] + dp[i][j])%mod;
			//cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
		}
	}
	int ans = 0;
	rep(i,0,26) inc(ans,sum[n][i]);
	cout<<ans;
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23816 KB Output is correct
3 Correct 17 ms 23764 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23812 KB Output is correct
6 Correct 14 ms 23816 KB Output is correct
7 Correct 13 ms 23796 KB Output is correct
8 Correct 12 ms 23812 KB Output is correct
9 Correct 12 ms 23784 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 12 ms 23808 KB Output is correct
12 Correct 12 ms 23764 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23816 KB Output is correct
3 Correct 17 ms 23764 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23812 KB Output is correct
6 Correct 14 ms 23816 KB Output is correct
7 Correct 13 ms 23796 KB Output is correct
8 Correct 12 ms 23812 KB Output is correct
9 Correct 12 ms 23784 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 12 ms 23808 KB Output is correct
12 Correct 12 ms 23764 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23844 KB Output is correct
16 Correct 12 ms 23840 KB Output is correct
17 Correct 13 ms 23808 KB Output is correct
18 Correct 13 ms 23836 KB Output is correct
19 Correct 13 ms 23864 KB Output is correct
20 Correct 15 ms 23828 KB Output is correct
21 Correct 14 ms 23796 KB Output is correct
22 Correct 16 ms 24148 KB Output is correct
23 Correct 14 ms 23816 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23928 KB Output is correct
2 Correct 14 ms 23804 KB Output is correct
3 Correct 13 ms 23816 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 272 ms 151296 KB Output is correct
6 Correct 272 ms 151324 KB Output is correct
7 Correct 288 ms 151252 KB Output is correct
8 Correct 273 ms 151540 KB Output is correct
9 Correct 275 ms 151156 KB Output is correct
10 Correct 23 ms 28904 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 14 ms 23892 KB Output is correct
13 Correct 396 ms 151260 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23816 KB Output is correct
3 Correct 17 ms 23764 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23812 KB Output is correct
6 Correct 14 ms 23816 KB Output is correct
7 Correct 13 ms 23796 KB Output is correct
8 Correct 12 ms 23812 KB Output is correct
9 Correct 12 ms 23784 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 12 ms 23808 KB Output is correct
12 Correct 12 ms 23764 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23844 KB Output is correct
16 Correct 12 ms 23840 KB Output is correct
17 Correct 13 ms 23808 KB Output is correct
18 Correct 13 ms 23836 KB Output is correct
19 Correct 13 ms 23864 KB Output is correct
20 Correct 15 ms 23828 KB Output is correct
21 Correct 14 ms 23796 KB Output is correct
22 Correct 16 ms 24148 KB Output is correct
23 Correct 14 ms 23816 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 23 ms 29012 KB Output is correct
27 Correct 22 ms 28432 KB Output is correct
28 Correct 22 ms 28500 KB Output is correct
29 Correct 24 ms 28876 KB Output is correct
30 Correct 26 ms 28896 KB Output is correct
31 Correct 176 ms 41008 KB Output is correct
32 Correct 24 ms 28756 KB Output is correct
33 Correct 24 ms 28812 KB Output is correct
34 Correct 26 ms 28768 KB Output is correct
35 Correct 157 ms 39600 KB Output is correct
36 Correct 19 ms 27860 KB Output is correct
37 Correct 25 ms 28532 KB Output is correct
38 Correct 26 ms 28440 KB Output is correct
39 Correct 23 ms 28188 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23816 KB Output is correct
3 Correct 17 ms 23764 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23812 KB Output is correct
6 Correct 14 ms 23816 KB Output is correct
7 Correct 13 ms 23796 KB Output is correct
8 Correct 12 ms 23812 KB Output is correct
9 Correct 12 ms 23784 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 12 ms 23808 KB Output is correct
12 Correct 12 ms 23764 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23844 KB Output is correct
16 Correct 12 ms 23840 KB Output is correct
17 Correct 13 ms 23808 KB Output is correct
18 Correct 13 ms 23836 KB Output is correct
19 Correct 13 ms 23864 KB Output is correct
20 Correct 15 ms 23828 KB Output is correct
21 Correct 14 ms 23796 KB Output is correct
22 Correct 16 ms 24148 KB Output is correct
23 Correct 14 ms 23816 KB Output is correct
24 Correct 13 ms 23764 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 14 ms 23928 KB Output is correct
27 Correct 14 ms 23804 KB Output is correct
28 Correct 13 ms 23816 KB Output is correct
29 Correct 13 ms 23764 KB Output is correct
30 Correct 272 ms 151296 KB Output is correct
31 Correct 272 ms 151324 KB Output is correct
32 Correct 288 ms 151252 KB Output is correct
33 Correct 273 ms 151540 KB Output is correct
34 Correct 275 ms 151156 KB Output is correct
35 Correct 23 ms 28904 KB Output is correct
36 Correct 13 ms 23764 KB Output is correct
37 Correct 14 ms 23892 KB Output is correct
38 Correct 396 ms 151260 KB Output is correct
39 Correct 23 ms 29012 KB Output is correct
40 Correct 22 ms 28432 KB Output is correct
41 Correct 22 ms 28500 KB Output is correct
42 Correct 24 ms 28876 KB Output is correct
43 Correct 26 ms 28896 KB Output is correct
44 Correct 176 ms 41008 KB Output is correct
45 Correct 24 ms 28756 KB Output is correct
46 Correct 24 ms 28812 KB Output is correct
47 Correct 26 ms 28768 KB Output is correct
48 Correct 157 ms 39600 KB Output is correct
49 Correct 19 ms 27860 KB Output is correct
50 Correct 25 ms 28532 KB Output is correct
51 Correct 26 ms 28440 KB Output is correct
52 Correct 23 ms 28188 KB Output is correct
53 Correct 252 ms 138808 KB Output is correct
54 Correct 258 ms 138816 KB Output is correct
55 Correct 337 ms 150164 KB Output is correct
56 Correct 360 ms 150220 KB Output is correct
57 Correct 291 ms 151120 KB Output is correct
58 Correct 290 ms 150112 KB Output is correct
59 Correct 271 ms 151320 KB Output is correct
60 Correct 421 ms 147796 KB Output is correct
61 Correct 189 ms 125500 KB Output is correct
62 Correct 386 ms 143176 KB Output is correct
63 Correct 316 ms 137580 KB Output is correct
64 Correct 266 ms 131976 KB Output is correct