| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 522264 |
2022-02-04T11:12:44 Z |
new_acc |
Poi (IOI09_poi) |
C++14 |
|
247 ms |
36192 KB |
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(a, b) for(int a = 0; a < (int)(b); a++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=5e5+10;
pair<int,int>t[N];
int ile[N];
vi xd[N];
void solve(){
int n,m,p;
cin>>n>>m>>p;
p--;
rep(i,n){
rep(j,m){
int a;
cin>>a;
ile[j]+=!a;
xd[i].push_back(a);
}
}
rep(i,n){
rep(j,m) if(xd[i][j]==1) t[i].fi+=ile[j];
t[i].se=i;
}
sort(t,t+n);
rep(i,n)
if(t[i].se==p) cout<<t[i].fi<<" "<<i+1<<"\n";
}
int main(){
ios_base::sync_with_stdio(0),cin.tie(0);
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
11980 KB |
Output isn't correct |
| 2 |
Incorrect |
6 ms |
11980 KB |
Output isn't correct |
| 3 |
Incorrect |
6 ms |
11980 KB |
Output isn't correct |
| 4 |
Incorrect |
6 ms |
11952 KB |
Output isn't correct |
| 5 |
Incorrect |
6 ms |
11980 KB |
Output isn't correct |
| 6 |
Incorrect |
7 ms |
12072 KB |
Output isn't correct |
| 7 |
Correct |
7 ms |
12108 KB |
Output is correct |
| 8 |
Incorrect |
6 ms |
12072 KB |
Output isn't correct |
| 9 |
Incorrect |
7 ms |
12212 KB |
Output isn't correct |
| 10 |
Incorrect |
9 ms |
12236 KB |
Output isn't correct |
| 11 |
Incorrect |
13 ms |
12844 KB |
Output isn't correct |
| 12 |
Incorrect |
19 ms |
13380 KB |
Output isn't correct |
| 13 |
Incorrect |
42 ms |
15988 KB |
Output isn't correct |
| 14 |
Incorrect |
57 ms |
17732 KB |
Output isn't correct |
| 15 |
Incorrect |
91 ms |
24564 KB |
Output isn't correct |
| 16 |
Incorrect |
99 ms |
25644 KB |
Output isn't correct |
| 17 |
Incorrect |
158 ms |
28816 KB |
Output isn't correct |
| 18 |
Incorrect |
162 ms |
31040 KB |
Output isn't correct |
| 19 |
Incorrect |
246 ms |
35136 KB |
Output isn't correct |
| 20 |
Incorrect |
247 ms |
36192 KB |
Output isn't correct |
