oj.uz

답안 #609664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609664 2022-07-27T19:00:13 Z arayi Misspelling (JOI22_misspelling) C++17
100 / 100
 950 ms 769564 KB 
// Arayi
#include <bits/stdc++.h>
#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int>
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2;
}
mt19937 rnd(363542);
char vow[] = {'a', 'e', 'i', 'o', 'u'};
int dx[] = {0, -1, 0, 1, -1, -1, 1, 1, 0};
int dy[] = {-1, 0, 1, 0, -1, 1, -1, 1, 0};
char dc[] = {'R', 'D', 'L', 'U'};

const int N = 5e5 + 20;
const lli mod = 1e9 + 7;
const ld pi = acos(-1);
const ld e = 1e-13;
const int T = 128;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1)
            ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream &operator<<(ostream &c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
template <class T>
void maxi(T &a, T b)
{
    a = max(a, b);
}
template <class T>
void mini(T &a, T b)
{
    a = min(a, b);
}

int n, m;
lli dp[N][30][3], pr[N][30][3], p[N][30][3];
int l[N], r[N];
vii fp[N], fp1[N];
bool col[N];
priority_queue<pair<int, int>> q, q1;
void f(int i1)
{
    for (auto p : fp[i1])
    {
        if (p > 0)
            q.push(MP(i1, p));
        else
            col[-p] = 1;
    }
    for (auto p : fp1[i1])
    {
        if (p > 0)
            q1.push(MP(i1, p));
        else
            col[-p] = 1;
    }
    while (!q.empty() && col[q.top().sc])
        q.pop();
    while (!q1.empty() && col[q1.top().sc])
        q1.pop();
}
int main()
{
    fastio;
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> l[i] >> r[i];
        l[i]--, r[i]--;
        if (l[i] < r[i])
        {
            fp[l[i]].ad(i);
            fp[r[i]].ad(-i);
        }
        else
        {
            fp1[r[i]].ad(i);
            fp1[l[i]].ad(-i);
        }
    }
    for (int i = 0; i < 26; i++)
    {
        dp[0][i][1] = 1;
        pr[0][i][1] = i + 1;
    }
    f(0);
    for (int i = 1; i < n; i++)
    {
        for (int j = 0; j < 26; j++)
        {
            dp[i][j][1] = dp[i - 1][j][0] + dp[i - 1][j][1] + dp[i - 1][j][2];
            dp[i][j][1] %= mod;
        }
        int i1;
        if (!q1.empty())
            i1 = q1.top().fr;
        else
            i1 = -1;
        for (int j = 0; j < 26; j++)
        {
            if (i1 == -1)
                dp[i][j][0] += 25 - j;
            lli sm = pr[i - 1][25][0] - pr[i - 1][j][0] + mod + mod;
            if (i1 != -1)
                sm -= pr[i1][25][0] - pr[i1][j][0];
            dp[i][j][0] += sm;
            sm = pr[i - 1][25][2] - pr[i - 1][j][2] + mod + mod;
            if (i1 != -1)
                sm -= pr[i1][25][2] - pr[i1][j][2];
            dp[i][j][0] += sm;
            dp[i][j][0] %= mod;
        }
        if (!q.empty())
            i1 = q.top().fr;
        else
            i1 = -1;
        for (int j = 1; j < 26; j++)
        {

            //cout << i1 << endl;
            if (i1 == -1)
                dp[i][j][2] += j;
            lli sm = pr[i - 1][j - 1][0] + mod;
            if (i1 != -1)
                sm -= pr[i1][j - 1][0];
            dp[i][j][2] += sm;
            sm = pr[i - 1][j - 1][2] + mod;
            if (i1 != -1)
                sm -= pr[i1][j - 1][2];
            dp[i][j][2] += sm;
            dp[i][j][2] %= mod;
        }
        for (int j = 0; j < 26; j++)
        {
            for (auto k : {0, 1, 2})
            {
                pr[i][j][k] = dp[i][j][k] + pr[i - 1][j][k] + mod + mod;
                if (j)
                    pr[i][j][k] += pr[i][j - 1][k] - pr[i - 1][j - 1][k];
                pr[i][j][k] %= mod;
            }
        }
        f(i);
    }
    lli sum = 0;

    for (int i = 0; i < 26; i++)
        for (auto k : {0, 1, 2})
            sum += dp[n - 1][i][k], sum %= mod;
    cout << sum << endl;
    return 0;
}

