oj.uz

Submission #799566

# Submission time Handle Problem Language Result Execution time Memory
799566 2023-07-31T16:01:54 Z eltu0815 Misspelling (JOI22_misspelling) C++14
100 / 100
 566 ms 284960 KB 
#include <bits/stdc++.h>
#define MAX 500005
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
 
using namespace std;    
typedef long long ll;
typedef pair<ll, ll> pll;
 
ll n, m, k, tt;
pair<pll, ll> inp[MAX];
ll dp[MAX][30], sum[MAX][30];

inline void update(ll i, ll j) {
    sum[i][j] = (sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + dp[i][j] + 2 * MOD) % MOD;
    assert(sum[i][j] >= 0);
}

inline ll query(ll i1, ll j1, ll i2, ll j2) {
    return (sum[i2][j2] - sum[i2][j1 - 1] - sum[i1 - 1][j2] + sum[i1 - 1][j1 - 1] + 2 * MOD) % MOD;
}

struct Node {
    ll v;
    Node() { v = 0; }
};

Node Merge(Node l, Node r) {
    Node ret;
    ret.v = max(l.v, r.v);
    return ret;
}

struct SEG {
    Node seg[MAX << 2];
    void update(ll s, ll e, ll i, ll v, ll n) {
        if(s == e) { seg[n].v = max(seg[n].v, v); return; }
        
        ll m = (s + e) >> 1;
        if(i <= m) update(s, m, i, v, n << 1);
        else update(m + 1, e, i, v, n << 1 | 1);    
        seg[n] = Merge(seg[n << 1], seg[n << 1 | 1]); 
    }
    
    Node query(ll s, ll e, ll l, ll r, ll n) {
        if(s > r || e < l) return Node();
        if(l <= s && e <= r) return seg[n];
        
        ll m = (s + e) >> 1;
        return Merge(query(s, m, l, r, n << 1), query(m + 1, e, l, r, n << 1 | 1));
    }
};

SEG seg1, seg2;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> n >> m;
    for(ll i = 1; i <= m; ++i) {
        cin >> inp[i].first.first >> inp[i].first.second;
        inp[i].second = inp[i].first.first < inp[i].first.second;
        if(inp[i].first.first > inp[i].first.second) swap(inp[i].first.first, inp[i].first.second);
    }
    sort(inp + 1, inp + m + 1);
    for(ll i = 1; i <= 26; ++i) dp[1][i] = 1, update(1, i);
    for(ll i = 2, p = 1; i <= n; ++i) {
        while(p <= m && inp[p].first.first < i) {
            (inp[p].second ? seg1 : seg2).update(1, n, inp[p].first.second, inp[p].first.first, 1);
            ++p;
        }
        ll prv1 = seg1.query(1, n, i, n, 1).v + 1, prv2 = seg2.query(1, n, i, n, 1).v + 1;
        for(ll c = 1; c <= 26; ++c) {
            if(i > prv1 && c > 1) dp[i][c] += query(prv1, 1, i - 1, c - 1);
            if(i > prv2 && c < 26) dp[i][c] += query(prv2, c + 1, i - 1, 26);
            dp[i][c] %= MOD;
            update(i, c);
        }
    }
    
    ll ans = 0;
    for(ll i = 1; i <= n; ++i) for(ll j = 1; j <= 26; ++j) ans = (ans + dp[i][j]) % MOD;
    cout << ans;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31628 KB Output is correct
