oj.uz

Submission #880413

# Submission time Handle Problem Language Result Execution time Memory
880413 2023-11-29T11:24:58 Z DAleksa Misspelling (JOI22_misspelling) C++17
100 / 100
 1577 ms 319428 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int mod = 1e9 + 7;
 
int add(int x, int y) { x += y; return x >= mod ? x - mod : x; }
int sub(int x, int y) { x -= y; return x < 0 ? x + mod : x; }
void sadd(int& x, int y) { x = add(x, y); }
void ssub(int& x, int y) { x = sub(x, y); }
 
struct Fenwick {
    int n;
    vector<int> fenw;
    Fenwick() { }
    Fenwick(int _n) {
        n = _n;
        fenw.resize(n);
        for(int i = 0; i < n; i++) fenw[i] = 0;
    }
    void update(int x, int val) { x++; for(int i = x; i < n; i += (i & -i)) sadd(fenw[i], val); }
    int get(int r) {
        r++;
        int ans = 0;
        for(int i = r; i >= 1; i -= (i & -i)) sadd(ans, fenw[i]);
        return ans;
    }
    int get(int l, int r) {
        if(l > r) return 0;
        return sub(get(r), get(l - 1));
    }
};
 
const int N = 5e5 + 10, M = 26;
int n, m;
int a[N], b[N];
int dp[N][M][2];
int important[N][2];
int first[N];
int pref[N][M][2];
vector<Fenwick> fw(M);
vector<int> down[N], up[N];
set<int> s;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        cin >> a[i] >> b[i];
        if(a[i] < b[i]) down[b[i]].push_back(a[i]);
        else up[a[i]].push_back(b[i]);
    }
    for(int i = n; i >= 1; i--) {
        auto it = s.upper_bound(i);
        if(it == s.begin()) important[i][0] = 0;
        else {
            it--;
            important[i][0] = *it;
        }
        for(int j : down[i]) s.insert(j);
    }
    s.clear();
    for(int i = n; i >= 1; i--) {
        auto it = s.upper_bound(i);
        if(it == s.begin()) important[i][1] = 0;
        else {
            it--;
            important[i][1] = *it;
        }
        for(int j : up[i]) s.insert(j);
    }
    for(int i = 1; i <= n; i++) {
        if(important[i][0] > important[i][1]) first[i] = 1;
        else {
            first[i] = 2;
            swap(important[i][0], important[i][1]);
        }
    }
    for(int i = 0; i < M; i++) fw[i] = Fenwick(n + 2);
    for(int c = 0; c < M; c++) {
        dp[0][c][0] = dp[0][c][1] = 1;
        fw[c].update(0, 1);
    }
    // for(int i = 1; i <= n; i++) cout << i << ": " << important[i][0] << " " << important[i][1] << " " << first[i] << "\n";
    for(int i = 1; i <= n; i++) {
        for(int c = 0; c < M; c++) {
            dp[i][c][0] = fw[c].get(important[i][0], i - 1);
            dp[i][c][1] = fw[c].get(important[i][1], important[i][0] - 1);
//            if(important[i][0] == 0) sadd(dp[i][c][0], 1);
//            if(important[i][1] == 0 && important[i][0] > 0) sadd(dp[i][c][1], 1);
        }
        pref[i][0][0] = dp[i][0][0];
        pref[i][0][1] = dp[i][0][1];
        for(int c = 1; c < M; c++) pref[i][c][0] = add(pref[i][c - 1][0], dp[i][c][0]);
        for(int c = 1; c < M; c++) pref[i][c][1] = add(pref[i][c - 1][1], dp[i][c][1]);
        for(int nwc = 0; nwc < M; nwc++) {
            fw[nwc].update(i, add(sub(pref[i][M - 1][0], pref[i][nwc][0]), (nwc > 0 ? pref[i][nwc - 1][0] : 0)));
            if(first[i] == 1) fw[nwc].update(i, sub(pref[i][M - 1][1], pref[i][nwc][1]));
            else if(first[i] == 2 && nwc > 0) fw[nwc].update(i, pref[i][nwc - 1][1]);
        }
    }
    // for(int i = 1; i <= n; i++) {
    //     for(int j = 0; j < M; j++) cout << dp[i][j][0] + dp[i][j][1] << " ";
    //     cout << "\n";
    // }
    int ans = 0;
    for(int c = 0; c < M; c++) {
        sadd(ans, dp[n][c][0]);
        sadd(ans, dp[n][c][1]);
    }
    cout << ans;
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 35416 KB Output is correct
2 Correct 7 ms 35420 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35416 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 7 ms 35416 KB Output is correct
8 Correct 7 ms 35420 KB Output is correct
9 Correct 7 ms 35420 KB Output is correct
10 Correct 8 ms 35500 KB Output is correct
11 Correct 7 ms 35672 KB Output is correct
12 Correct 7 ms 35500 KB Output is correct
13 Correct 7 ms 35500 KB Output is correct
14 Correct 7 ms 35420 KB Output is correct
15 Correct 7 ms 35416 KB Output is correct
16 Correct 8 ms 35672 KB Output is correct
17 Correct 7 ms 35420 KB Output is correct
18 Correct 8 ms 35420 KB Output is correct
19 Correct 7 ms 35504 KB Output is correct
20 Correct 8 ms 35416 KB Output is correct
21 Correct 7 ms 35416 KB Output is correct
22 Correct 8 ms 35664 KB Output is correct
23 Correct 7 ms 35420 KB Output is correct
24 Correct 7 ms 35548 KB Output is correct
25 Correct 7 ms 35416 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 35516 KB Output is correct
2 Correct 7 ms 35420 KB Output is correct
3 Correct 7 ms 35672 KB Output is correct
4 Correct 8 ms 35420 KB Output is correct
5 Correct 1402 ms 319208 KB Output is correct
6 Correct 1433 ms 319244 KB Output is correct
7 Correct 1341 ms 319144 KB Output is correct
8 Correct 1369 ms 319168 KB Output is correct
9 Correct 1377 ms 318980 KB Output is correct
10 Correct 45 ms 47564 KB Output is correct
11 Correct 7 ms 35420 KB Output is correct
12 Correct 6 ms 35516 KB Output is correct
13 Correct 1551 ms 318956 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 35416 KB Output is correct
2 Correct 7 ms 35420 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35416 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 7 ms 35416 KB Output is correct
8 Correct 7 ms 35420 KB Output is correct
9 Correct 7 ms 35420 KB Output is correct
10 Correct 8 ms 35500 KB Output is correct
11 Correct 7 ms 35672 KB Output is correct
12 Correct 7 ms 35500 KB Output is correct
13 Correct 7 ms 35500 KB Output is correct
14 Correct 7 ms 35420 KB Output is correct
15 Correct 7 ms 35416 KB Output is correct
16 Correct 8 ms 35672 KB Output is correct
17 Correct 7 ms 35420 KB Output is correct
18 Correct 8 ms 35420 KB Output is correct
19 Correct 7 ms 35504 KB Output is correct
20 Correct 8 ms 35416 KB Output is correct
21 Correct 7 ms 35416 KB Output is correct
22 Correct 8 ms 35664 KB Output is correct
23 Correct 7 ms 35420 KB Output is correct
24 Correct 7 ms 35548 KB Output is correct
25 Correct 7 ms 35416 KB Output is correct
26 Correct 45 ms 46932 KB Output is correct
27 Correct 38 ms 45908 KB Output is correct
28 Correct 39 ms 45908 KB Output is correct
29 Correct 45 ms 46768 KB Output is correct
30 Correct 43 ms 46672 KB Output is correct
31 Correct 145 ms 53332 KB Output is correct
32 Correct 40 ms 47044 KB Output is correct
33 Correct 40 ms 46804 KB Output is correct
34 Correct 45 ms 46672 KB Output is correct
35 Correct 160 ms 53660 KB Output is correct
36 Correct 30 ms 45740 KB Output is correct
37 Correct 43 ms 46548 KB Output is correct
38 Correct 43 ms 46164 KB Output is correct
39 Correct 43 ms 45904 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 35416 KB Output is correct
2 Correct 7 ms 35420 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35416 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 7 ms 35416 KB Output is correct
8 Correct 7 ms 35420 KB Output is correct
9 Correct 7 ms 35420 KB Output is correct
10 Correct 8 ms 35500 KB Output is correct
11 Correct 7 ms 35672 KB Output is correct
12 Correct 7 ms 35500 KB Output is correct
13 Correct 7 ms 35500 KB Output is correct
14 Correct 7 ms 35420 KB Output is correct
15 Correct 7 ms 35416 KB Output is correct
16 Correct 8 ms 35672 KB Output is correct
17 Correct 7 ms 35420 KB Output is correct
18 Correct 8 ms 35420 KB Output is correct
19 Correct 7 ms 35504 KB Output is correct
20 Correct 8 ms 35416 KB Output is correct
21 Correct 7 ms 35416 KB Output is correct
22 Correct 8 ms 35664 KB Output is correct
23 Correct 7 ms 35420 KB Output is correct
24 Correct 7 ms 35548 KB Output is correct
25 Correct 7 ms 35416 KB Output is correct
26 Correct 9 ms 35516 KB Output is correct
27 Correct 7 ms 35420 KB Output is correct
28 Correct 7 ms 35672 KB Output is correct
29 Correct 8 ms 35420 KB Output is correct
30 Correct 1402 ms 319208 KB Output is correct
31 Correct 1433 ms 319244 KB Output is correct
32 Correct 1341 ms 319144 KB Output is correct
33 Correct 1369 ms 319168 KB Output is correct
34 Correct 1377 ms 318980 KB Output is correct
35 Correct 45 ms 47564 KB Output is correct
36 Correct 7 ms 35420 KB Output is correct
37 Correct 6 ms 35516 KB Output is correct
38 Correct 1551 ms 318956 KB Output is correct
39 Correct 45 ms 46932 KB Output is correct
40 Correct 38 ms 45908 KB Output is correct
41 Correct 39 ms 45908 KB Output is correct
42 Correct 45 ms 46768 KB Output is correct
43 Correct 43 ms 46672 KB Output is correct
44 Correct 145 ms 53332 KB Output is correct
45 Correct 40 ms 47044 KB Output is correct
46 Correct 40 ms 46804 KB Output is correct
47 Correct 45 ms 46672 KB Output is correct
48 Correct 160 ms 53660 KB Output is correct
49 Correct 30 ms 45740 KB Output is correct
50 Correct 43 ms 46548 KB Output is correct
51 Correct 43 ms 46164 KB Output is correct
52 Correct 43 ms 45904 KB Output is correct
53 Correct 1497 ms 306800 KB Output is correct
54 Correct 1275 ms 296824 KB Output is correct
55 Correct 1482 ms 315044 KB Output is correct
56 Correct 1564 ms 314964 KB Output is correct
57 Correct 1404 ms 318944 KB Output is correct
58 Correct 1384 ms 319428 KB Output is correct
59 Correct 1340 ms 318980 KB Output is correct
60 Correct 1577 ms 312112 KB Output is correct
61 Correct 1079 ms 287412 KB Output is correct
62 Correct 1557 ms 306684 KB Output is correct
63 Correct 1447 ms 301248 KB Output is correct
64 Correct 1473 ms 295000 KB Output is correct