Submission #788394

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
788394	2023-07-20T07:56:30 Z	canadavid1	Poi (IOI09_poi)	C++14	100 / 100	205 ms	8752 KB

poi

#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x),end(x)




signed main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    int N,T,P;
    cin >> N >> T >> P;
    vector<vector<bool>> s(N,vector<bool>(T,false));
    for(auto && i : s) for(int j = 0; j < T; j++) {int a; cin >> a; i[j] = a;}
    vector<int> solveNum(T,0);
    for(auto && i : s) for(int j = 0; j < T; j++) if(!i[j]) solveNum[j]++; 
    vector<tuple<int,int,int>> scores(N,{0,0,0});
    for(int i = 0; i < N; i++)
    {
        for(int j = 0; j < T; j++) if (s[i][j]) {get<0>(scores[i])-=solveNum[j];get<1>(scores[i])--;}
        get<2>(scores[i]) = i+1; // person id
    }
    sort(all(scores));
    // find P
    int i;
    for(i = 0; get<2>(scores[i])!=P;i++);
    cout << -get<0>(scores[i]) << " " << i+1 << "\n";

}

Subtask #1

100.0 / 100.0

#	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	0 ms	316 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	324 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	2 ms	396 KB	Output is correct
11	Correct	7 ms	588 KB	Output is correct
12	Correct	13 ms	724 KB	Output is correct
13	Correct	31 ms	1568 KB	Output is correct
14	Correct	44 ms	2124 KB	Output is correct
15	Correct	81 ms	3484 KB	Output is correct
16	Correct	84 ms	3772 KB	Output is correct
17	Correct	125 ms	5368 KB	Output is correct
18	Correct	144 ms	5968 KB	Output is correct
19	Correct	188 ms	7932 KB	Output is correct
20	Correct	205 ms	8752 KB	Output is correct