oj.uz

Submission #463071

# Submission time Handle Problem Language Result Execution time Memory
463071 2021-08-11T02:45:50 Z danielsuh Poi (IOI09_poi) C++17
100 / 100
 445 ms 23796 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int mxN = 2005;
int task[mxN][mxN];
vector<int> scores(mxN), cont(mxN), task_solved(mxN);

bool cmp(const int &a, const int &b) {
    if(cont[a] != cont[b]) {
        return cont[a] > cont[b];
    }
    if(task_solved[a] != task_solved[b]) {
        return task_solved[a] > task_solved[b];
    }
    return a < b;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N, T, P; cin >> N >> T >> P;
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < T; j++) {
            cin >> task[i][j];
        }
    }
    for(int i = 0; i < T; i++) {
        int temp = 0;
        for(int j = 0; j < N; j++) {
            temp += int(task[j][i] == 0);
        }
        scores[i] = temp;
    }
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < T; j++) {
            task[i][j] == 1 ? cont[i] += scores[j] : cont[i] += 0;
            task_solved[i] += int(task[i][j] == 1);
        }
    }
    vector<int> indices(N);
    for(int i = 0; i < N; i++) {
        indices[i] = i;
    }
    sort(indices.begin(), indices.end(), cmp);
    cout << cont[P - 1] << " ";
    for(int i = 0; i < N; i++) {
        if(indices[i] == P - 1) {
            cout << i + 1 << "\n";
            return 0;
        }
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 740 KB Output is correct
10 Correct 4 ms 1228 KB Output is correct
11 Correct 16 ms 2308 KB Output is correct
12 Correct 21 ms 3508 KB Output is correct
13 Correct 56 ms 6572 KB Output is correct
14 Correct 107 ms 9316 KB Output is correct
15 Correct 173 ms 12668 KB Output is correct
16 Correct 171 ms 13624 KB Output is correct
17 Correct 227 ms 16696 KB Output is correct
18 Correct 263 ms 18968 KB Output is correct
19 Correct 342 ms 23016 KB Output is correct
20 Correct 445 ms 23796 KB Output is correct