oj.uz

Submission #589416

# Submission time Handle Problem Language Result Execution time Memory
589416 2022-07-04T16:10:59 Z qwerasdfzxcl Misspelling (JOI22_misspelling) C++14
100 / 100
 407 ms 153700 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
const int MOD = 1e9+7;
ll dp[500500][26];
int pos[2][500500]; ///up -> 0, down -> 1
vector<int> E[2][500500];

int main(){
    int n, m;
    scanf("%d %d", &n, &m);
    for (int i=1;i<=m;i++){
        int x, y;
        scanf("%d %d", &x, &y);
        if (x<y) E[0][x].push_back(y);
        else E[1][y].push_back(x);
    }

    for (int k=0;k<2;k++){
        priority_queue<pair<int, int>> pq;
        for (int i=1;i<=n;i++){
            while(!pq.empty() && pq.top().second<i) pq.pop();
            if (!pq.empty()) pos[k][i] = pq.top().first;

            for (auto &r:E[k][i]) pq.emplace(i, r);
        }
    }


    fill(dp[1], dp[1]+26, 1);
    for (int i=2;i<=n;i++){
        for (int k=0;k<26;k++) dp[i][k] = dp[i-1][k];

        ll cur = 0;
        for (int k=1;k<26;k++){
            cur += dp[i-1][k-1] - dp[pos[0][i]][k-1] + MOD;
            while(cur>=MOD) cur -= MOD;

            dp[i][k] += cur;
            if (dp[i][k]>=MOD) dp[i][k] -= MOD;
        }

        cur = 0;
        for (int k=24;k>=0;k--){
            cur += dp[i-1][k+1] - dp[pos[1][i]][k+1] + MOD;
            while(cur>=MOD) cur -= MOD;

            dp[i][k] += cur;
            if (dp[i][k]>=MOD) dp[i][k] -= MOD;
        }
    }

    ll ans = 0;
    for (int k=0;k<26;k++) ans = (ans + dp[n][k]) % MOD;
    printf("%lld\n", ans);
    return 0;
}

Compilation message

