oj.uz

Submission #698127

# Submission time Handle Problem Language Result Execution time Memory
698127 2023-02-12T12:34:10 Z europium Poi (IOI09_poi) C++17
100 / 100
 206 ms 16076 KB 
// accepted - 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; // s is score

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

        // to account for sorting ID in increasing order (not decreasing order like score or solved)
        rank.push_back({s, solved, n - (i + 1)});
    }

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

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

        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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 7 ms 724 KB Output is correct
12 Correct 11 ms 1132 KB Output is correct
13 Correct 33 ms 2644 KB Output is correct
14 Correct 49 ms 3672 KB Output is correct
15 Correct 83 ms 6228 KB Output is correct
16 Correct 87 ms 6724 KB Output is correct
17 Correct 131 ms 9776 KB Output is correct
18 Correct 143 ms 11028 KB Output is correct
19 Correct 203 ms 14496 KB Output is correct
20 Correct 206 ms 16076 KB Output is correct