QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #771176 | #9736. Kind of Bingo | shinonomezhou# | WA | 5ms | 3576kb | C++23 | 557b | 2024-11-22 10:26:48 | 2024-11-22 10:26:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5e5+2e2;
int main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int tt;
cin>>tt;
while(tt--){
ll n,m,k;
cin>>n>>m>>k;
vector<vector<ll>>ve(n+10);
for(int i=1;i<=n*m;i++){
ll x;
cin>>x;
ve[(x-1)/m].push_back(i);
}
if(k>=m){
cout<<m<<'\n';
continue;
}
ll mn=1e12;
k=min(k,m);
for(int i=0;i<n;i++){
sort(ve[i].begin(),ve[i].end());
mn=min(mn,ve[i][m-1-k]);
}
cout<<mn<<'\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3556kb
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: 5ms
memory: 3576kb
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:
2 6 1 5 10 1 3 3 6 6 1 2 1 3 5 3 1 3 3 3 6 4 9 10 3 6 2 1 3 1 2 5 6 1 3 1 3 9 1 1 4 2 8 4 3 1 5 6 1 4 7 1 6 5 2 2 7 1 2 6 8 7 1 2 6 2 2 1 2 4 4 3 1 2 1 1 2 1 4 7 2 3 1 1 2 3 3 2 4 1 8 2 4 1 2 4 1 4 4 6 9 6 4 4 2 3 6 2 2 6 6 10 7 6 1 3 2 3 8 3 4 4 5 6 2 7 5 5 5 3 3 2 6 4 7 4 7 8 8 1 1 2 5 2 3 10 4 2 ...
result:
wrong answer 1st numbers differ - expected: '9', found: '2'