QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #33238 | #1861. Nondeterministic Finite Automaton | Y25t | AC ✓ | 2ms | 3764kb | C++20 | 550b | 2022-05-30 18:28:34 | 2022-05-30 18:28:36 |
Judging History
answer
#include<bits/stdc++.h>
int main(){
int n;
scanf("%d",&n);
puts(n==6?
R"(9
1 5
0 2
2 1
0 3
3 2
0 4
4 3
0 5
5 4
11
0 2
2 2
2 3
2 4
2 5
0 3
3 3
0 4
4 4
0 5
5 5
6
0 1 2 3 4 5
)":
R"(23
0 1
0 5
0 8
0 13
1 2
2 3
3 4
4 1
5 6
6 7
7 5
8 9
9 10
10 11
11 12
12 8
13 14
14 15
15 16
16 17
17 18
18 19
19 13
23
0 1
0 5
0 8
0 13
1 2
2 3
3 4
4 1
5 6
6 7
7 5
8 9
9 10
10 11
11 12
12 8
13 14
14 15
15 16
16 17
17 18
18 19
19 13
16
0 1 2 3 5 6 8 9 10 11 13 14 15 16 17 18
)");
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3764kb
input:
6
output:
9 1 5 0 2 2 1 0 3 3 2 0 4 4 3 0 5 5 4 11 0 2 2 2 2 3 2 4 2 5 0 3 3 3 0 4 4 4 0 5 5 5 6 0 1 2 3 4 5
result:
ok n = 6
Test #2:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
20
output:
23 0 1 0 5 0 8 0 13 1 2 2 3 3 4 4 1 5 6 6 7 7 5 8 9 9 10 10 11 11 12 12 8 13 14 14 15 15 16 16 17 17 18 18 19 19 13 23 0 1 0 5 0 8 0 13 1 2 2 3 3 4 4 1 5 6 6 7 7 5 8 9 9 10 10 11 11 12 12 8 13 14 14 15 15 16 16 17 17 18 18 19 19 13 16 0 1 2 3 5 6 8 9 10 11 13 14 15 16 17 18
result:
ok n = 20