Submission #851657

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
851657	2023-09-20T10:40:19 Z	abcvuitunggio	Poi (IOI09_poi)	C++17	100 / 100	201 ms	4236 KB

poi

#include <bits/stdc++.h>
using namespace std;
int n,t,p,cnt[2001];
bool a[2001][2001];
pair <pair <int, int>, int> s[2001];
int main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> n >> t >> p;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=t;j++){
            cin >> a[i][j];
            cnt[j]+=1-a[i][j];
        }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=t;j++){
            s[i].first.first-=a[i][j]*cnt[j];
            s[i].first.second-=a[i][j];
        }
        s[i].second=i;
    }
    sort(s+1,s+n+1);
    for (int i=1;i<=n;i++)
        if (s[i].second==p)
            cout << -s[i].first.first << ' ' << i;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	1 ms	2652 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	2 ms	2648 KB	Output is correct
11	Correct	7 ms	2648 KB	Output is correct
12	Correct	11 ms	2904 KB	Output is correct
13	Correct	30 ms	2648 KB	Output is correct
14	Correct	43 ms	2680 KB	Output is correct
15	Correct	75 ms	2648 KB	Output is correct
16	Correct	82 ms	2896 KB	Output is correct
17	Correct	126 ms	3172 KB	Output is correct
18	Correct	138 ms	3688 KB	Output is correct
19	Correct	201 ms	4176 KB	Output is correct
20	Correct	199 ms	4236 KB	Output is correct