Submission #239445

# Submission time Handle Problem Language Result Execution time Memory
239445 2020-06-15T15:30:47 Z Autoratch Poi (IOI09_poi) C++14
100 / 100
311 ms 16120 KB
#include <bits/stdc++.h>
using namespace std;

const int N = 2001;

int n,t,p;
int a[N][N],no[N],sc[N],ta[N];
vector<pair<int,pair<int,int> > > res;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> t >> p;
    for(int i = 1;i <= n;i++) for(int j = 1;j <= t;j++) cin >> a[i][j];
    for(int i = 1;i <= n;i++) for(int j = 1;j <= t;j++) if(!a[i][j]) no[j]++;
    for(int i = 1;i <= n;i++) for(int j = 1;j <= t;j++) if(a[i][j]) sc[i]+=no[j],ta[i]++;
    for(int i = 1;i <= n;i++) res.push_back({-sc[i],{-ta[i],i}});
    sort(res.begin(),res.end());
    int id = 1;
    for(auto it : res)
    {
        if(it.second.second==p){ cout << -it.first << ' ' << id; return 0; }
        id++;
    }
}
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 416 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 7 ms 1280 KB Output is correct
11 Correct 15 ms 2048 KB Output is correct
12 Correct 21 ms 3200 KB Output is correct
13 Correct 50 ms 5624 KB Output is correct
14 Correct 71 ms 7672 KB Output is correct
15 Correct 120 ms 9964 KB Output is correct
16 Correct 131 ms 10536 KB Output is correct
17 Correct 190 ms 12252 KB Output is correct
18 Correct 213 ms 13816 KB Output is correct
19 Correct 279 ms 16120 KB Output is correct
20 Correct 311 ms 16120 KB Output is correct