oj.uz

Submission #684345

# Submission time Handle Problem Language Result Execution time Memory
684345 2023-01-21T00:05:53 Z arnold518 Misspelling (JOI22_misspelling) C++17
100 / 100
 652 ms 249812 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 5e5;
const ll MOD = 1e9+7;

int N, M;
vector<pii> A, B;
int PA[MAXN+10], PB[MAXN+10];

struct priority_set
{
	priority_queue<int> PQ1, PQ2;
	void push(int x) { PQ1.push(x); }
	void pop(int x) { PQ2.push(x); }
	bool empty()
	{
		while(!PQ1.empty() && !PQ2.empty() && PQ1.top()==PQ2.top()) PQ1.pop(), PQ2.pop();
		return PQ1.empty();
	}
	int top()
	{
		if(empty()) return 0;
		return PQ1.top();
	}
};

ll dp[30];
ll dp1[MAXN+10][30], dp2[MAXN+10][30];

int main()
{
	scanf("%d%d", &N, &M);
	for(int i=1; i<=M; i++)
	{
		int p, q;
		scanf("%d%d", &p, &q);
		if(p<q) A.push_back({p, q-1});
		else B.push_back({q, p-1});
	}

	{
		priority_set PS;
		vector<pii> V;
		for(int i=0; i<A.size(); i++)
		{
			V.push_back({A[i].first, i+1});
			V.push_back({A[i].second+1, -i-1});
		}
		sort(V.begin(), V.end());

		for(int i=1, j=0; i<N; i++)
		{
			for(; j<V.size() && V[j].first==i; j++)
			{
				if(V[j].second>0) PS.push(A[V[j].second-1].first);
				else PS.pop(A[-V[j].second-1].first); 
			}
			PA[i]=PS.top();
		}
	}
	{
		priority_set PS;
		vector<pii> V;
		for(int i=0; i<B.size(); i++)
		{
			V.push_back({B[i].first, i+1});
			V.push_back({B[i].second+1, -i-1});
		}
		sort(V.begin(), V.end());

		for(int i=1, j=0; i<N; i++)
		{
			for(; j<V.size() && V[j].first==i; j++)
			{
				if(V[j].second>0) PS.push(B[V[j].second-1].first);
				else PS.pop(B[-V[j].second-1].first); 
			}
			PB[i]=PS.top();
		}
	}

	for(int j=1; j<=26; j++)
	{
		dp1[0][j]=j;
		dp2[0][26-j+1]=j;
	}
	for(int i=1; i<N; i++)
	{
		for(int j=1; j<=26; j++)
		{
			dp[j]=0;
			if(PA[i]<PB[i])
			{
				int l, r;
				l=PB[i], r=i-1;
				if(l<=r)
				{
					if(l>=1) dp[j]+=(dp1[r][j-1]-dp1[l-1][j-1])+(dp2[r][j+1]-dp2[l-1][j+1]);
					else dp[j]+=dp1[r][j-1]+dp2[r][j+1];
					dp[j]%=MOD;
					if(dp[j]<0) dp[j]+=MOD;
				}
				l=PA[i], r=PB[i]-1;
				if(l<=r)
				{
					if(l>=1) dp[j]+=(dp1[r][j-1]-dp1[l-1][j-1]);
					else dp[j]+=dp1[r][j-1];
					dp[j]%=MOD;
					if(dp[j]<0) dp[j]+=MOD;
				}
			}
			else
			{
				int l, r;
				l=PA[i], r=i-1;
				if(l<=r)
				{
					if(l>=1) dp[j]+=(dp1[r][j-1]-dp1[l-1][j-1])+(dp2[r][j+1]-dp2[l-1][j+1]);
					else dp[j]+=dp1[r][j-1]+dp2[r][j+1];
					dp[j]%=MOD;
					if(dp[j]<0) dp[j]+=MOD;
				}
				l=PB[i], r=PA[i]-1;
				if(l<=r)
				{
					if(l>=1) dp[j]+=(dp2[r][j+1]-dp2[l-1][j+1]);
					else dp[j]+=dp2[r][j+1];
					dp[j]%=MOD;
					if(dp[j]<0) dp[j]+=MOD;
				}
			}
		}

		for(int j=1; j<=26; j++) dp1[i][j]=(dp1[i][j-1]+dp[j])%MOD;
		for(int j=26; j>=1; j--) dp2[i][j]=(dp2[i][j+1]+dp[j])%MOD;
		for(int j=1; j<=26; j++)
		{
			dp1[i][j]=(dp1[i-1][j]+dp1[i][j])%MOD;
			dp2[i][j]=(dp2[i-1][j]+dp2[i][j])%MOD;
		}
	}
	printf("%lld\n", dp1[N-1][26]);
}

