| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1088448 |
2024-09-14T12:11:47 Z |
vjudge1 |
Izbori (COCI17_izbori) |
C++17 |
|
1 ms |
452 KB |
#include <bits/stdc++.h>
using namespace std;
#define fastinput cin.tie(nullptr)->sync_with_stdio(false);
#define endl '\n'
#define ll long long
const ll mOd=1e9+7;
const int mAx=INT_MAX;
const int nUm=1e3+3;
int main()
{
fastinput;
int n,m,k; cin>>n>>m>>k;
vector<pair<int,int>>p(m);
for(int i=0 ; i<m ; i++)p[i].first=0,p[i].second=i+1;
for(int i=0 ; i<n ; i++){
for(int j=0 ; j<m ; j++){
int x; cin>>x; x--;
p[x].first+=j;
}
}
sort(p.begin(),p.end());
cout<<p[0].second<<endl;
for(int i=0 ; i<m ; i++){
if(p[i].second==k)
{
cout<<i<<endl;
break;
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Partially correct |
0 ms |
348 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
348 KB |
Partially correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Incorrect |
0 ms |
452 KB |
Output isn't correct |
| 9 |
Partially correct |
0 ms |
348 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 13 |
Partially correct |
1 ms |
348 KB |
Partially correct |
| 14 |
Partially correct |
0 ms |
348 KB |
Partially correct |
| 15 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 16 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 17 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 18 |
Partially correct |
0 ms |
348 KB |
Partially correct |
| 19 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 20 |
Partially correct |
1 ms |
348 KB |
Partially correct |
