Submission #592931

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
592931	2022-07-09T20:20:27 Z	Mahtimursu	Poi (IOI09_poi)	C++17	70 / 100	195 ms	9532 KB

poi

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007
#define N (1 << 18)

using namespace std;

int score[2001];
vector<int> solved[2001];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, t, p;
    cin >> n >> t >> p;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= t; ++j) {
            int x;
            cin >> x;
            if (x == 0) score[j]++;
            else solved[i].push_back(j);
        }
    }

    vector<pair<int, int>> v;
    for (int i = 1; i <= n; ++i) {
        int sc = 0;
        for (int x : solved[i]) sc += score[x];
        v.push_back({sc, -i});
    }

    sort(v.rbegin(), v.rend());

    for (int i = 0; i < n; ++i) {
        if (v[i].second == -p) {
            cout << v[i].first << " " << i + 1 << "\n";
        }
    }

    return 0;
}

Subtask #1

70.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Incorrect	0 ms	340 KB	Output isn't correct
4	Incorrect	0 ms	340 KB	Output isn't correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Incorrect	1 ms	340 KB	Output isn't correct
8	Incorrect	1 ms	340 KB	Output isn't correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	6 ms	596 KB	Output is correct
12	Correct	10 ms	768 KB	Output is correct
13	Incorrect	32 ms	1688 KB	Output isn't correct
14	Correct	44 ms	2360 KB	Output is correct
15	Incorrect	77 ms	5152 KB	Output isn't correct
16	Correct	81 ms	5544 KB	Output is correct
17	Correct	122 ms	6460 KB	Output is correct
18	Correct	155 ms	7184 KB	Output is correct
19	Correct	179 ms	8396 KB	Output is correct
20	Correct	195 ms	9532 KB	Output is correct