oj.uz

Submission #567675

# Submission time Handle Problem Language Result Execution time Memory
567675 2022-05-24T03:19:39 Z jamezzz Misspelling (JOI22_misspelling) C++17
100 / 100
 1077 ms 105996 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#define getchar_unlocked getchar
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
mt19937 rng(time(0));

#define mod 1000000007

inline int add(int a,int b){
	int r=a+b;
	while(r>=mod)r-=mod;
	while(r<0)r+=mod;
	return r;
}

inline int mult(int a,int b){
	return (int)(((ll)(a*b))%mod);
}

inline int rd(){
	int x=0;
	char ch=getchar_unlocked();
	while(!(ch&16))ch=getchar();//keep reading while current character is whitespace
    while(ch&16){//this will break when ‘\n’ or ‘ ‘ is encountered
		x=(x<<3)+(x<<1)+(ch&15);
		ch=getchar_unlocked();
	}
	return x;
}

#define maxn 500005

int n,m,a,b,far_up[maxn],far_down[maxn];
int tot[maxn],dp[maxn][26];
set<int> t_up,t_down;

int main(){
	sf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)far_up[i]=far_down[i]=i;
	for(int i=0;i<m;++i){
		sf("%d%d",&a,&b);
		if(a<b)mxto(far_down[a],b);//[a,far_down[a]] cannot go up
		else mxto(far_up[b],a);//[b,far_up[b]] cannot go down
	}
	
	for(int i=1;i<=n+1;++i){
		t_up.insert(i);//possible transitions up
		t_down.insert(i);//possible transitions down
	}
	
	for(int i=0;i<26;++i)tot[i]=1;
	
	for(int i=n;i>=1;--i){
		while(*t_up.lower_bound(i+1)<=far_down[i]){//illegal transition
			int x=*t_up.lower_bound(i+1);
			t_up.erase(x);
			int pfx=0;
			for(int j=25;j>=0;--j){
				tot[j]=add(tot[j],-pfx);
				pfx=add(pfx,dp[x][j]);
			}
		}
		while(*t_down.lower_bound(i+1)<=far_up[i]){//illegal transition
			int x=*t_down.lower_bound(i+1);
			t_down.erase(x);
			int pfx=0;
			for(int j=0;j<26;++j){
				tot[j]=add(tot[j],-pfx);
				pfx=add(pfx,dp[x][j]);
			}
		}
		int sm=0;
		for(int j=0;j<26;++j){
			dp[i][j]=tot[j];
			sm=add(sm,dp[i][j]);
		}
		for(int j=0;j<26;++j){
			tot[j]=add(tot[j],add(sm,-dp[i][j]));
		}
	}
	
	int ans=0;
	for(int j=0;j<26;++j){
		ans=add(ans,dp[1][j]);
	}
	pf("%d\n",ans);
}

Compilation message

misspelling.cpp: In function 'int main()':
misspelling.cpp:64:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |  sf("%d%d",&n,&m);
      |    ^
misspelling.cpp:67:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |   sf("%d%d",&a,&b);
      |     ^

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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 316 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 0 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 316 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 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 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 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 3 ms 396 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 316 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1077 ms 105996 KB Output is correct
6 Correct 1014 ms 104464 KB Output is correct
7 Correct 1038 ms 104432 KB Output is correct
8 Correct 1046 ms 104364 KB Output is correct
9 Correct 1008 ms 104476 KB Output is correct
10 Correct 34 ms 4556 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 917 ms 104316 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 316 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 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 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 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 3 ms 396 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 41 ms 4560 KB Output is correct
27 Correct 26 ms 4408 KB Output is correct
28 Correct 23 ms 4428 KB Output is correct
29 Correct 29 ms 4556 KB Output is correct
30 Correct 29 ms 4596 KB Output is correct
31 Correct 105 ms 8008 KB Output is correct
32 Correct 39 ms 4568 KB Output is correct
33 Correct 35 ms 4512 KB Output is correct
34 Correct 35 ms 4524 KB Output is correct
35 Correct 118 ms 8136 KB Output is correct
36 Correct 14 ms 4308 KB Output is correct
37 Correct 28 ms 4424 KB Output is correct
38 Correct 27 ms 4480 KB Output is correct
39 Correct 28 ms 4412 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 316 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 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 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 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 3 ms 396 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 316 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 1077 ms 105996 KB Output is correct
31 Correct 1014 ms 104464 KB Output is correct
32 Correct 1038 ms 104432 KB Output is correct
33 Correct 1046 ms 104364 KB Output is correct
34 Correct 1008 ms 104476 KB Output is correct
35 Correct 34 ms 4556 KB Output is correct
36 Correct 1 ms 352 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 917 ms 104316 KB Output is correct
39 Correct 41 ms 4560 KB Output is correct
40 Correct 26 ms 4408 KB Output is correct
41 Correct 23 ms 4428 KB Output is correct
42 Correct 29 ms 4556 KB Output is correct
43 Correct 29 ms 4596 KB Output is correct
44 Correct 105 ms 8008 KB Output is correct
45 Correct 39 ms 4568 KB Output is correct
46 Correct 35 ms 4512 KB Output is correct
47 Correct 35 ms 4524 KB Output is correct
48 Correct 118 ms 8136 KB Output is correct
49 Correct 14 ms 4308 KB Output is correct
50 Correct 28 ms 4424 KB Output is correct
51 Correct 27 ms 4480 KB Output is correct
52 Correct 28 ms 4412 KB Output is correct
53 Correct 950 ms 104408 KB Output is correct
54 Correct 741 ms 104420 KB Output is correct
55 Correct 987 ms 104552 KB Output is correct
56 Correct 971 ms 104400 KB Output is correct
57 Correct 1004 ms 104348 KB Output is correct
58 Correct 1028 ms 104532 KB Output is correct
59 Correct 1006 ms 104564 KB Output is correct
60 Correct 914 ms 104336 KB Output is correct
61 Correct 502 ms 102144 KB Output is correct
62 Correct 936 ms 104432 KB Output is correct
63 Correct 947 ms 104356 KB Output is correct
64 Correct 931 ms 103796 KB Output is correct