oj.uz

Submission #898055

# Submission time Handle Problem Language Result Execution time Memory
898055 2024-01-04T09:17:04 Z vjudge1 Misspelling (JOI22_misspelling) C++17
100 / 100
 599 ms 202832 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
 
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define str string
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define F first
#define S second
#define all(x) x.begin() , x.end()
#define setpr(x) cout << fixed << setprecision(x) 
#define endl '\n'
 
const int inf = INT_MAX;
const ld eps = 1e-9 , pi = acos(-1.0);
const ll mod = 1e9 + 7; // 998244353;
const int dx[4]{1 , 0 , -1 , 0} , dy[4]{0 , 1 , 0 , -1};

/*
    T_ai <= T_bi --> 
    ai < bi --> S_(ai + 1 , bi) <= S_(ai , bi - 1)
    ai > bi --> S_(bi + 1 , ai) >= S_(bi , ai - 1)
*/

void solution(){
    int n , m; cin >> n >> m;
    vector<vector<int>> kat(n + 1) , kic(n + 1) , dp(n + 1 , vector<int>(26));
    vector<vector<int>> bu(n + 1);
    for(int i = 0 , ai , bi; i < m ; i ++){
        cin >> ai >> bi;
        if(ai < bi) kat[ai].pb(bi);
		else if(ai > bi) kic[bi].pb(ai);
        bu[ai].pb(bi);
        bu[bi].pb(ai);
    }
    for(int i = 0 ; i <= n ; i ++) sort(all(bu[i]));
    // vector<vector<int>> bu(n + 1 , vector<int>(n + 1 , -1)); // < 1 , > 0 , = 2
    // for(int i = 0 ; i < m ; i ++){
    //     if(a[i].F < a[i].S){
    //         for(int j = a[i].F + 1 ; j <= a[i].S ; j ++){
    //             if(bu[j][j - 1] == 0) bu[j][j - 1] = 2;
    //             else bu[j][j - 1] = 1;
    //             if(bu[j - 1][j] == 1) bu[j - 1][j] = 2;
    //             else bu[j - 1][j] = 0;
    //         }
    //     }
    //     else{
    //         for(int j = a[i].S + 1 ; j <= a[i].F ; j ++){
    //             if(bu[j][j - 1] == 1) bu[j][j - 1] = 2;
    //             else bu[j][j - 1] = 0;
    //             if(bu[j - 1][j] == 0) bu[j - 1][j] = 2;
    //             else bu[j - 1][j] = 1;
    //         }
    //     }
    // }
    set<int> kat_u , kic_u;
    vector<int> kat_sm(26) , kic_sm(26);
	for(int i = 0 ; i < 26 ; i ++) dp[n][i] = 1;
	for(int i = n - 1 ; i >= 1 ; i --){
		kat_u.insert(i + 1);
		kic_u.insert(i + 1);
		for(int j = 0 ; j < 26 ; j ++){
			kat_sm[j] += dp[i + 1][j];
			kic_sm[j] += dp[i + 1][j];
		}
        // for(auto x : bu[i]){
        //     if(x < i){
        //         auto it = kic_u.lower_bound(i + 1);
        //         while(it != kic_u.end() && (*it) <= x){
        //             for(int c = 0 ; c < 26 ; c ++) kic_sm[c] -= dp[(*it)][c];
        //             it = kic_u.erase(it);
        //         }
        //     }
        //     else{
        //         auto it = kat_u.lower_bound(i + 1);
        //         while(it != kat_u.end() && (*it) <= x){
        //             for(int c = 0 ; c < 26 ; c ++) kat_sm[c] -= dp[(*it)][c];
        //             it = kat_u.erase(it);
        //         }
        //     }
        // }
		for(auto x : kat[i]){
			auto it = kat_u.lower_bound(i + 1);
			while(it != kat_u.end() && (*it) <= x){
				for(int j = 0 ; j < 26 ; j ++) kat_sm[j] -= dp[(*it)][j];
				it = kat_u.erase(it);
			}
		}
		for (auto x : kic[i]) {
			auto it = kic_u.lower_bound(i + 1);
			while(it != kic_u.end() && (*it) <= x){
				for(int j = 0 ; j < 26 ; j ++) kic_sm[j] -= dp[(*it)][j];
				it = kic_u.erase(it);
			}
		}
		int h = 0 , p = 0;
		for(int j = 0 ; j < 26 ; j ++){
			dp[i][j] += h;
            dp[i][26 - j - 1] += p;
			h += kic_sm[j];
            p += kat_sm[26 - j - 1];
		}
		for(int j = 0 ; j < 26 ; j ++) dp[i][j] ++ , dp[i][j] %= mod;
	}
	int h = 0;
	for (int j = 0 ; j < 26 ; j ++) h += dp[1][j];
	cout << h % mod;
}  
 
