QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #171875 | #7178. Bishops | ucup-team1876# | WA | 22ms | 5168kb | C++20 | 1.3kb | 2023-09-09 17:43:29 | 2023-09-09 17:43:29 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
input:
2 5
output:
6 1 1 1 3 1 5 2 1 2 3 2 5
result:
ok n: 2, m: 5, bishops: 6
Test #2:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
5 5
output:
8 1 1 3 1 5 1 3 5 2 1 4 1 2 5 4 5
result:
ok n: 5, m: 5, bishops: 8
Test #3:
score: 0
Accepted
time: 22ms
memory: 5168kb
input:
100000 100000
output:
199998 2 100000 4 100000 6 100000 8 100000 10 100000 12 100000 14 100000 16 100000 18 100000 20 100000 22 100000 24 100000 26 100000 28 100000 30 100000 32 100000 34 100000 36 100000 38 100000 40 100000 42 100000 44 100000 46 100000 48 100000 50 100000 52 100000 54 100000 56 100000 58 100000 60 1000...
result:
ok n: 100000, m: 100000, bishops: 199998
Test #4:
score: 0
Accepted
time: 19ms
memory: 4976kb
input:
100000 99999
output:
199998 100000 2 100000 4 100000 6 100000 8 100000 10 100000 12 100000 14 100000 16 100000 18 100000 20 100000 22 100000 24 100000 26 100000 28 100000 30 100000 32 100000 34 100000 36 100000 38 100000 40 100000 42 100000 44 100000 46 100000 48 100000 50 100000 52 100000 54 100000 56 100000 58 100000 ...
result:
ok n: 100000, m: 99999, bishops: 199998
Test #5:
score: 0
Accepted
time: 18ms
memory: 4852kb
input:
100000 50000
output:
149998 100000 2 100000 4 100000 6 100000 8 100000 10 100000 12 100000 14 100000 16 100000 18 100000 20 100000 22 100000 24 100000 26 100000 28 100000 30 100000 32 100000 34 100000 36 100000 38 100000 40 100000 42 100000 44 100000 46 100000 48 100000 50 100000 52 100000 54 100000 56 100000 58 100000 ...
result:
ok n: 100000, m: 50000, bishops: 149998
Test #6:
score: 0
Accepted
time: 11ms
memory: 4388kb
input:
1 100000
output:
100000 1 99999 1 99997 1 99995 1 99993 1 99991 1 99989 1 99987 1 99985 1 99983 1 99981 1 99979 1 99977 1 99975 1 99973 1 99971 1 99969 1 99967 1 99965 1 99963 1 99961 1 99959 1 99957 1 99955 1 99953 1 99951 1 99949 1 99947 1 99945 1 99943 1 99941 1 99939 1 99937 1 99935 1 99933 1 99931 1 99929 1 999...
result:
ok n: 1, m: 100000, bishops: 100000
Test #7:
score: -100
Wrong Answer
time: 15ms
memory: 4288kb
input:
34535 99889
output:
130706 1 1 3 1 5 1 7 1 9 1 11 1 13 1 15 1 17 1 19 1 21 1 23 1 25 1 27 1 29 1 31 1 33 1 35 1 37 1 39 1 41 1 43 1 45 1 47 1 49 1 51 1 53 1 55 1 57 1 59 1 61 1 63 1 65 1 67 1 69 1 71 1 73 1 75 1 77 1 79 1 81 1 83 1 85 1 87 1 89 1 91 1 93 1 95 1 97 1 99 1 101 1 103 1 105 1 107 1 109 1 111 1 113 1 115 1 ...
result:
wrong answer Participant's answer is not optimal (130706 < 134423)