Submission #783906

# Submission time Handle Problem Language Result Execution time Memory
783906 2023-07-15T12:06:53 Z VMaksimoski008 Poi (IOI09_poi) C++14
100 / 100
196 ms 23848 KB
#include <bits/stdc++.h>
using namespace std;

struct Contestant {
    int solved;
    int points;
    int id;

    bool operator<(Contestant &c) {
        if(points == c.points && solved == c.solved)
            return (id > c.id);
        if(points == c.points)
            return (solved < c.solved);
        return (points < c.points);
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, t, p;
    cin >> n >> t >> p;

    vector<int> taskPoints(t, n);
    vector<vector<int> > results(n+1, vector<int>(t, 0));

    for(int i=1; i<=n; i++) {
        for(int j=0; j<t; j++) {
            cin >> results[i][j];
            taskPoints[j] -= results[i][j];
        }
    }
    
    vector<Contestant> rank;
    for(int i=1; i<=n; i++) {
        rank.push_back(Contestant{0, 0, i});
        for(int j=0; j<t; j++) {
            if(results[i][j]) {
                rank.back().solved++;
                rank.back().points += taskPoints[j];
            }
        }
    }

    sort(rank.begin(), rank.end());
    reverse(rank.begin(), rank.end());

    for(int i=0; i<n; i++) {
        if(rank[i].id == p) {
            cout << rank[i].points << " " << i+1 << '\n';
        }
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 320 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 324 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 500 KB Output is correct
11 Correct 10 ms 980 KB Output is correct
12 Correct 16 ms 1492 KB Output is correct
13 Correct 28 ms 3812 KB Output is correct
14 Correct 41 ms 5312 KB Output is correct
15 Correct 85 ms 9152 KB Output is correct
16 Correct 80 ms 9896 KB Output is correct
17 Correct 123 ms 14464 KB Output is correct
18 Correct 138 ms 16360 KB Output is correct
19 Correct 177 ms 21516 KB Output is correct
20 Correct 196 ms 23848 KB Output is correct