Submission #598468

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
598468	2022-07-18T11:40:11 Z	Trisanu_Das	Poi (IOI09_poi)	C++17	100 / 100	233 ms	16084 KB

poi

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, t, p; cin >> n >> t >> p;
    vector<int> solves(t + 1,0);
    vector<vector<int> > v(n + 1,vector(t + 1,int(0)));
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= t;j++) {
            cin >> v[i][j]; solves[j]+=v[i][j];
        }
    }
    vector<array<int,3>> stats(n);
    vector<int> cnt(n + 1,0);
    vector<int> sum(n + 1,0);
    for(int i = 1;i <= n;i++) {
        for(int j = 1;j <= t;j++) {
            cnt[i] += v[i][j];
            sum[i] += v[i][j]*(n-solves[j]);
        }
        stats[i-1] = {-sum[i],-cnt[i],i};
    }
    sort(stats.begin(), stats.end());
    for(int i = 0;i < n;i++) if(stats[i][2] == p) cout << -stats[i][0] << ' ' << i + 1 << '\n';
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 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	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	7 ms	724 KB	Output is correct
12	Correct	13 ms	1108 KB	Output is correct
13	Correct	33 ms	2692 KB	Output is correct
14	Correct	48 ms	3704 KB	Output is correct
15	Correct	88 ms	6244 KB	Output is correct
16	Correct	100 ms	6740 KB	Output is correct
17	Correct	146 ms	9796 KB	Output is correct
18	Correct	233 ms	11032 KB	Output is correct
19	Correct	190 ms	14492 KB	Output is correct
20	Correct	207 ms	16084 KB	Output is correct