Submission #663298

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
663298	2022-11-26T17:48:58 Z	esomer	Poi (IOI09_poi)	C++17	100 / 100	228 ms	16048 KB

poi

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define endl "\n"

const int MOD = 1e9 + 7;

void solve(){
    int n, t, p; cin >> n >> t >> p; p--;
    vector<int> scores(t, n);
    vector<vector<int>> v(n, vector<int>(t));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < t; j++){
            int x; cin >> x;
            if(x == 1) scores[j]--;
            v[i][j] = x;
        }
    }
    vector<tuple<int, int, int>> res(n);
    for(int i = 0; i < n; i++){
        int score = 0;
        int tasks = 0;
        for(int j = 0; j < t; j++){
            if(v[i][j]) {score += scores[j]; tasks++;}
        }
        res[i] = {score, tasks, i};
    }
    function<bool(tuple<int, int, int>, tuple<int, int, int>)> cmp = [&](tuple<int, int, int> a, tuple<int, int, int> b){
        if(get<0>(a) == get<0>(b)){
            if(get<1>(a) == get<1>(b)) return get<2>(a) < get<2>(b);
            else return get<1>(a) > get<1>(b);
        }else return get<0>(a) > get<0>(b);
    };
    sort(res.begin(), res.end(), cmp);
    for(int i = 0; i < n; i++){
        if(get<2>(res[i]) == p){
            cout << get<0>(res[i]) << " "<< i + 1 << endl;
            return;
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    //freopen("inpt.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    //int tt; cin >> tt;
    int tt = 1;
    for(int t = 1; t <= tt; t++){
        solve();
    }
}

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	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 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	8 ms	724 KB	Output is correct
12	Correct	13 ms	1128 KB	Output is correct
13	Correct	38 ms	2644 KB	Output is correct
14	Correct	62 ms	3668 KB	Output is correct
15	Correct	92 ms	6228 KB	Output is correct
16	Correct	114 ms	6720 KB	Output is correct
17	Correct	137 ms	9900 KB	Output is correct
18	Correct	151 ms	11140 KB	Output is correct
19	Correct	194 ms	14508 KB	Output is correct
20	Correct	228 ms	16048 KB	Output is correct