QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #809957 | #9873. Last Chance: Threads of Despair | YUKII | WA | 1ms | 3820kb | C++14 | 2.0kb | 2024-12-11 18:35:18 | 2024-12-11 18:35:27 |
Judging History
answer
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = unsigned long long;
int main() {
char const* yes = "Yes", * no = "No";
int n, size1, size2, temp;
cin >> n;
while (n--) {
cin >> size1 >> size2;
vector<int> vec1, vec2;
for (int i = 0; i < size1; ++i) {
cin >> temp;
vec1.push_back(temp);
}
for (int i = 0; i < size2; ++i) {
cin >> temp;
vec2.push_back(temp);
}
sort(vec1.begin(), vec1.end());
sort(vec2.begin(), vec2.end());
int hurt = size1 + 1;
int deadline = 0;
int idx1 = 0, idx2 = 0;
while (idx1 < size1 && vec1[idx1] == 1) {
--hurt, ++deadline, ++idx1;
}
while (idx1 < size1 && vec1[idx1] <= deadline) {
++idx1, ++deadline;
}
while (idx2 < size2 && vec2[idx2] <= deadline) {
++idx2, ++deadline;
}
if (idx2 == size2) {
cout << yes << endl;
continue;;
}
if (idx1) {
--vec2[idx2];
}
int curIdx1 = idx1;
while (hurt) {
while (idx1 < size1 && vec1[idx1] <= deadline) {
++idx1, ++curIdx1, ++deadline;
}
while (idx2 < size2 && vec2[idx2] <= deadline) {
++idx2, ++deadline;
}
if (idx2 < size2 && idx1 < size1 && curIdx1 < size1) {
--vec1[curIdx1], --vec2[idx2], ++curIdx1;
}
--hurt;
}
while (idx1 < size1 && vec1[idx1] <= deadline) {
++idx1, ++curIdx1, ++deadline;
}
while (idx2 < size2 && vec2[idx2] <= deadline) {
++idx2, ++deadline;
}
if (idx2 == size2) {
cout << yes << endl;
} else {
cout << no << endl;
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
input:
3 3 2 1 1 4 2 6 3 2 1 1 4 2 7 2 1 100 100 2
output:
Yes No Yes
result:
ok 3 token(s): yes count is 2, no count is 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
3 7 1 1 1 1 1 1 1 1 9 5 2 3 4 5 6 7 1 6 5 3 3 4 5 6 7 1 5 7
output:
No No Yes
result:
ok 3 token(s): yes count is 1, no count is 2
Test #3:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
4 1 1 1 1 1 1 1 2 1 1 2 1 1 1 2 2
output:
Yes Yes Yes No
result:
ok 4 token(s): yes count is 3, no count is 1
Test #4:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
18 1 2 1 1 1 1 2 1 2 1 1 2 1 1 3 1 2 1 2 2 1 2 1 3 2 1 2 1 3 3 1 2 2 1 1 1 2 2 1 2 1 2 2 1 3 1 2 2 2 2 1 2 2 2 3 1 2 2 3 3 1 2 3 1 1 1 2 3 1 2 1 2 3 1 3 1 2 3 2 2 1 2 3 3 2 1 2 3 3 3
output:
Yes Yes Yes Yes No No Yes Yes No No No No Yes No No No No No
result:
ok 18 token(s): yes count is 7, no count is 11
Test #5:
score: 0
Accepted
time: 0ms
memory: 3772kb
input:
18 2 1 1 1 1 2 1 1 1 2 2 1 1 1 3 2 1 1 2 1 2 1 2 1 2 2 1 2 1 3 2 1 1 3 1 2 1 1 3 2 2 1 3 1 3 2 1 2 2 1 2 1 2 2 2 2 1 2 2 3 2 1 2 3 1 2 1 3 2 2 2 1 2 3 3 2 1 3 3 1 2 1 3 3 2 2 1 3 3 3
output:
Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes No Yes Yes No
result:
ok 18 token(s): yes count is 15, no count is 3
Test #6:
score: -100
Wrong Answer
time: 1ms
memory: 3600kb
input:
525 2 3 1 1 1 1 1 2 3 1 1 1 2 1 2 3 1 1 1 3 1 2 3 1 1 1 4 1 2 3 1 1 5 1 1 2 3 1 1 2 2 1 2 3 1 1 3 1 2 2 3 1 1 1 2 4 2 3 1 1 2 1 5 2 3 1 1 3 3 1 2 3 1 1 4 3 1 2 3 1 1 3 5 1 2 3 1 1 4 4 1 2 3 1 1 4 5 1 2 3 1 1 1 5 5 2 3 1 1 2 2 2 2 3 1 1 2 3 2 2 3 1 1 2 2 4 2 3 1 1 2 5 2 2 3 1 1 3 2 3 2 3 1 1 3 2 4 2 ...
output:
Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes Yes No No Yes Yes No No No No No No No No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes No No Yes Yes Yes Yes Yes Yes No Yes No No Yes Yes No No No No No No No No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Ye...
result:
wrong answer expected YES, found NO [47th token]