QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#751949 | #9736. Kind of Bingo | Proaes# | WA | 2ms | 3852kb | C++20 | 1.3kb | 2024-11-15 21:23:04 | 2024-11-15 21:23:04 |
Judging History
answer
/**
* title: kk.cpp
* author: Proaes Meluam
* created: 2024-11-15 21:13:58
**/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
const double E = exp(1);
constexpr ll mod = 1e9 + 7;
// constexpr int inf = 0x3f3f3f3f;
constexpr ll inf = 0x3f3f3f3f3f3f3f3f;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int tt = 1;
cin >> tt;
while (tt--) {
int n, m, k;
cin >> n >> m >> k;
vector<vector<int>> p(n + 1, vector<int>(m + 1));
vector<int> cnt(n + 1);
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= m; ++ j) {
cin >> p[i][j];
}
}
int ans = m, cur = 1;
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= m; ++ j, ++ cur) {
int row = (p[i][j] - 1) / m + 1;
// debug(row);
cnt[row]++;
if (cnt[row] + k >= m) {
// debug("?");
ans = max(m, cur);
break;
}
}
}
cout << ans << "\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3852kb
input:
3 3 5 2 1 4 13 6 8 11 14 2 7 10 3 15 9 5 12 2 3 0 1 6 4 3 5 2 2 3 1000000000 1 2 3 4 5 6
output:
7 5 3
result:
ok 3 number(s): "7 5 3"
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3596kb
input:
10000 1 9 7 8 9 1 5 3 7 4 6 2 1 8 2 7 5 1 6 4 2 3 8 1 1 0 1 1 8 3 5 7 8 3 2 1 4 6 1 10 948645336 3 10 1 6 2 8 9 5 7 4 1 1 0 1 1 10 7 5 3 10 8 1 7 4 9 6 2 1 9 6 4 8 5 7 2 6 3 1 9 1 7 1 3 5 1 6 2 7 4 1 6 6 5 3 1 2 4 6 1 1 1 1 1 2 0 1 2 1 1 1 1 1 6 3 5 6 2 4 3 1 1 5 673454194 2 3 1 4 5 1 4 1 1 4 2 3 1 ...
output:
9 8 1 8 10 1 10 9 7 6 1 2 1 6 5 4 1 7 3 3 6 8 9 10 5 6 2 10 4 2 5 7 10 1 4 1 3 9 1 2 4 3 10 5 5 2 5 6 9 5 10 1 7 5 2 2 7 1 2 9 8 9 1 6 6 2 2 1 2 6 4 6 1 2 6 4 2 3 4 7 3 4 1 6 3 5 10 7 4 1 10 3 4 2 6 10 1 8 4 9 9 10 4 6 3 3 6 2 2 6 6 10 7 7 1 3 2 7 9 3 4 4 5 6 3 7 5 6 5 5 8 2 6 6 9 7 7 10 8 1 1 10 7 ...
result:
wrong answer 2029th numbers differ - expected: '2', found: '3'