QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #666636 | #7158. Carnival General | blackslex# | 23 | 22ms | 6080kb | C++14 | 434b | 2024-10-22 19:26:48 | 2024-10-22 19:27:36 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &n);
vector<vector<int>> c(n - 1);
for (int i = 0; i < n - 1; i++) {
c[i].resize(i + 1);
for (auto &e: c[i]) scanf("%d", &e);
}
vector<int> ans(n);
for (int i = 1; i < n; i += 2) ans[i] = i / 2;
for (int i = 0; i < n; i += 2) ans[i] += n / 2 + i / 2;
for (auto &e: ans) printf("%d ", e);
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 11
Accepted
time: 0ms
memory: 3868kb
input:
2 0
output:
1 0
result:
ok correct
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 3784kb
input:
99 0 1 0 2 1 0 3 2 1 0 4 3 2 1 0 5 4 3 2 1 0 6 5 4 3 2 1 0 7 6 5 4 3 2 1 0 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 10 9 8 7 6 5 4 3 2 1 0 11 10 9 8 7 6 5 4 3 2 1 0 12 11 10 9 8 7 6 5 4 3 2 1 0 13 12 11 10 9 8 7 6 5 4 3 2 1 0 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 16 1...
output:
49 0 50 1 51 2 52 3 53 4 54 5 55 6 56 7 57 8 58 9 59 10 60 11 61 12 62 13 63 14 64 15 65 16 66 17 67 18 68 19 69 20 70 21 71 22 72 23 73 24 74 25 75 26 76 27 77 28 78 29 79 30 80 31 81 32 82 33 83 34 84 35 85 36 86 37 87 38 88 39 89 40 90 41 91 42 92 43 93 44 94 45 95 46 96 47 97 48 98
result:
wrong answer Enemies 50 and 1 are next to each other
Subtask #2:
score: 23
Accepted
Test #6:
score: 23
Accepted
time: 0ms
memory: 4092kb
input:
2 0
output:
1 0
result:
ok correct
Test #7:
score: 23
Accepted
time: 0ms
memory: 3888kb
input:
99 0 0 1 0 1 2 0 1 2 3 0 1 2 3 4 0 1 2 3 4 5 0 1 2 3 4 5 6 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 8 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10 11 0 1 2 3 4 5 6 7 8 9 10 11 12 0 1 2 3 4 5 6 7 8 9 10 11 12 13 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 1 ...
output:
49 0 50 1 51 2 52 3 53 4 54 5 55 6 56 7 57 8 58 9 59 10 60 11 61 12 62 13 63 14 64 15 65 16 66 17 67 18 68 19 69 20 70 21 71 22 72 23 73 24 74 25 75 26 76 27 77 28 78 29 79 30 80 31 81 32 82 33 83 34 84 35 85 36 86 37 87 38 88 39 89 40 90 41 91 42 92 43 93 44 94 45 95 46 96 47 97 48 98
result:
ok correct
Test #8:
score: 23
Accepted
time: 22ms
memory: 5860kb
input:
1000 0 0 1 0 1 2 0 1 2 3 0 1 2 3 4 0 1 2 3 4 5 0 1 2 3 4 5 6 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 8 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10 11 0 1 2 3 4 5 6 7 8 9 10 11 12 0 1 2 3 4 5 6 7 8 9 10 11 12 13 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 ...
output:
500 0 501 1 502 2 503 3 504 4 505 5 506 6 507 7 508 8 509 9 510 10 511 11 512 12 513 13 514 14 515 15 516 16 517 17 518 18 519 19 520 20 521 21 522 22 523 23 524 24 525 25 526 26 527 27 528 28 529 29 530 30 531 31 532 32 533 33 534 34 535 35 536 36 537 37 538 38 539 39 540 40 541 41 542 42 543 43 54...
result:
ok correct
Test #9:
score: 23
Accepted
time: 22ms
memory: 6080kb
input:
999 0 0 1 0 1 2 0 1 2 3 0 1 2 3 4 0 1 2 3 4 5 0 1 2 3 4 5 6 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 8 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10 11 0 1 2 3 4 5 6 7 8 9 10 11 12 0 1 2 3 4 5 6 7 8 9 10 11 12 13 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 1...
output:
499 0 500 1 501 2 502 3 503 4 504 5 505 6 506 7 507 8 508 9 509 10 510 11 511 12 512 13 513 14 514 15 515 16 516 17 517 18 518 19 519 20 520 21 521 22 522 23 523 24 524 25 525 26 526 27 527 28 528 29 529 30 530 31 531 32 532 33 533 34 534 35 535 36 536 37 537 38 538 39 539 40 540 41 541 42 542 43 54...
result:
ok correct
Test #10:
score: 23
Accepted
time: 0ms
memory: 4096kb
input:
8 0 0 1 0 1 2 0 1 2 3 0 1 2 3 4 0 1 2 3 4 5 0 1 2 3 4 5 6
output:
4 0 5 1 6 2 7 3
result:
ok correct
Test #11:
score: 23
Accepted
time: 0ms
memory: 4116kb
input:
5 0 0 1 0 1 2 0 1 2 3
output:
2 0 3 1 4
result:
ok correct
Subtask #3:
score: 0
Wrong Answer
Test #12:
score: 29
Accepted
time: 0ms
memory: 3800kb
input:
2 0
output:
1 0
result:
ok correct
Test #13:
score: 0
Wrong Answer
time: 0ms
memory: 3800kb
input:
8 0 1 0 2 1 0 3 2 1 0 4 3 2 1 0 5 4 3 2 1 0 6 5 4 3 2 1 0
output:
4 0 5 1 6 2 7 3
result:
wrong answer Enemies 5 and 1 are next to each other
Subtask #4:
score: 0
Skipped
Dependency #1:
0%