2 Correct 12 ms 31600 KB Output is correct
3 Correct 13 ms 31572 KB Output is correct
4 Correct 11 ms 31640 KB Output is correct
5 Correct 11 ms 31640 KB Output is correct
6 Correct 10 ms 31616 KB Output is correct
7 Correct 11 ms 31584 KB Output is correct
8 Correct 10 ms 31572 KB Output is correct
9 Correct 11 ms 31572 KB Output is correct
10 Correct 12 ms 31576 KB Output is correct
11 Correct 12 ms 31640 KB Output is correct
12 Correct 13 ms 31572 KB Output is correct
13 Correct 12 ms 31644 KB Output is correct
14 Correct 12 ms 31572 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31628 KB Output is correct
2 Correct 12 ms 31600 KB Output is correct
3 Correct 13 ms 31572 KB Output is correct
4 Correct 11 ms 31640 KB Output is correct
5 Correct 11 ms 31640 KB Output is correct
6 Correct 10 ms 31616 KB Output is correct
7 Correct 11 ms 31584 KB Output is correct
8 Correct 10 ms 31572 KB Output is correct
9 Correct 11 ms 31572 KB Output is correct
10 Correct 12 ms 31576 KB Output is correct
11 Correct 12 ms 31640 KB Output is correct
12 Correct 13 ms 31572 KB Output is correct
13 Correct 12 ms 31644 KB Output is correct
14 Correct 12 ms 31572 KB Output is correct
15 Correct 12 ms 31640 KB Output is correct
16 Correct 11 ms 31660 KB Output is correct
17 Correct 10 ms 31628 KB Output is correct
18 Correct 10 ms 31628 KB Output is correct
19 Correct 11 ms 31756 KB Output is correct
20 Correct 11 ms 31716 KB Output is correct
21 Correct 11 ms 31700 KB Output is correct
22 Correct 13 ms 32036 KB Output is correct
23 Correct 13 ms 31640 KB Output is correct
24 Correct 11 ms 31700 KB Output is correct
25 Correct 11 ms 31700 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31572 KB Output is correct
2 Correct 10 ms 31640 KB Output is correct
3 Correct 11 ms 31540 KB Output is correct
4 Correct 10 ms 31580 KB Output is correct
5 Correct 493 ms 284816 KB Output is correct
6 Correct 524 ms 284824 KB Output is correct
7 Correct 529 ms 284752 KB Output is correct
8 Correct 511 ms 284764 KB Output is correct
9 Correct 481 ms 284828 KB Output is correct
10 Correct 30 ms 41684 KB Output is correct
11 Correct 14 ms 31700 KB Output is correct
12 Correct 13 ms 31572 KB Output is correct
13 Correct 566 ms 284788 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31628 KB Output is correct
2 Correct 12 ms 31600 KB Output is correct
3 Correct 13 ms 31572 KB Output is correct
4 Correct 11 ms 31640 KB Output is correct
5 Correct 11 ms 31640 KB Output is correct
6 Correct 10 ms 31616 KB Output is correct
7 Correct 11 ms 31584 KB Output is correct
8 Correct 10 ms 31572 KB Output is correct
9 Correct 11 ms 31572 KB Output is correct
10 Correct 12 ms 31576 KB Output is correct
11 Correct 12 ms 31640 KB Output is correct
12 Correct 13 ms 31572 KB Output is correct
13 Correct 12 ms 31644 KB Output is correct
14 Correct 12 ms 31572 KB Output is correct
15 Correct 12 ms 31640 KB Output is correct
16 Correct 11 ms 31660 KB Output is correct
17 Correct 10 ms 31628 KB Output is correct
18 Correct 10 ms 31628 KB Output is correct
19 Correct 11 ms 31756 KB Output is correct
20 Correct 11 ms 31716 KB Output is correct
21 Correct 11 ms 31700 KB Output is correct
22 Correct 13 ms 32036 KB Output is correct
23 Correct 13 ms 31640 KB Output is correct
24 Correct 11 ms 31700 KB Output is correct
25 Correct 11 ms 31700 KB Output is correct
26 Correct 30 ms 41684 KB Output is correct
27 Correct 28 ms 41372 KB Output is correct
28 Correct 28 ms 41300 KB Output is correct
29 Correct 33 ms 41672 KB Output is correct
30 Correct 32 ms 41676 KB Output is correct
31 Correct 167 ms 58012 KB Output is correct
32 Correct 30 ms 41684 KB Output is correct
33 Correct 34 ms 41736 KB Output is correct
34 Correct 32 ms 41636 KB Output is correct
35 Correct 175 ms 58076 KB Output is correct
36 Correct 26 ms 41044 KB Output is correct
37 Correct 31 ms 41456 KB Output is correct
38 Correct 30 ms 41372 KB Output is correct
39 Correct 28 ms 41208 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31628 KB Output is correct
2 Correct 12 ms 31600 KB Output is correct
3 Correct 13 ms 31572 KB Output is correct
4 Correct 11 ms 31640 KB Output is correct
5 Correct 11 ms 31640 KB Output is correct
6 Correct 10 ms 31616 KB Output is correct
7 Correct 11 ms 31584 KB Output is correct
8 Correct 10 ms 31572 KB Output is correct
9 Correct 11 ms 31572 KB Output is correct
10 Correct 12 ms 31576 KB Output is correct
11 Correct 12 ms 31640 KB Output is correct
12 Correct 13 ms 31572 KB Output is correct
13 Correct 12 ms 31644 KB Output is correct
14 Correct 12 ms 31572 KB Output is correct
15 Correct 12 ms 31640 KB Output is correct
16 Correct 11 ms 31660 KB Output is correct
17 Correct 10 ms 31628 KB Output is correct
18 Correct 10 ms 31628 KB Output is correct
19 Correct 11 ms 31756 KB Output is correct
20 Correct 11 ms 31716 KB Output is correct
21 Correct 11 ms 31700 KB Output is correct
22 Correct 13 ms 32036 KB Output is correct
23 Correct 13 ms 31640 KB Output is correct
24 Correct 11 ms 31700 KB Output is correct
25 Correct 11 ms 31700 KB Output is correct
26 Correct 10 ms 31572 KB Output is correct
27 Correct 10 ms 31640 KB Output is correct
28 Correct 11 ms 31540 KB Output is correct
29 Correct 10 ms 31580 KB Output is correct
30 Correct 493 ms 284816 KB Output is correct
31 Correct 524 ms 284824 KB Output is correct
32 Correct 529 ms 284752 KB Output is correct
33 Correct 511 ms 284764 KB Output is correct
34 Correct 481 ms 284828 KB Output is correct
35 Correct 30 ms 41684 KB Output is correct
36 Correct 14 ms 31700 KB Output is correct
37 Correct 13 ms 31572 KB Output is correct
38 Correct 566 ms 284788 KB Output is correct
39 Correct 30 ms 41684 KB Output is correct
40 Correct 28 ms 41372 KB Output is correct
41 Correct 28 ms 41300 KB Output is correct
42 Correct 33 ms 41672 KB Output is correct
43 Correct 32 ms 41676 KB Output is correct
44 Correct 167 ms 58012 KB Output is correct
45 Correct 30 ms 41684 KB Output is correct
46 Correct 34 ms 41736 KB Output is correct
47 Correct 32 ms 41636 KB Output is correct
48 Correct 175 ms 58076 KB Output is correct
49 Correct 26 ms 41044 KB Output is correct
50 Correct 31 ms 41456 KB Output is correct
51 Correct 30 ms 41372 KB Output is correct
52 Correct 28 ms 41208 KB Output is correct
53 Correct 457 ms 275692 KB Output is correct
54 Correct 430 ms 275592 KB Output is correct
55 Correct 520 ms 284960 KB Output is correct
56 Correct 538 ms 284880 KB Output is correct
57 Correct 481 ms 284748 KB Output is correct
58 Correct 476 ms 284880 KB Output is correct
59 Correct 474 ms 284756 KB Output is correct
60 Correct 565 ms 284792 KB Output is correct
61 Correct 350 ms 266416 KB Output is correct
62 Correct 514 ms 280140 KB Output is correct
63 Correct 455 ms 275648 KB Output is correct
64 Correct 397 ms 271056 KB Output is correct