Compilation message

misspelling.cpp: In function 'int main()':
misspelling.cpp:49:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for(int i=0; i<A.size(); i++)
      |                ~^~~~~~~~~
misspelling.cpp:58:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |    for(; j<V.size() && V[j].first==i; j++)
      |          ~^~~~~~~~~
misspelling.cpp:69:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   for(int i=0; i<B.size(); i++)
      |                ~^~~~~~~~~
misspelling.cpp:78:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |    for(; j<V.size() && V[j].first==i; j++)
      |          ~^~~~~~~~~
misspelling.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
misspelling.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |   scanf("%d%d", &p, &q);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 436 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 5 ms 752 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 436 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 546 ms 249672 KB Output is correct
6 Correct 518 ms 249620 KB Output is correct
7 Correct 528 ms 249672 KB Output is correct
8 Correct 507 ms 249652 KB Output is correct
9 Correct 571 ms 249668 KB Output is correct
10 Correct 20 ms 10368 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 622 ms 249616 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 436 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 5 ms 752 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 436 KB Output is correct
26 Correct 21 ms 10324 KB Output is correct
27 Correct 19 ms 10156 KB Output is correct
28 Correct 20 ms 10264 KB Output is correct
29 Correct 24 ms 10284 KB Output is correct
30 Correct 24 ms 10380 KB Output is correct
31 Correct 331 ms 25828 KB Output is correct
32 Correct 23 ms 10468 KB Output is correct
33 Correct 22 ms 10456 KB Output is correct
34 Correct 26 ms 10448 KB Output is correct
35 Correct 247 ms 19288 KB Output is correct
36 Correct 15 ms 9812 KB Output is correct
37 Correct 23 ms 10368 KB Output is correct
38 Correct 23 ms 10188 KB Output is correct
39 Correct 18 ms 10044 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 436 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 5 ms 752 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 436 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 546 ms 249672 KB Output is correct
31 Correct 518 ms 249620 KB Output is correct
32 Correct 528 ms 249672 KB Output is correct
33 Correct 507 ms 249652 KB Output is correct
34 Correct 571 ms 249668 KB Output is correct
35 Correct 20 ms 10368 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 622 ms 249616 KB Output is correct
39 Correct 21 ms 10324 KB Output is correct
40 Correct 19 ms 10156 KB Output is correct
41 Correct 20 ms 10264 KB Output is correct
42 Correct 24 ms 10284 KB Output is correct
43 Correct 24 ms 10380 KB Output is correct
44 Correct 331 ms 25828 KB Output is correct
45 Correct 23 ms 10468 KB Output is correct
46 Correct 22 ms 10456 KB Output is correct
47 Correct 26 ms 10448 KB Output is correct
48 Correct 247 ms 19288 KB Output is correct
49 Correct 15 ms 9812 KB Output is correct
50 Correct 23 ms 10368 KB Output is correct
51 Correct 23 ms 10188 KB Output is correct
52 Correct 18 ms 10044 KB Output is correct
53 Correct 476 ms 247308 KB Output is correct
54 Correct 517 ms 247272 KB Output is correct
55 Correct 648 ms 249812 KB Output is correct
56 Correct 652 ms 249760 KB Output is correct
57 Correct 551 ms 249620 KB Output is correct
58 Correct 552 ms 249616 KB Output is correct
59 Correct 551 ms 249720 KB Output is correct
60 Correct 651 ms 249764 KB Output is correct
61 Correct 363 ms 238932 KB Output is correct
62 Correct 599 ms 247048 KB Output is correct
63 Correct 537 ms 244516 KB Output is correct
64 Correct 437 ms 241732 KB Output is correct