signed main(){
    IOS;
    int t = 1; // cin >> t;
    while(t --) solution();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 356 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 356 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 456 KB Output is correct
25 Correct 1 ms 348 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 296 ms 194956 KB Output is correct
6 Correct 292 ms 194896 KB Output is correct
7 Correct 302 ms 194952 KB Output is correct
8 Correct 306 ms 195428 KB Output is correct
9 Correct 291 ms 194900 KB Output is correct
10 Correct 11 ms 8028 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 569 ms 195064 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 356 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 456 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 11 ms 8024 KB Output is correct
27 Correct 11 ms 8540 KB Output is correct
28 Correct 10 ms 8540 KB Output is correct
29 Correct 19 ms 8660 KB Output is correct
30 Correct 13 ms 8284 KB Output is correct
31 Correct 138 ms 30020 KB Output is correct
32 Correct 11 ms 8028 KB Output is correct
33 Correct 11 ms 8280 KB Output is correct
34 Correct 13 ms 8048 KB Output is correct
35 Correct 162 ms 30420 KB Output is correct
36 Correct 12 ms 8284 KB Output is correct
37 Correct 12 ms 7636 KB Output is correct
38 Correct 10 ms 7512 KB Output is correct
39 Correct 9 ms 7000 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 356 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 2 ms 860 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 456 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 296 ms 194956 KB Output is correct
31 Correct 292 ms 194896 KB Output is correct
32 Correct 302 ms 194952 KB Output is correct
33 Correct 306 ms 195428 KB Output is correct
34 Correct 291 ms 194900 KB Output is correct
35 Correct 11 ms 8028 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 569 ms 195064 KB Output is correct
39 Correct 11 ms 8024 KB Output is correct
40 Correct 11 ms 8540 KB Output is correct
41 Correct 10 ms 8540 KB Output is correct
42 Correct 19 ms 8660 KB Output is correct
43 Correct 13 ms 8284 KB Output is correct
44 Correct 138 ms 30020 KB Output is correct
45 Correct 11 ms 8028 KB Output is correct
46 Correct 11 ms 8280 KB Output is correct
47 Correct 13 ms 8048 KB Output is correct
48 Correct 162 ms 30420 KB Output is correct
49 Correct 12 ms 8284 KB Output is correct
50 Correct 12 ms 7636 KB Output is correct
51 Correct 10 ms 7512 KB Output is correct
52 Correct 9 ms 7000 KB Output is correct
53 Correct 310 ms 181732 KB Output is correct
54 Correct 333 ms 202832 KB Output is correct
55 Correct 523 ms 197040 KB Output is correct
56 Correct 512 ms 196944 KB Output is correct
57 Correct 297 ms 194896 KB Output is correct
58 Correct 290 ms 194776 KB Output is correct
59 Correct 296 ms 194900 KB Output is correct
60 Correct 599 ms 192336 KB Output is correct
61 Correct 345 ms 199972 KB Output is correct
62 Correct 488 ms 185476 KB Output is correct
63 Correct 405 ms 177740 KB Output is correct
64 Correct 291 ms 168532 KB Output is correct