QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #866979 | #9736. Kind of Bingo | sqrteipi | WA | 11ms | 3968kb | C++20 | 622b | 2025-01-22 22:56:07 | 2025-01-22 22:56:07 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int n,m,k,f,lim;
int main() {
int t;
cin >> t;
int mf[100000];
for (int j=0; j<t; j++){
cin >> n >> m >> k;
lim=m-k;
for (int i=0; i<=n; i++){
mf[i]=0;
}
int arr[n*m];
for (int i=0; i<n*m; i++){
cin >> arr[i];
arr[i]--;
}
if (n==1){
cout << m << endl;
}else if (lim<=0){
cout << m << endl;
}else{
for (int i=0; i<n*m; i++){
int f = arr[i];
mf[f/m]++;
if (mf[f/m]==lim){
cout << i+1 << endl;
i=n*m;
}
}
}
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3968kb
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: 11ms
memory: 3968kb
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 2002nd numbers differ - expected: '4', found: '1'