/*
    __
  *(><)*
    \/ /
    ||/
  --||
    ||
    /\
   /  \
  /    \

*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 13 ms 23764 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 14 ms 23752 KB Output is correct
7 Correct 12 ms 23760 KB Output is correct
8 Correct 12 ms 23768 KB Output is correct
9 Correct 12 ms 23892 KB Output is correct
10 Correct 12 ms 23824 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 12 ms 23828 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 11 ms 23832 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 13 ms 23764 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 14 ms 23752 KB Output is correct
7 Correct 12 ms 23760 KB Output is correct
8 Correct 12 ms 23768 KB Output is correct
9 Correct 12 ms 23892 KB Output is correct
10 Correct 12 ms 23824 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 12 ms 23828 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 11 ms 23832 KB Output is correct
15 Correct 14 ms 24084 KB Output is correct
16 Correct 13 ms 24052 KB Output is correct
17 Correct 12 ms 24148 KB Output is correct
18 Correct 14 ms 24148 KB Output is correct
19 Correct 13 ms 24084 KB Output is correct
20 Correct 12 ms 24020 KB Output is correct
21 Correct 13 ms 24148 KB Output is correct
22 Correct 15 ms 24532 KB Output is correct
23 Correct 12 ms 24020 KB Output is correct
24 Correct 12 ms 24080 KB Output is correct
25 Correct 12 ms 24148 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 13 ms 23828 KB Output is correct
3 Correct 15 ms 23796 KB Output is correct
4 Correct 14 ms 23824 KB Output is correct
5 Correct 661 ms 758492 KB Output is correct
6 Correct 665 ms 758572 KB Output is correct
7 Correct 732 ms 758372 KB Output is correct
8 Correct 659 ms 758664 KB Output is correct
9 Correct 654 ms 758276 KB Output is correct
10 Correct 38 ms 53260 KB Output is correct
11 Correct 13 ms 24012 KB Output is correct
12 Correct 13 ms 23792 KB Output is correct
13 Correct 950 ms 769564 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 13 ms 23764 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 14 ms 23752 KB Output is correct
7 Correct 12 ms 23760 KB Output is correct
8 Correct 12 ms 23768 KB Output is correct
9 Correct 12 ms 23892 KB Output is correct
10 Correct 12 ms 23824 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 12 ms 23828 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 11 ms 23832 KB Output is correct
15 Correct 14 ms 24084 KB Output is correct
16 Correct 13 ms 24052 KB Output is correct
17 Correct 12 ms 24148 KB Output is correct
18 Correct 14 ms 24148 KB Output is correct
19 Correct 13 ms 24084 KB Output is correct
20 Correct 12 ms 24020 KB Output is correct
21 Correct 13 ms 24148 KB Output is correct
22 Correct 15 ms 24532 KB Output is correct
23 Correct 12 ms 24020 KB Output is correct
24 Correct 12 ms 24080 KB Output is correct
25 Correct 12 ms 24148 KB Output is correct
26 Correct 40 ms 53324 KB Output is correct
27 Correct 36 ms 52760 KB Output is correct
28 Correct 36 ms 52780 KB Output is correct
29 Correct 42 ms 53604 KB Output is correct
30 Correct 43 ms 53452 KB Output is correct
31 Correct 225 ms 72240 KB Output is correct
32 Correct 38 ms 53080 KB Output is correct
33 Correct 38 ms 53196 KB Output is correct
34 Correct 42 ms 53456 KB Output is correct
35 Correct 246 ms 72588 KB Output is correct
36 Correct 32 ms 51924 KB Output is correct
37 Correct 39 ms 53144 KB Output is correct
38 Correct 38 ms 52792 KB Output is correct
39 Correct 43 ms 52428 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 13 ms 23764 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 14 ms 23752 KB Output is correct
7 Correct 12 ms 23760 KB Output is correct
8 Correct 12 ms 23768 KB Output is correct
9 Correct 12 ms 23892 KB Output is correct
10 Correct 12 ms 23824 KB Output is correct
11 Correct 13 ms 23764 KB Output is correct
12 Correct 12 ms 23828 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 11 ms 23832 KB Output is correct
15 Correct 14 ms 24084 KB Output is correct
16 Correct 13 ms 24052 KB Output is correct
17 Correct 12 ms 24148 KB Output is correct
18 Correct 14 ms 24148 KB Output is correct
19 Correct 13 ms 24084 KB Output is correct
20 Correct 12 ms 24020 KB Output is correct
21 Correct 13 ms 24148 KB Output is correct
22 Correct 15 ms 24532 KB Output is correct
23 Correct 12 ms 24020 KB Output is correct
24 Correct 12 ms 24080 KB Output is correct
25 Correct 12 ms 24148 KB Output is correct
26 Correct 13 ms 23764 KB Output is correct
27 Correct 13 ms 23828 KB Output is correct
28 Correct 15 ms 23796 KB Output is correct
29 Correct 14 ms 23824 KB Output is correct
30 Correct 661 ms 758492 KB Output is correct
31 Correct 665 ms 758572 KB Output is correct
32 Correct 732 ms 758372 KB Output is correct
33 Correct 659 ms 758664 KB Output is correct
34 Correct 654 ms 758276 KB Output is correct
35 Correct 38 ms 53260 KB Output is correct
36 Correct 13 ms 24012 KB Output is correct
37 Correct 13 ms 23792 KB Output is correct
38 Correct 950 ms 769564 KB Output is correct
39 Correct 40 ms 53324 KB Output is correct
40 Correct 36 ms 52760 KB Output is correct
41 Correct 36 ms 52780 KB Output is correct
42 Correct 42 ms 53604 KB Output is correct
43 Correct 43 ms 53452 KB Output is correct
44 Correct 225 ms 72240 KB Output is correct
45 Correct 38 ms 53080 KB Output is correct
46 Correct 38 ms 53196 KB Output is correct
47 Correct 42 ms 53456 KB Output is correct
48 Correct 246 ms 72588 KB Output is correct
49 Correct 32 ms 51924 KB Output is correct
50 Correct 39 ms 53144 KB Output is correct
51 Correct 38 ms 52792 KB Output is correct
52 Correct 43 ms 52428 KB Output is correct
53 Correct 654 ms 746588 KB Output is correct
54 Correct 616 ms 746404 KB Output is correct
55 Correct 822 ms 763776 KB Output is correct
56 Correct 856 ms 763564 KB Output is correct
57 Correct 715 ms 758288 KB Output is correct
58 Correct 653 ms 757260 KB Output is correct
59 Correct 653 ms 758472 KB Output is correct
60 Correct 939 ms 763280 KB Output is correct
61 Correct 519 ms 728424 KB Output is correct
62 Correct 816 ms 756260 KB Output is correct
63 Correct 719 ms 748300 KB Output is correct
64 Correct 586 ms 739076 KB Output is correct