답안 #938808

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
938808	2024-03-05T15:07:02 Z	alextodoran	Misspelling (JOI22_misspelling)	C++17	100 / 100	1949 ms	79296 KB

misspelling

/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 500000;
const int M_MAX = 500000;
const int MOD = (int) 1e9 + 7;

int N, M;
struct Restrict {
    int l, r;
    bool type;
};
bool operator < (const Restrict &a, const Restrict &b) {
    return a.r > b.r;
}
Restrict R[M_MAX + 2];
int dp[N_MAX + 2][26];

int maxL[N_MAX + 2][2];

void add (int &x, const int &y) {
    x += y;
    if (x >= MOD) {
        x -= MOD;
    }
}
void sub (int &x, const int &y) {
    x -= y;
    if (x < 0) {
        x += MOD;
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M;
    for (int i = 1; i <= M; i++) {
        cin >> R[i].l >> R[i].r;
        if (R[i].l > R[i].r) {
            swap(R[i].l, R[i].r);
            R[i].type = 1;
        } else {
            R[i].type = 0;
        }
    }
    set <int> s[2];
    sort(R + 1, R + M + 1);
    for (int i = N - 1, j = 1; i >= 1; i--) {
        while (j <= M && R[j].r > i) {
            s[R[j].type].insert(R[j].l);
            j++;
        }
        for (bool t : {0, 1}) {
            while (s[t].empty() == false && *s[t].rbegin() > i) {
                s[t].erase(prev(s[t].end()));
            }
            if (s[t].empty() == false) {
                maxL[i][t] = max(maxL[i][t], *s[t].rbegin());
            }
        }
    }
    for (int c = 0; c < 26; c++) {
        dp[0][c] = 1;
    }
    for (int i = 1; i <= N - 1; i++) {
        for (int c = 0; c < 26; c++) {
            for (int cj = 0; cj < 26; cj++) {
                if (c != cj) {
                    add(dp[i][c], dp[i - 1][cj]);
                }
            }
            if (maxL[i][0] > 0) {
                for (int cj = 0; cj < c; cj++) {
                    sub(dp[i][c], dp[maxL[i][0] - 1][cj]);
                }
            }
            if (maxL[i][1] > 0) {
                for (int cj = 25; cj > c; cj--) {
                    sub(dp[i][c], dp[maxL[i][1] - 1][cj]);
                }
            }
            add(dp[i][c], dp[i - 1][c]);
        }
    }
    int answer = 0;
    for (int c = 0; c < 26; c++) {
        add(answer, dp[N - 1][c]);
    }
    cout << answer << "\n";

    return 0;
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4568 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4440 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4560 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4568 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4440 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4560 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	2 ms	4568 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	2 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	1 ms	4444 KB	Output is correct
22	Correct	3 ms	4444 KB	Output is correct
23	Correct	1 ms	4440 KB	Output is correct
24	Correct	1 ms	4444 KB	Output is correct
25	Correct	1 ms	4444 KB	Output is correct

Subtask #3
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4560 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1257 ms	67880 KB	Output is correct
6	Correct	1346 ms	67724 KB	Output is correct
7	Correct	1076 ms	67796 KB	Output is correct
8	Correct	1370 ms	67768 KB	Output is correct
9	Correct	1158 ms	67716 KB	Output is correct
10	Correct	104 ms	6484 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4700 KB	Output is correct
13	Correct	928 ms	79296 KB	Output is correct

Subtask #4
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4568 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4440 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4560 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	2 ms	4568 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	2 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	1 ms	4444 KB	Output is correct
22	Correct	3 ms	4444 KB	Output is correct
23	Correct	1 ms	4440 KB	Output is correct
24	Correct	1 ms	4444 KB	Output is correct
25	Correct	1 ms	4444 KB	Output is correct
26	Correct	103 ms	6484 KB	Output is correct
27	Correct	75 ms	6916 KB	Output is correct
28	Correct	75 ms	6476 KB	Output is correct
29	Correct	47 ms	6600 KB	Output is correct
30	Correct	33 ms	6732 KB	Output is correct
31	Correct	144 ms	16976 KB	Output is correct
32	Correct	45 ms	6464 KB	Output is correct
33	Correct	44 ms	6368 KB	Output is correct
34	Correct	33 ms	6908 KB	Output is correct
35	Correct	166 ms	18108 KB	Output is correct
36	Correct	29 ms	6112 KB	Output is correct
37	Correct	31 ms	6712 KB	Output is correct
38	Correct	39 ms	6492 KB	Output is correct
39	Correct	29 ms	6484 KB	Output is correct

Subtask #5
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4568 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4440 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4560 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	2 ms	4568 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	2 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	1 ms	4444 KB	Output is correct
22	Correct	3 ms	4444 KB	Output is correct
23	Correct	1 ms	4440 KB	Output is correct
24	Correct	1 ms	4444 KB	Output is correct
25	Correct	1 ms	4444 KB	Output is correct
26	Correct	1 ms	4444 KB	Output is correct
27	Correct	1 ms	4560 KB	Output is correct
28	Correct	1 ms	4444 KB	Output is correct
29	Correct	1 ms	4444 KB	Output is correct
30	Correct	1257 ms	67880 KB	Output is correct
31	Correct	1346 ms	67724 KB	Output is correct
32	Correct	1076 ms	67796 KB	Output is correct
33	Correct	1370 ms	67768 KB	Output is correct
34	Correct	1158 ms	67716 KB	Output is correct
35	Correct	104 ms	6484 KB	Output is correct
36	Correct	1 ms	4444 KB	Output is correct
37	Correct	1 ms	4700 KB	Output is correct
38	Correct	928 ms	79296 KB	Output is correct
39	Correct	103 ms	6484 KB	Output is correct
40	Correct	75 ms	6916 KB	Output is correct
41	Correct	75 ms	6476 KB	Output is correct
42	Correct	47 ms	6600 KB	Output is correct
43	Correct	33 ms	6732 KB	Output is correct
44	Correct	144 ms	16976 KB	Output is correct
45	Correct	45 ms	6464 KB	Output is correct
46	Correct	44 ms	6368 KB	Output is correct
47	Correct	33 ms	6908 KB	Output is correct
48	Correct	166 ms	18108 KB	Output is correct
49	Correct	29 ms	6112 KB	Output is correct
50	Correct	31 ms	6712 KB	Output is correct
51	Correct	39 ms	6492 KB	Output is correct
52	Correct	29 ms	6484 KB	Output is correct
53	Correct	983 ms	67572 KB	Output is correct
54	Correct	1949 ms	68076 KB	Output is correct
55	Correct	921 ms	72748 KB	Output is correct
56	Correct	866 ms	72664 KB	Output is correct
57	Correct	1201 ms	67820 KB	Output is correct
58	Correct	1312 ms	67824 KB	Output is correct
59	Correct	991 ms	67668 KB	Output is correct
60	Correct	896 ms	77060 KB	Output is correct
61	Correct	854 ms	54848 KB	Output is correct
62	Correct	842 ms	72728 KB	Output is correct
63	Correct	990 ms	68520 KB	Output is correct
64	Correct	895 ms	62544 KB	Output is correct

답안 #938808

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 20.0 / 20.0

Subtask #3 29.0 / 29.0

Subtask #4 32.0 / 32.0

Subtask #5 11.0 / 11.0

Subtask #1
8.0 / 8.0

Subtask #2
20.0 / 20.0

Subtask #3
29.0 / 29.0

Subtask #4
32.0 / 32.0

Subtask #5
11.0 / 11.0