Submission #480173

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
480173	2021-10-15T03:53:17 Z	gg123_pe	Poi (IOI09_poi)	C++14	100 / 100	687 ms	15972 KB

poi

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

#define f(i,a,b) for(int i = a; i < b; i++)
int n, t, p, grade[2005], a[2005][2005]; 
vector <pair<int,pair<int,int>>> v; 

int main(){
    cin >> n >> t >> p; 
    f(i,1,n+1) f(j,1,t+1) cin >> a[i][j]; 

    f(i,1,t+1){
        f(j,1,n+1) grade[i] += (a[j][i] == 0); 
    }

    f(i,1,n+1){
        int score = 0, c = 0; 
        f(j,1,t+1) score += a[i][j]*grade[j], c += a[i][j]; 
        v.push_back({-score, {-c, i}}); 
    }

    sort(v.begin(), v.end()); 

    f(i,0,n){
        if(v[i].second.second == p){
            cout << abs(v[i].first) << " " << i+1 << endl; 
            return 0; 
        }
    }
    return 0; 
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	588 KB	Output is correct
8	Correct	2 ms	588 KB	Output is correct
9	Correct	3 ms	716 KB	Output is correct
10	Correct	7 ms	1164 KB	Output is correct
11	Correct	22 ms	1884 KB	Output is correct
12	Correct	45 ms	3132 KB	Output is correct
13	Correct	100 ms	5316 KB	Output is correct
14	Correct	151 ms	7616 KB	Output is correct
15	Correct	263 ms	9652 KB	Output is correct
16	Correct	273 ms	10444 KB	Output is correct
17	Correct	454 ms	12012 KB	Output is correct
18	Correct	497 ms	13752 KB	Output is correct
19	Correct	631 ms	15972 KB	Output is correct
20	Correct	687 ms	15936 KB	Output is correct