oj.uz

Submission #592935

# Submission time Handle Problem Language Result Execution time Memory
592935 2022-07-09T20:30:20 Z Mahtimursu Poi (IOI09_poi) C++17
100 / 100
 209 ms 9632 KB 
#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, 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, {solved[i].size(), -i}});
    }

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

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

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 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 468 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 11 ms 852 KB Output is correct
13 Correct 36 ms 1704 KB Output is correct
14 Correct 43 ms 2380 KB Output is correct
15 Correct 79 ms 5204 KB Output is correct
16 Correct 82 ms 5540 KB Output is correct
17 Correct 127 ms 6424 KB Output is correct
18 Correct 151 ms 7208 KB Output is correct
19 Correct 209 ms 8372 KB Output is correct
20 Correct 205 ms 9632 KB Output is correct