QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #783749 | #9788. Shreckless | asxziill | WA | 16ms | 3832kb | C++23 | 1.3kb | 2024-11-26 11:38:46 | 2024-11-26 11:38:48 |
Judging History
answer
#include <bits/stdc++.h>
using ll = long long;
void solve() {
int n, m;
std::cin >> n >> m;
std::vector<int> a(n * m);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
std::cin >> a[i * m + j];
}
}
std::vector<int> b(n);
std::vector<int> bad(n, -1);
for (int j = 0; j < m; j++) {
for (int i = 0; i < n; i++) {
b[i] = a[i * m + j];
}
std::sort(b.begin(), b.end(), std::greater());
// std::cout << (j + 1) << "::\n";
// for (int x : bad) {
// std::cout << x << " ";
// }
// std::cout << "\n";
// for (int x : b) {
// std::cout << x << " ";
// }
// std::cout << "\n";
std::vector<int> tmp;
int p = 0;
for (int i = 0; i < n; i++) {
if (bad[p] > b[i]) {
p++;
if (p == bad.size()) break;
} else {
tmp.push_back(b[i]);
}
}
std::vector<int> nxt;
for (int i = p; i < bad.size(); i++) {
nxt.push_back(tmp[i - p]);
}
bad = std::move(nxt);
if (bad.empty()) {
std::cout << "YES\n";
return;
}
}
std::cout << "NO\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t;
std::cin >> t;
while (t--) {
solve();
}
// solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3832kb
input:
3 2 2 69 69 2024 42 3 3 1 1 1 1 1 1 2 2 2 3 4 1 1 1 1 1 1 1 1 2 2 2 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: 3540kb
input:
3 2 2 69 69 2024 42 3 3 1 1 1 1 1 1 2 2 2 3 4 1 1 1 1 1 1 1 1 2 2 2 2
output:
YES NO YES
result:
ok 3 token(s): yes count is 2, no count is 1
Test #3:
score: -100
Wrong Answer
time: 16ms
memory: 3760kb
input:
20000 6 2 12 4 8 24 2 10 1 22 3 15 18 20 3 3 3 8 18 2 17 15 13 4 6 3 3 7 17 15 8 6 3 18 13 9 3 3 2 3 14 1 7 17 4 6 13 3 3 6 10 14 3 9 13 1 7 15 2 4 1 3 16 14 6 10 4 2 3 3 3 2 17 7 11 13 16 5 18 2 3 2 3 6 4 1 5 2 4 4 6 13 14 2 11 12 16 3 3 2 8 12 4 9 17 5 7 18 3 2 5 10 8 9 1 6 2 2 2 4 1 3 2 3 12 6 1 ...
output:
NO NO YES NO NO YES YES YES NO NO NO NO YES YES YES YES NO NO YES NO NO NO YES NO YES YES YES YES YES NO NO YES NO YES NO NO YES NO YES YES NO NO YES NO YES NO NO YES YES YES NO NO NO YES YES YES NO NO NO YES NO NO YES NO NO NO YES YES YES YES NO NO YES NO NO NO NO NO YES YES YES NO NO YES YES NO NO...
result:
wrong answer expected YES, found NO [2nd token]