Submission #552100

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
552100	2022-04-22T11:54:02 Z	errorgorn	Misspelling (JOI22_misspelling)	C++17	100 / 100	1014 ms	163500 KB

misspelling

// Super Idol的笑容
//    都没你的甜
//  八月正午的阳光
//    都没你耀眼
//  热爱105°C的你
// 滴滴清纯的蒸馏水

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const int MOD=1000000007;

int fix(int i){
	return (i%MOD+MOD)%MOD;
}

int n,m;
int tot[26];
int memo[500005][26];

int up[500005];
int down[500005];

set<int> gup;
set<int> gdown;

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m;
	
	rep(x,1,n+1) up[x]=down[x]=x;
	
	int a,b;
	rep(x,0,m){
		cin>>a>>b;
		
		if (a<b) up[a]=max(up[a],b);
		else down[b]=max(down[b],a);
	}
	
	rep(x,1,n+2) gup.insert(x);
	rep(x,1,n+2) gdown.insert(x);
	
	rep(y,0,26) tot[y]=1;
	
	rep(x,n+1,1){
		while (*gup.lb(x+1)<=up[x]){
			int temp=*gup.lb(x+1);
			gup.erase(temp);
			
			int curr=0;
			rep(y,0,26){
				tot[y]=fix(tot[y]-curr);
				curr=fix(curr+memo[temp][y]);
			}
		}
		while (*gdown.lb(x+1)<=down[x]){
			int temp=*gdown.lb(x+1);
			gdown.erase(temp);
			
			int curr=0;
			rep(y,26,0){
				tot[y]=fix(tot[y]-curr);
				curr=fix(curr+memo[temp][y]);
			}
		}
		
		rep(y,0,26) memo[x][y]=tot[y];
		
		int curr=0;
		rep(y,0,26) curr=fix(curr+memo[x][y]);
		rep(y,0,26) tot[y]=fix(tot[y]+curr-memo[x][y]);
	}
	
	int ans=0;
	rep(y,0,26) ans=fix(ans+memo[1][y]);
	
	cout<<ans<<endl;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct

Subtask #3
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1000 ms	163068 KB	Output is correct
6	Correct	959 ms	162744 KB	Output is correct
7	Correct	956 ms	162740 KB	Output is correct
8	Correct	1014 ms	162792 KB	Output is correct
9	Correct	949 ms	162764 KB	Output is correct
10	Correct	29 ms	6780 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	987 ms	163260 KB	Output is correct

Subtask #4
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	30 ms	6732 KB	Output is correct
27	Correct	22 ms	6612 KB	Output is correct
28	Correct	24 ms	6564 KB	Output is correct
29	Correct	34 ms	6588 KB	Output is correct
30	Correct	32 ms	6736 KB	Output is correct
31	Correct	102 ms	10648 KB	Output is correct
32	Correct	30 ms	6700 KB	Output is correct
33	Correct	32 ms	6784 KB	Output is correct
34	Correct	30 ms	6708 KB	Output is correct
35	Correct	98 ms	9820 KB	Output is correct
36	Correct	16 ms	6600 KB	Output is correct
37	Correct	34 ms	6716 KB	Output is correct
38	Correct	32 ms	6572 KB	Output is correct
39	Correct	29 ms	6568 KB	Output is correct

Subtask #5
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1000 ms	163068 KB	Output is correct
31	Correct	959 ms	162744 KB	Output is correct
32	Correct	956 ms	162740 KB	Output is correct
33	Correct	1014 ms	162792 KB	Output is correct
34	Correct	949 ms	162764 KB	Output is correct
35	Correct	29 ms	6780 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	987 ms	163260 KB	Output is correct
39	Correct	30 ms	6732 KB	Output is correct
40	Correct	22 ms	6612 KB	Output is correct
41	Correct	24 ms	6564 KB	Output is correct
42	Correct	34 ms	6588 KB	Output is correct
43	Correct	32 ms	6736 KB	Output is correct
44	Correct	102 ms	10648 KB	Output is correct
45	Correct	30 ms	6700 KB	Output is correct
46	Correct	32 ms	6784 KB	Output is correct
47	Correct	30 ms	6708 KB	Output is correct
48	Correct	98 ms	9820 KB	Output is correct
49	Correct	16 ms	6600 KB	Output is correct
50	Correct	34 ms	6716 KB	Output is correct
51	Correct	32 ms	6572 KB	Output is correct
52	Correct	29 ms	6568 KB	Output is correct
53	Correct	908 ms	160008 KB	Output is correct
54	Correct	748 ms	159872 KB	Output is correct
55	Correct	960 ms	156884 KB	Output is correct
56	Correct	970 ms	163500 KB	Output is correct
57	Correct	993 ms	163240 KB	Output is correct
58	Correct	963 ms	159932 KB	Output is correct
59	Correct	953 ms	156912 KB	Output is correct
60	Correct	974 ms	159140 KB	Output is correct
61	Correct	598 ms	156844 KB	Output is correct
62	Correct	976 ms	161656 KB	Output is correct
63	Correct	926 ms	160168 KB	Output is correct
64	Correct	920 ms	158392 KB	Output is correct

Submission #552100

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 20.0 / 20.0

Subtask #3 29.0 / 29.0

Subtask #4 32.0 / 32.0

Subtask #5 11.0 / 11.0

Subtask #1
8.0 / 8.0

Subtask #2
20.0 / 20.0

Subtask #3
29.0 / 29.0

Subtask #4
32.0 / 32.0

Subtask #5
11.0 / 11.0