QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #380380 | #8566. Can We Still Qualify For Semifinals? | ucup-team1766# | WA | 1ms | 3596kb | C++23 | 737b | 2024-04-07 02:31:37 | 2024-04-07 02:31:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void run() {
int k; cin >> k;
string s; cin >> s;
vector<int> wins(10);
vector<int> teams(10); iota(teams.begin(),teams.end(),0);
for (int _ = 0; _ < 9; _++) {
for (int i = 0; i < 5; i++) {
int x = teams[i];
int y = teams[9-i];
if (_*5+i < k) {
if (s[_*5+i] == '1') wins[x]++;
else wins[y]++;
} else {
if (not x or not y) wins[0]++;
else if (wins[x] < wins[y]) wins[x]++;
else wins[y]++;
}
}
rotate(teams.begin()+1,teams.begin()+2,teams.end());
}
int ans = wins[0];
sort(wins.rbegin(),wins.rend());
cout << (ans >= wins[3] ? "YES" : "NO") << '\n';
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int t; cin >> t; while (t--) run();
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3564kb
input:
3 3 111 25 1000010101111111111010100 35 01111011110111101111011110111101111
output:
YES YES NO
result:
ok 3 token(s): yes count is 2, no count is 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
10 16 0110000001010100 17 01111000110110101 15 001100010101111 16 0010101010011100 19 0000000100010110100 16 0011101010011100 18 011110010001100000 18 000110101001100011 20 01100010000100100100 15 001000111001101
output:
YES YES YES YES YES YES YES YES YES YES
result:
ok 10 token(s): yes count is 10, no count is 0
Test #3:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
10 37 0110000001010100011101001011100110001 39 000100111101101001100101101000000000100 35 00111000100111100101011010111100100 33 010000010001110010110001101110001 30 000100010100000010010110101010 31 0000101000011010101001010000000 44 00001000000111101011010110000101100011000100 42 01111011110001001...
output:
NO NO NO NO NO NO NO NO NO NO
result:
ok 10 token(s): yes count is 0, no count is 10
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3508kb
input:
10 23 01100000010101000111010 38 01111001100011000101011110101001101001 27 010000000001001001110001001 26 01101001110011101101000110 8 00001000 22 0110100110001110110001 9 000100010 24 000000100101101010100100 6 011000 29 01101010100101000000000000100
output:
NO NO NO NO YES NO YES NO YES NO
result:
wrong answer expected YES, found NO [1st token]