oj.uz

Submission #602535

# Submission time Handle Problem Language Result Execution time Memory
602535 2022-07-23T07:39:25 Z SamAnd Misspelling (JOI22_misspelling) C++17
100 / 100
 478 ms 136108 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 500005, M = 1000000007;

int n, m;
int a[N];

vector<int> v[N];

int dp[N][26][2];

void solv()
{
    cin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        cin >> x >> y;
        if (x == y)
            continue;
        if (x < y)
        {
            v[x].push_back(y);
        }
        else
        {
            v[y].push_back(-x);
        }
    }

    stack<int> g[2];

    int s[26] = {};
    for (int k = 0; k < 26; ++k)
    {
        dp[n][k][0] = 1;
        s[k] = 1;
    }
    for (int i = n - 1; i >= 1; --i)
    {
        /*for (int k = 0; k < 26; ++k)
        {
            for (int j = i + 1; j <= n; ++j)
            {
                s[k] = (s[k] + dp[j][k][0]) % M;
                s[k] = (s[k] + dp[j][k][1]) % M;
            }
        }*/
        int p[26] = {};
        p[0] = s[0];
        for (int k = 1; k < 26; ++k)
            p[k] = (p[k - 1] + s[k]) % M;
        for (int k = 0; k < 26; ++k)
        {
            dp[i][k][1] = (p[25] - p[k] + M) % M;
            if (k)
                dp[i][k][0] = p[k - 1];
            s[k] = (s[k] + dp[i][k][1]) % M;
            s[k] = (s[k] + dp[i][k][0]) % M;
            /*for (int u = k + 1; u < 26; ++u)
                dp[i][k][1] = (dp[i][k][1] + s[u]) % M;
            for (int u = 0; u < k; ++u)
                dp[i][k][0] = (dp[i][k][0] + s[u]) % M;*/
        }
        g[0].push(i);
        g[1].push(i);
        for(int t = 0; t < sz(v[i]); ++t)
        {
            if (v[i][t] > 0)
            {
                while (!g[1].empty())
                {
                    int j = g[1].top();
                    if (j < v[i][t])
                    {
                        for (int k = 0; k < 26; ++k)
                        {
                            s[k] = (s[k] - dp[j][k][1] + M) % M;
                            dp[j][k][1] = 0;
                        }
                        g[1].pop();
                    }
                    else
                        break;
                }
            }
            else
            {
                while (!g[0].empty())
                {
                    int j = g[0].top();
                    if (j < -v[i][t])
                    {
                        for (int k = 0; k < 26; ++k)
                        {
                            s[k] = (s[k] - dp[j][k][0] + M) % M;
                            dp[j][k][0] = 0;
                        }
                        g[0].pop();
                    }
                    else
                        break;
                }
            }
        }
    }

    int ans = 0;
    for (int k = 0; k < 26; ++k)
        ans = (ans + s[k]) % M;

    cout << ans << "\n";
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    ios_base::sync_with_stdio(false), cin.tie(0);

    int tt = 1;
    //cin >> tt;
    while (tt--)
    {
        solv();
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11964 KB Output is correct
2 Correct 9 ms 11988 KB Output is correct
3 Correct 8 ms 11988 KB Output is correct
4 Correct 8 ms 11988 KB Output is correct
5 Correct 8 ms 12008 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 9 ms 11988 KB Output is correct
8 Correct 10 ms 11988 KB Output is correct
9 Correct 10 ms 11992 KB Output is correct
10 Correct 10 ms 11988 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 7 ms 12080 KB Output is correct
13 Correct 9 ms 11988 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11964 KB Output is correct
2 Correct 9 ms 11988 KB Output is correct
3 Correct 8 ms 11988 KB Output is correct
4 Correct 8 ms 11988 KB Output is correct
5 Correct 8 ms 12008 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 9 ms 11988 KB Output is correct
8 Correct 10 ms 11988 KB Output is correct
9 Correct 10 ms 11992 KB Output is correct
10 Correct 10 ms 11988 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 7 ms 12080 KB Output is correct
13 Correct 9 ms 11988 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct
15 Correct 9 ms 12128 KB Output is correct
16 Correct 9 ms 12092 KB Output is correct
17 Correct 9 ms 12124 KB Output is correct
18 Correct 10 ms 12116 KB Output is correct
19 Correct 8 ms 12116 KB Output is correct
20 Correct 8 ms 12116 KB Output is correct
21 Correct 8 ms 12116 KB Output is correct
22 Correct 12 ms 12116 KB Output is correct
23 Correct 9 ms 12112 KB Output is correct
24 Correct 9 ms 12020 KB Output is correct
25 Correct 9 ms 12132 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12000 KB Output is correct
2 Correct 7 ms 12044 KB Output is correct
3 Correct 8 ms 11988 KB Output is correct
4 Correct 9 ms 11988 KB Output is correct
5 Correct 381 ms 135896 KB Output is correct
6 Correct 360 ms 135932 KB Output is correct
7 Correct 355 ms 135940 KB Output is correct
8 Correct 380 ms 136008 KB Output is correct
9 Correct 382 ms 135972 KB Output is correct
10 Correct 25 ms 16980 KB Output is correct
11 Correct 7 ms 12084 KB Output is correct
12 Correct 8 ms 12084 KB Output is correct
13 Correct 418 ms 130816 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11964 KB Output is correct
2 Correct 9 ms 11988 KB Output is correct
3 Correct 8 ms 11988 KB Output is correct
4 Correct 8 ms 11988 KB Output is correct
5 Correct 8 ms 12008 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 9 ms 11988 KB Output is correct
8 Correct 10 ms 11988 KB Output is correct
9 Correct 10 ms 11992 KB Output is correct
10 Correct 10 ms 11988 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 7 ms 12080 KB Output is correct
13 Correct 9 ms 11988 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct
15 Correct 9 ms 12128 KB Output is correct
16 Correct 9 ms 12092 KB Output is correct
17 Correct 9 ms 12124 KB Output is correct
18 Correct 10 ms 12116 KB Output is correct
19 Correct 8 ms 12116 KB Output is correct
20 Correct 8 ms 12116 KB Output is correct
21 Correct 8 ms 12116 KB Output is correct
22 Correct 12 ms 12116 KB Output is correct
23 Correct 9 ms 12112 KB Output is correct
24 Correct 9 ms 12020 KB Output is correct
25 Correct 9 ms 12132 KB Output is correct
26 Correct 24 ms 16852 KB Output is correct
27 Correct 19 ms 16636 KB Output is correct
28 Correct 16 ms 16596 KB Output is correct
29 Correct 22 ms 16732 KB Output is correct
30 Correct 21 ms 16720 KB Output is correct
31 Correct 124 ms 24892 KB Output is correct
32 Correct 24 ms 16904 KB Output is correct
33 Correct 17 ms 16912 KB Output is correct
34 Correct 23 ms 16696 KB Output is correct
35 Correct 168 ms 25052 KB Output is correct
36 Correct 14 ms 16208 KB Output is correct
37 Correct 21 ms 16512 KB Output is correct
38 Correct 22 ms 16480 KB Output is correct
39 Correct 18 ms 16260 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11964 KB Output is correct
2 Correct 9 ms 11988 KB Output is correct
3 Correct 8 ms 11988 KB Output is correct
4 Correct 8 ms 11988 KB Output is correct
5 Correct 8 ms 12008 KB Output is correct
6 Correct 7 ms 11988 KB Output is correct
7 Correct 9 ms 11988 KB Output is correct
8 Correct 10 ms 11988 KB Output is correct
9 Correct 10 ms 11992 KB Output is correct
10 Correct 10 ms 11988 KB Output is correct
11 Correct 8 ms 11988 KB Output is correct
12 Correct 7 ms 12080 KB Output is correct
13 Correct 9 ms 11988 KB Output is correct
14 Correct 7 ms 11988 KB Output is correct
15 Correct 9 ms 12128 KB Output is correct
16 Correct 9 ms 12092 KB Output is correct
17 Correct 9 ms 12124 KB Output is correct
18 Correct 10 ms 12116 KB Output is correct
19 Correct 8 ms 12116 KB Output is correct
20 Correct 8 ms 12116 KB Output is correct
21 Correct 8 ms 12116 KB Output is correct
22 Correct 12 ms 12116 KB Output is correct
23 Correct 9 ms 12112 KB Output is correct
24 Correct 9 ms 12020 KB Output is correct
25 Correct 9 ms 12132 KB Output is correct
26 Correct 8 ms 12000 KB Output is correct
27 Correct 7 ms 12044 KB Output is correct
28 Correct 8 ms 11988 KB Output is correct
29 Correct 9 ms 11988 KB Output is correct
30 Correct 381 ms 135896 KB Output is correct
31 Correct 360 ms 135932 KB Output is correct
32 Correct 355 ms 135940 KB Output is correct
33 Correct 380 ms 136008 KB Output is correct
34 Correct 382 ms 135972 KB Output is correct
35 Correct 25 ms 16980 KB Output is correct
36 Correct 7 ms 12084 KB Output is correct
37 Correct 8 ms 12084 KB Output is correct
38 Correct 418 ms 130816 KB Output is correct
39 Correct 24 ms 16852 KB Output is correct
40 Correct 19 ms 16636 KB Output is correct
41 Correct 16 ms 16596 KB Output is correct
42 Correct 22 ms 16732 KB Output is correct
43 Correct 21 ms 16720 KB Output is correct
44 Correct 124 ms 24892 KB Output is correct
45 Correct 24 ms 16904 KB Output is correct
46 Correct 17 ms 16912 KB Output is correct
47 Correct 23 ms 16696 KB Output is correct
48 Correct 168 ms 25052 KB Output is correct
49 Correct 14 ms 16208 KB Output is correct
50 Correct 21 ms 16512 KB Output is correct
51 Correct 22 ms 16480 KB Output is correct
52 Correct 18 ms 16260 KB Output is correct
53 Correct 306 ms 125188 KB Output is correct
54 Correct 275 ms 126932 KB Output is correct
55 Correct 437 ms 131560 KB Output is correct
56 Correct 478 ms 131500 KB Output is correct
57 Correct 390 ms 136108 KB Output is correct
58 Correct 357 ms 136044 KB Output is correct
59 Correct 376 ms 136108 KB Output is correct
60 Correct 476 ms 129444 KB Output is correct
61 Correct 203 ms 117476 KB Output is correct
62 Correct 419 ms 126328 KB Output is correct
63 Correct 414 ms 122872 KB Output is correct
64 Correct 307 ms 118748 KB Output is correct