Submission #906082

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
906082	2024-01-13T13:30:53 Z	JCC	Poi (IOI09_poi)	C++14	100 / 100	242 ms	24288 KB

poi

#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
using namespace std;

vector<int> points,one;


bool comp(int i, int j) {
    if (points[i] > points[j]) {
        return true;
    }
    else if (points[i] < points[j]) {
        return false;
    }
    else if (one[i] > one[j]) {
        return true;
    }
    else if (one[i] < one[j]) {
        return false;
    }

    return i < j;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n,t,p,x;

    cin >> n >> t >> p;
    vector<vector<int>> k(n);
    vector<int> player;
    for(int i = 0; i < n; i++) {
        player.push_back(i);
        for (int j = 0;j < t; j++) {
            cin >> x;
            k[i].push_back(x);
        }
    }
    vector<int> scores;
    for(int j = 0; j < t; j++) {
        int total = 0;
        for (int i = 0;i < n; i++) {
            if (k[i][j] == 0) total++;
        }
        scores.push_back(total);
    }

    for (int i=0;i<n;i++) {
        int point = 0;
        int done = 0;
        for (int j=0;j < t;j++) {
            if (k[i][j] == 1) {
                point+=scores[j];
                done++;
            }
        }
        points.push_back(point);
        one.push_back(done);
    }

    sort(player.begin(), player.end(), comp);

    for (int i=0;i < n; i++) {
        if (player[i] == p-1) {
            cout << points[p-1] << " " << i+1 << "\n";
        }
    }

    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	7 ms	1116 KB	Output is correct
12	Correct	12 ms	1628 KB	Output is correct
13	Correct	38 ms	4436 KB	Output is correct
14	Correct	48 ms	5980 KB	Output is correct
15	Correct	93 ms	12884 KB	Output is correct
16	Correct	97 ms	13908 KB	Output is correct
17	Correct	136 ms	17236 KB	Output is correct
18	Correct	160 ms	19328 KB	Output is correct
19	Correct	242 ms	23844 KB	Output is correct
20	Correct	238 ms	24288 KB	Output is correct