# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
659774 | 2022-11-19T09:13:21 Z | ivopav | Poi (IOI09_poi) | C++14 | 668 ms | 8724 KB |
#include <bits/stdc++.h> using namespace std; int main(){ int n; int t; int p; cin >> n >> t >> p; vector<vector<bool>> mat={}; vector<int> lis=vector<int>(t,0); for (int i=0;i<n;i++){ mat.push_back({}); for (int j=0;j<t;j++){ bool unos; cin >> unos; mat[i].push_back(unos); lis[j]+=(int)(!unos); } } // cout << "-----------------\n"; vector<pair<int,pair<int,int>>> lis2={}; for (int i=0;i<n;i++){ lis2.push_back({0,{0,i}}); for (int j=0;j<t;j++){ lis2[i].first-=lis[j]*(int)(mat[i][j]); lis2[i].second.first-=(int)(mat[i][j]); } } sort(lis2.begin(),lis2.end()); for (int i=0;i<lis2.size();i++){ // cout << lis2[i].first << " " << lis2[i].second.first << " " << lis2[i].second.second << "\n"; if (lis2[i].second.second==p-1){ cout << -lis2[i].first << " " << i+1 << "\n"; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 300 KB | Output is correct |
6 | Correct | 1 ms | 300 KB | Output is correct |
7 | Correct | 2 ms | 304 KB | Output is correct |
8 | Correct | 2 ms | 304 KB | Output is correct |
9 | Correct | 3 ms | 332 KB | Output is correct |
10 | Correct | 6 ms | 312 KB | Output is correct |
11 | Correct | 25 ms | 552 KB | Output is correct |
12 | Correct | 37 ms | 676 KB | Output is correct |
13 | Correct | 99 ms | 1556 KB | Output is correct |
14 | Correct | 139 ms | 2096 KB | Output is correct |
15 | Correct | 261 ms | 3596 KB | Output is correct |
16 | Correct | 268 ms | 3836 KB | Output is correct |
17 | Correct | 425 ms | 5404 KB | Output is correct |
18 | Correct | 462 ms | 6152 KB | Output is correct |
19 | Correct | 630 ms | 7976 KB | Output is correct |
20 | Correct | 668 ms | 8724 KB | Output is correct |