oj.uz

답안 #544701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544701 2022-04-02T15:04:32 Z kevinxiehk Misspelling (JOI22_misspelling) C++17
100 / 100
 3193 ms 171476 KB 
#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
#define int long long
#define inf 1e18
#define ick cout<<"ickbmi32.9\n"
using namespace std;
int n, m;
int dp[500005][30];
vector<int> up[500005], down[500005];
priority_queue<pair<int, int>, vector<pair<int, int>>, less<>> nowup, nowdown;
const int mod = 1000000007;
signed main(){
    ios_base::sync_with_stdio(false); 
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    int l, r;
    for(int i = 0; i < m; i++) {
        cin >> l >> r;
        if(l < r) {
            down[l].pb(r);
        }
        else up[r].pb(l);
    }
    for(int i = 0; i <= 26; i++) {
        dp[1][i] = 1;
    }
    for(auto x: down[1]) {
        nowdown.push(mp(1, x));
    }
    for(auto x: up[1]) {
        nowup.push(mp(1, x));
    }
    for(int i = 2; i <= n; i++) {
        while(!nowup.empty() && nowup.top().se < i) nowup.pop();
        while(!nowdown.empty() && nowdown.top().se < i) nowdown.pop();

        for(int j = 0; j < 26; j++) dp[i][j] = dp[i - 1][j];
        
        if(nowup.empty() && nowdown.empty()) {
            for(int j = 0; j < 26; j++) {
                for(int k = 0; k < 26; k++) {
                    if(j != k) {
                        dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;
                    }
                }
            }
        }
        else if(nowup.empty()) {
            int lim = nowdown.top().fi;
            for(int j = 0; j < 26; j++) {
                for(int k = 0; k < 26; k++) {
                    if(j != k) {
                        dp[i][j] = (dp[i][j] + dp[i - 1][k] - dp[lim][k] + mod) % mod;
                    }
                }
            }
            for(int j = 0; j < 26; j++) {
                for(int k = j + 1; k < 26; k++) {
                    if(j != k) {
                        dp[i][j] = (dp[i][j] + dp[lim][k] + mod) % mod;
                    }
                }
            }
        }
        else if(nowdown.empty()){
            int lim = nowup.top().fi;
            for(int j = 0; j < 26; j++) {
                for(int k = 0; k < 26; k++) {
                    if(j != k) {
                        dp[i][j] = (dp[i][j] + dp[i - 1][k] - dp[lim][k] + mod) % mod;
                    }
                }
            }
            for(int j = 0; j < 26; j++) {
                for(int k = 0; k < j; k++) {
                    if(j != k) {
                        dp[i][j] = (dp[i][j] + dp[lim][k] + mod) % mod;
                    }
                }
            }
        }
        else {
            int limup = nowup.top().fi;
            int limdown = nowdown.top().fi;
            int lim = max(limup, limdown);
            for(int j = 0; j < 26; j++) {
                for(int k = 0; k < 26; k++) {
                    if(j != k) {
                        dp[i][j] = (dp[i][j] + dp[i - 1][k] - dp[lim][k] + mod) % mod;
                    }
                }
            }
            if(limup < limdown) {
                for(int j = 0; j < 26; j++) {
                    for(int k = j + 1; k < 26; k++) {
                        if(j != k) {
                            dp[i][j] = (dp[i][j] + dp[lim][k] - dp[limup][k] + mod) % mod;
                        }
                    }
                }
            }
            else {
                for(int j = 0; j < 26; j++) {
                    for(int k = 0; k < j; k++) {
                        if(j != k) {
                            dp[i][j] = (dp[i][j] + dp[lim][k] - dp[limdown][k] + mod) % mod;
                        }
                    }
                }
            }
        }

        for(auto x: down[i]) {
            nowdown.push(mp(i, x));
        }
        for(auto x: up[i]) {
            nowup.push(mp(i, x));
        }
    }

    int ans = 0;
    for(int i = 0; i < 26; i++) ans += dp[n][i];
    cout << ans % mod << '\n';
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 15 ms 23764 KB Output is correct
4 Correct 14 ms 23764 KB Output is correct
5 Correct 14 ms 23764 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 14 ms 23816 KB Output is correct
8 Correct 15 ms 23792 KB Output is correct
9 Correct 14 ms 23784 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 15 ms 23816 KB Output is correct
12 Correct 15 ms 23928 KB Output is correct
13 Correct 17 ms 23764 KB Output is correct
14 Correct 15 ms 23816 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 15 ms 23764 KB Output is correct
4 Correct 14 ms 23764 KB Output is correct
5 Correct 14 ms 23764 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 14 ms 23816 KB Output is correct
8 Correct 15 ms 23792 KB Output is correct
9 Correct 14 ms 23784 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 15 ms 23816 KB Output is correct
12 Correct 15 ms 23928 KB Output is correct
13 Correct 17 ms 23764 KB Output is correct
14 Correct 15 ms 23816 KB Output is correct
15 Correct 14 ms 23764 KB Output is correct
16 Correct 15 ms 23776 KB Output is correct
17 Correct 15 ms 23764 KB Output is correct
18 Correct 16 ms 23876 KB Output is correct
19 Correct 16 ms 23764 KB Output is correct
20 Correct 17 ms 23824 KB Output is correct
21 Correct 16 ms 23764 KB Output is correct
22 Correct 18 ms 24276 KB Output is correct
23 Correct 16 ms 23764 KB Output is correct
24 Correct 14 ms 23812 KB Output is correct
25 Correct 15 ms 23760 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 14 ms 23764 KB Output is correct
4 Correct 14 ms 23764 KB Output is correct
5 Correct 3077 ms 170460 KB Output is correct
6 Correct 3012 ms 170412 KB Output is correct
7 Correct 3012 ms 169860 KB Output is correct
8 Correct 3098 ms 170580 KB Output is correct
9 Correct 3076 ms 169904 KB Output is correct
10 Correct 142 ms 29800 KB Output is correct
11 Correct 17 ms 23880 KB Output is correct
12 Correct 15 ms 23816 KB Output is correct
13 Correct 3152 ms 171476 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 15 ms 23764 KB Output is correct
4 Correct 14 ms 23764 KB Output is correct
5 Correct 14 ms 23764 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 14 ms 23816 KB Output is correct
8 Correct 15 ms 23792 KB Output is correct
9 Correct 14 ms 23784 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 15 ms 23816 KB Output is correct
12 Correct 15 ms 23928 KB Output is correct
13 Correct 17 ms 23764 KB Output is correct
14 Correct 15 ms 23816 KB Output is correct
15 Correct 14 ms 23764 KB Output is correct
16 Correct 15 ms 23776 KB Output is correct
17 Correct 15 ms 23764 KB Output is correct
18 Correct 16 ms 23876 KB Output is correct
19 Correct 16 ms 23764 KB Output is correct
20 Correct 17 ms 23824 KB Output is correct
21 Correct 16 ms 23764 KB Output is correct
22 Correct 18 ms 24276 KB Output is correct
23 Correct 16 ms 23764 KB Output is correct
24 Correct 14 ms 23812 KB Output is correct
25 Correct 15 ms 23760 KB Output is correct
26 Correct 132 ms 29768 KB Output is correct
27 Correct 131 ms 29156 KB Output is correct
28 Correct 147 ms 29128 KB Output is correct
29 Correct 144 ms 29788 KB Output is correct
30 Correct 134 ms 29692 KB Output is correct
31 Correct 305 ms 47892 KB Output is correct
32 Correct 144 ms 29464 KB Output is correct
33 Correct 133 ms 29624 KB Output is correct
34 Correct 132 ms 29660 KB Output is correct
35 Correct 304 ms 47332 KB Output is correct
36 Correct 87 ms 28532 KB Output is correct
37 Correct 131 ms 29316 KB Output is correct
38 Correct 128 ms 29160 KB Output is correct
39 Correct 125 ms 28788 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 15 ms 23764 KB Output is correct
4 Correct 14 ms 23764 KB Output is correct
5 Correct 14 ms 23764 KB Output is correct
6 Correct 14 ms 23764 KB Output is correct
7 Correct 14 ms 23816 KB Output is correct
8 Correct 15 ms 23792 KB Output is correct
9 Correct 14 ms 23784 KB Output is correct
10 Correct 15 ms 23764 KB Output is correct
11 Correct 15 ms 23816 KB Output is correct
12 Correct 15 ms 23928 KB Output is correct
13 Correct 17 ms 23764 KB Output is correct
14 Correct 15 ms 23816 KB Output is correct
15 Correct 14 ms 23764 KB Output is correct
16 Correct 15 ms 23776 KB Output is correct
17 Correct 15 ms 23764 KB Output is correct
18 Correct 16 ms 23876 KB Output is correct
19 Correct 16 ms 23764 KB Output is correct
20 Correct 17 ms 23824 KB Output is correct
21 Correct 16 ms 23764 KB Output is correct
22 Correct 18 ms 24276 KB Output is correct
23 Correct 16 ms 23764 KB Output is correct
24 Correct 14 ms 23812 KB Output is correct
25 Correct 15 ms 23760 KB Output is correct
26 Correct 16 ms 23764 KB Output is correct
27 Correct 13 ms 23812 KB Output is correct
28 Correct 14 ms 23764 KB Output is correct
29 Correct 14 ms 23764 KB Output is correct
30 Correct 3077 ms 170460 KB Output is correct
31 Correct 3012 ms 170412 KB Output is correct
32 Correct 3012 ms 169860 KB Output is correct
33 Correct 3098 ms 170580 KB Output is correct
34 Correct 3076 ms 169904 KB Output is correct
35 Correct 142 ms 29800 KB Output is correct
36 Correct 17 ms 23880 KB Output is correct
37 Correct 15 ms 23816 KB Output is correct
38 Correct 3152 ms 171476 KB Output is correct
39 Correct 132 ms 29768 KB Output is correct
40 Correct 131 ms 29156 KB Output is correct
41 Correct 147 ms 29128 KB Output is correct
42 Correct 144 ms 29788 KB Output is correct
43 Correct 134 ms 29692 KB Output is correct
44 Correct 305 ms 47892 KB Output is correct
45 Correct 144 ms 29464 KB Output is correct
46 Correct 133 ms 29624 KB Output is correct
47 Correct 132 ms 29660 KB Output is correct
48 Correct 304 ms 47332 KB Output is correct
49 Correct 87 ms 28532 KB Output is correct
50 Correct 131 ms 29316 KB Output is correct
51 Correct 128 ms 29160 KB Output is correct
52 Correct 125 ms 28788 KB Output is correct
53 Correct 3095 ms 156440 KB Output is correct
54 Correct 3005 ms 156396 KB Output is correct
55 Correct 3058 ms 163180 KB Output is correct
56 Correct 3100 ms 170040 KB Output is correct
57 Correct 3026 ms 170004 KB Output is correct
58 Correct 2994 ms 164348 KB Output is correct
59 Correct 3076 ms 163640 KB Output is correct
60 Correct 3193 ms 163548 KB Output is correct
61 Correct 2089 ms 141140 KB Output is correct
62 Correct 3116 ms 161788 KB Output is correct
63 Correct 3054 ms 155312 KB Output is correct
64 Correct 2923 ms 148500 KB Output is correct