# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717726 | 2023-04-02T11:37:40 Z | AndrijaM | Poi (IOI09_poi) | C++14 | 598 ms | 16740 KB |
#include <bits/stdc++.h> using namespace std; int main() { int n,t,p; cin>>n>>t>>p; int cpt[t]={0}; vector<int>v[n]; int val[n]; memset(val,0,sizeof val); vector<pair<int,int>>r; for(int i=0;i<n;i++) { for(int j=0;j<t;j++) { int num; cin>>num; v[i].push_back(num); cpt[j]+=num;///lugje-cpt[j] treba } } for(int i=0;i<n;i++) { for(int j=0;j<t;j++) { if(v[i][j]==1) val[i]+=n-cpt[j]; } r.push_back({val[i],i+1}); } sort(r.begin(),r.end()); for(int i=0;i<r.size();i++) { if(r[i].second==p) { cout<<r[i].first<<" "<<i+1<<endl; return 0; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Incorrect | 0 ms | 304 KB | Output isn't correct |
3 | Incorrect | 1 ms | 212 KB | Output isn't correct |
4 | Incorrect | 1 ms | 212 KB | Output isn't correct |
5 | Incorrect | 1 ms | 212 KB | Output isn't correct |
6 | Incorrect | 1 ms | 296 KB | Output isn't correct |
7 | Correct | 2 ms | 308 KB | Output is correct |
8 | Incorrect | 2 ms | 340 KB | Output isn't correct |
9 | Incorrect | 3 ms | 340 KB | Output isn't correct |
10 | Incorrect | 6 ms | 468 KB | Output isn't correct |
11 | Incorrect | 19 ms | 968 KB | Output isn't correct |
12 | Incorrect | 32 ms | 1376 KB | Output isn't correct |
13 | Incorrect | 93 ms | 3380 KB | Output isn't correct |
14 | Incorrect | 130 ms | 4644 KB | Output isn't correct |
15 | Incorrect | 253 ms | 10348 KB | Output isn't correct |
16 | Incorrect | 241 ms | 11100 KB | Output isn't correct |
17 | Incorrect | 360 ms | 12776 KB | Output isn't correct |
18 | Incorrect | 420 ms | 14480 KB | Output isn't correct |
19 | Incorrect | 514 ms | 16740 KB | Output isn't correct |
20 | Incorrect | 598 ms | 16672 KB | Output isn't correct |