Submission #239444

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
239444	2020-06-15T15:25:55 Z	Autoratch	Poi (IOI09_poi)	C++14	70 / 100	289 ms	16248 KB

poi

#include <bits/stdc++.h>
using namespace std;

const int N = 2001;

int n,t,p,lv;
int a[N][N],no[N],sc[N];
vector<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];
    for(int i = 1;i <= n;i++) res.push_back({-sc[i],i});
    sort(res.begin(),res.end());
    int id = 1;
    for(auto it : res)
    {
        if(it.second==p){ cout << -it.first << ' ' << id; return 0; }
        id++;
    }
}

Subtask #1

70.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Incorrect	4 ms	384 KB	Output isn't correct
4	Incorrect	5 ms	384 KB	Output isn't correct
5	Correct	5 ms	512 KB	Output is correct
6	Correct	5 ms	512 KB	Output is correct
7	Incorrect	5 ms	640 KB	Output isn't correct
8	Incorrect	5 ms	640 KB	Output isn't correct
9	Correct	6 ms	896 KB	Output is correct
10	Correct	7 ms	1280 KB	Output is correct
11	Correct	13 ms	2048 KB	Output is correct
12	Correct	21 ms	3200 KB	Output is correct
13	Incorrect	48 ms	5504 KB	Output isn't correct
14	Correct	69 ms	7672 KB	Output is correct
15	Incorrect	120 ms	9848 KB	Output isn't correct
16	Correct	127 ms	10616 KB	Output is correct
17	Correct	173 ms	12152 KB	Output is correct
18	Correct	203 ms	13692 KB	Output is correct
19	Correct	265 ms	16248 KB	Output is correct
20	Correct	289 ms	16120 KB	Output is correct