misspelling.cpp: In function 'int main()':
misspelling.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
misspelling.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23728 KB Output is correct
4 Correct 12 ms 23816 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23812 KB Output is correct
7 Correct 14 ms 23892 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 16 ms 23716 KB Output is correct
13 Correct 14 ms 23800 KB Output is correct
14 Correct 26 ms 23744 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23728 KB Output is correct
4 Correct 12 ms 23816 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23812 KB Output is correct
7 Correct 14 ms 23892 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 16 ms 23716 KB Output is correct
13 Correct 14 ms 23800 KB Output is correct
14 Correct 26 ms 23744 KB Output is correct
15 Correct 12 ms 23860 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 13 ms 23856 KB Output is correct
18 Correct 13 ms 23852 KB Output is correct
19 Correct 13 ms 23816 KB Output is correct
20 Correct 12 ms 23860 KB Output is correct
21 Correct 12 ms 23804 KB Output is correct
22 Correct 14 ms 24032 KB Output is correct
23 Correct 12 ms 23892 KB Output is correct
24 Correct 12 ms 23752 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 11 ms 23812 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23764 KB Output is correct
5 Correct 287 ms 151800 KB Output is correct
6 Correct 279 ms 151812 KB Output is correct
7 Correct 269 ms 151720 KB Output is correct
8 Correct 272 ms 151840 KB Output is correct
9 Correct 263 ms 151664 KB Output is correct
10 Correct 24 ms 28980 KB Output is correct
11 Correct 13 ms 23816 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 407 ms 151968 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23728 KB Output is correct
4 Correct 12 ms 23816 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23812 KB Output is correct
7 Correct 14 ms 23892 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 16 ms 23716 KB Output is correct
13 Correct 14 ms 23800 KB Output is correct
14 Correct 26 ms 23744 KB Output is correct
15 Correct 12 ms 23860 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 13 ms 23856 KB Output is correct
18 Correct 13 ms 23852 KB Output is correct
19 Correct 13 ms 23816 KB Output is correct
20 Correct 12 ms 23860 KB Output is correct
21 Correct 12 ms 23804 KB Output is correct
22 Correct 14 ms 24032 KB Output is correct
23 Correct 12 ms 23892 KB Output is correct
24 Correct 12 ms 23752 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 23 ms 28980 KB Output is correct
27 Correct 22 ms 28472 KB Output is correct
28 Correct 26 ms 28484 KB Output is correct
29 Correct 23 ms 29024 KB Output is correct
30 Correct 22 ms 28852 KB Output is correct
31 Correct 194 ms 37164 KB Output is correct
32 Correct 22 ms 29028 KB Output is correct
33 Correct 23 ms 28944 KB Output is correct
34 Correct 24 ms 28760 KB Output is correct
35 Correct 153 ms 37440 KB Output is correct
36 Correct 24 ms 27860 KB Output is correct
37 Correct 20 ms 28628 KB Output is correct
38 Correct 22 ms 28440 KB Output is correct
39 Correct 18 ms 28244 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23812 KB Output is correct
3 Correct 12 ms 23728 KB Output is correct
4 Correct 12 ms 23816 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23812 KB Output is correct
7 Correct 14 ms 23892 KB Output is correct
8 Correct 13 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23764 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 16 ms 23716 KB Output is correct
13 Correct 14 ms 23800 KB Output is correct
14 Correct 26 ms 23744 KB Output is correct
15 Correct 12 ms 23860 KB Output is correct
16 Correct 12 ms 23764 KB Output is correct
17 Correct 13 ms 23856 KB Output is correct
18 Correct 13 ms 23852 KB Output is correct
19 Correct 13 ms 23816 KB Output is correct
20 Correct 12 ms 23860 KB Output is correct
21 Correct 12 ms 23804 KB Output is correct
22 Correct 14 ms 24032 KB Output is correct
23 Correct 12 ms 23892 KB Output is correct
24 Correct 12 ms 23752 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 11 ms 23812 KB Output is correct
28 Correct 11 ms 23764 KB Output is correct
29 Correct 11 ms 23764 KB Output is correct
30 Correct 287 ms 151800 KB Output is correct
31 Correct 279 ms 151812 KB Output is correct
32 Correct 269 ms 151720 KB Output is correct
33 Correct 272 ms 151840 KB Output is correct
34 Correct 263 ms 151664 KB Output is correct
35 Correct 24 ms 28980 KB Output is correct
36 Correct 13 ms 23816 KB Output is correct
37 Correct 13 ms 23764 KB Output is correct
38 Correct 407 ms 151968 KB Output is correct
39 Correct 23 ms 28980 KB Output is correct
40 Correct 22 ms 28472 KB Output is correct
41 Correct 26 ms 28484 KB Output is correct
42 Correct 23 ms 29024 KB Output is correct
43 Correct 22 ms 28852 KB Output is correct
44 Correct 194 ms 37164 KB Output is correct
45 Correct 22 ms 29028 KB Output is correct
46 Correct 23 ms 28944 KB Output is correct
47 Correct 24 ms 28760 KB Output is correct
48 Correct 153 ms 37440 KB Output is correct
49 Correct 24 ms 27860 KB Output is correct
50 Correct 20 ms 28628 KB Output is correct
51 Correct 22 ms 28440 KB Output is correct
52 Correct 18 ms 28244 KB Output is correct
53 Correct 184 ms 140816 KB Output is correct
54 Correct 256 ms 138692 KB Output is correct
55 Correct 331 ms 150044 KB Output is correct
56 Correct 305 ms 150108 KB Output is correct
57 Correct 272 ms 151764 KB Output is correct
58 Correct 282 ms 153700 KB Output is correct
59 Correct 258 ms 151820 KB Output is correct
60 Correct 380 ms 147812 KB Output is correct
61 Correct 133 ms 126128 KB Output is correct
62 Correct 311 ms 143852 KB Output is correct
63 Correct 247 ms 139668 KB Output is correct
64 Correct 173 ms 134780 KB Output is correct