oj.uz

Submission #698125

# Submission time Handle Problem Language Result Execution time Memory
698125 2023-02-12T12:31:40 Z europium Poi (IOI09_poi) C++17
100 / 100
 214 ms 16224 KB 
// - 12/2/23
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <iterator>
#include <set>
#include <map>
#include <math.h>
#include <iomanip>
#include <unordered_set>
#include <queue>
#include <climits>
using namespace std;
// clang++ -std=c++17 IOI09_POI.cpp && ./a.out

using ll = long long;

void solve(){
    int n, t, p;
    cin >> n >> t >> p;

    vector<int> score(t);
    vector<vector<int>> c (n, vector<int>(t));

    for (int i = 0; i < n; i++){
        for (int j = 0; j < t; j++){
            cin >> c[i][j];

            if (c[i][j] == 0) score[j]++;
        }
    }

    vector<tuple<int,int,int>> rank; // score, tasks solved, ID;

    for (int i = 0; i < n; i++){
        int s = 0, solved = 0;

        for (int j = 0; j < t; j++){
            if (c[i][j] == 1){
                s += score[j];
                solved++;
            }
        }

        rank.push_back({s, solved, n - (i + 1)});
        // cout << s << ' ' << solved << ' ' << i + 1 << '\n';
    }

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

    int cnt = 0;
    for (auto [s, solved, id] : rank){
        cnt++;

        // cout << s << ' ' << solved << ' ' << id << '\n';
        if (id == (n - p)){
            cout << s << ' ' << cnt << '\n';
            return;
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen("input.txt", "r", stdin);
    solve();

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 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 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 12 ms 1364 KB Output is correct
13 Correct 35 ms 2892 KB Output is correct
14 Correct 56 ms 3944 KB Output is correct
15 Correct 80 ms 6516 KB Output is correct
16 Correct 90 ms 6984 KB Output is correct
17 Correct 150 ms 10024 KB Output is correct
18 Correct 172 ms 11328 KB Output is correct
19 Correct 191 ms 14736 KB Output is correct
20 Correct 214 ms 16224 KB Output is correct