답안 #936547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
936547	2024-03-02T07:21:14 Z	TAhmed33	Misspelling (JOI22_misspelling)	C++	28 / 100	2684 ms	604 KB

misspelling

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int add (int a, int b) {
	a += b; if (a >= MOD) a -= MOD;
	return a;
}
int sub (int a, int b) {
	a -= b; if (a < 0) a += MOD;
	return a;
}
int mul (int a, int b) {
	return (a * 1ll * b) % MOD;
}
int dp[300][27];
int n, m;
vector <pair <int, int>> dd[300];
int ans (int pos, int c) {
	int &ret = dp[pos][c];
	if (ret != -1) return ret;
	if (pos == 1) return ret = 1;
	ret = 0;
	for (int j = 0; j < c; j++) {
		bool flag = 1;
		for (int i = pos - 1; i >= 1; i--) {
			for (auto k : dd[i - 1]) {
				if (k.second) {
					flag &= (pos - 1 >= k.first);
				}
			}	
			if (flag) ret = add(ret, ans(i, j));
		}
	}
	for (int j = c + 1; j < 26; j++) {
		bool flag = 1;
		for (int i = pos - 1; i >= 1; i--) {
			for (auto k : dd[i - 1]) {
				if (!k.second) {
					flag &= (pos - 1 >= k.first);
				}
			}	
			if (flag) ret = add(ret, ans(i, j));
		}
	}
	return ret;
}
int main () {
	memset(dp, -1, sizeof(dp));
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int a, b;
		cin >> a >> b;
		int l = min(a, b), r = max(a, b);
		if (a > b) {
			dd[l - 1].push_back({r, 0});
		} else {
			dd[l - 1].push_back({r, 1});
		}
	}
	int sum = 0;
	for (int i = 0; i < 26; i++) {
		for (int j = 1; j <= n; j++) {
			sum = add(sum, ans(j, i));
		}
	}
	cout << sum << '\n';
}

Subtask #1

8.0 / 8.0

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

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	32 ms	348 KB	Output is correct
16	Correct	30 ms	480 KB	Output is correct
17	Correct	35 ms	348 KB	Output is correct
18	Correct	34 ms	464 KB	Output is correct
19	Correct	26 ms	348 KB	Output is correct
20	Correct	29 ms	348 KB	Output is correct
21	Correct	40 ms	344 KB	Output is correct
22	Correct	2684 ms	600 KB	Output is correct
23	Correct	43 ms	348 KB	Output is correct
24	Correct	30 ms	348 KB	Output is correct
25	Correct	25 ms	348 KB	Output is correct

Subtask #3

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Runtime error	1 ms	604 KB	Execution killed with signal 11
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	32 ms	348 KB	Output is correct
16	Correct	30 ms	480 KB	Output is correct
17	Correct	35 ms	348 KB	Output is correct
18	Correct	34 ms	464 KB	Output is correct
19	Correct	26 ms	348 KB	Output is correct
20	Correct	29 ms	348 KB	Output is correct
21	Correct	40 ms	344 KB	Output is correct
22	Correct	2684 ms	600 KB	Output is correct
23	Correct	43 ms	348 KB	Output is correct
24	Correct	30 ms	348 KB	Output is correct
25	Correct	25 ms	348 KB	Output is correct
26	Runtime error	1 ms	604 KB	Execution killed with signal 11
27	Halted	0 ms	0 KB	-

Subtask #5

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	32 ms	348 KB	Output is correct
16	Correct	30 ms	480 KB	Output is correct
17	Correct	35 ms	348 KB	Output is correct
18	Correct	34 ms	464 KB	Output is correct
19	Correct	26 ms	348 KB	Output is correct
20	Correct	29 ms	348 KB	Output is correct
21	Correct	40 ms	344 KB	Output is correct
22	Correct	2684 ms	600 KB	Output is correct
23	Correct	43 ms	348 KB	Output is correct
24	Correct	30 ms	348 KB	Output is correct
25	Correct	25 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	352 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Runtime error	1 ms	604 KB	Execution killed with signal 11
31	Halted	0 ms	0 KB	-