Submission #536218

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
536218	2022-03-12T15:36:13 Z	timreizin	Poi (IOI09_poi)	C++17	100 / 100	258 ms	16040 KB

poi

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, t, p;
    cin >> n >> t >> p;
    vector<vector<int>> score(n, vector<int>(t));
    for (auto &i : score) for (int &j : i) cin >> j;
    vector<int> pts(t, n);
    for (int i = 0; i < t; ++i) for (int j = 0; j < n; ++j) pts[i] -= score[j][i];
    vector<tuple<int, int, int>> results(n);
    for (int i = 0; i < n; ++i)
    {
        int res = 0, cnt = 0;
        for (int j = 0; j < t; ++j)
        {
            res += pts[j] * score[i][j];
            cnt += score[i][j];
        }
        results[i] = {res, cnt, -(i + 1)};
    }
    sort(results.rbegin(), results.rend());
    int place = 1;
    for (auto [res, cnt, i] : results)
    {
        if (-i == p) cout << res << ' ' << place;
        ++place;
    }
    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	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 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	2 ms	340 KB	Output is correct
10	Correct	3 ms	340 KB	Output is correct
11	Correct	8 ms	724 KB	Output is correct
12	Correct	12 ms	1108 KB	Output is correct
13	Correct	33 ms	2644 KB	Output is correct
14	Correct	50 ms	3668 KB	Output is correct
15	Correct	85 ms	6232 KB	Output is correct
16	Correct	93 ms	6612 KB	Output is correct
17	Correct	146 ms	9756 KB	Output is correct
18	Correct	182 ms	11016 KB	Output is correct
19	Correct	228 ms	14476 KB	Output is correct
20	Correct	258 ms	16040 KB	Output is correct