oj.uz

Submission #601189

# Submission time Handle Problem Language Result Execution time Memory
601189 2022-07-21T12:54:38 Z SlyGaleeb Poi (IOI09_poi) C++17
100 / 100
 255 ms 24264 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ld long double
#define F first
#define S second
const ll N = 2e5 + 5;

vector<int>v[2005];

bool cmp (const pair<pair<int,int>,int>&a, const pair<pair<int,int>,int>&b) {
    if (a.F==b.F)
        return a.S<b.S;
    if (a.F.F==b.F.F)
        return a.F.S>b.F.S;
    return a.F.F>b.F.F;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n,t,p;
    cin >> n >> t >> p;
    vector<int>mark(t,0);
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < t; ++j) {
            int a;
            cin >> a;
            v[i].push_back(a);
        }
    }
    for (int j = 0; j < t; ++j) {
        int cnt = 0;
        for (int i = 1; i <= n; ++i) {
            if (v[i][j]==0)
                cnt++;
        }
        mark[j] = cnt;
    }
    vector<pair<pair<int,int>,int>>standing;
    for (int i = 1; i <= n; ++i) {
        int score=0, solved = 0;
        for (int j = 0; j < t; ++j) {
            if (v[i][j]==1) {
                solved++;
                score+=mark[j];
            }
        }
        standing.push_back({{score,solved},i});
    }
    sort(standing.begin(),standing.end(),cmp);
    for (int i = 0; i < n; ++i) {
        if (standing[i].S==p) {
            cout << standing[i].F.F << " " << i+1;
            break;
        }
    }
}

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 1 ms 340 KB Output is correct
4 Correct 1 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 2 ms 468 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 8 ms 1108 KB Output is correct
12 Correct 14 ms 1772 KB Output is correct
13 Correct 37 ms 4312 KB Output is correct
14 Correct 52 ms 6024 KB Output is correct
15 Correct 93 ms 12952 KB Output is correct
16 Correct 115 ms 14092 KB Output is correct
17 Correct 175 ms 17132 KB Output is correct
18 Correct 168 ms 19280 KB Output is correct
19 Correct 223 ms 23436 KB Output is correct
20 Correct 255 ms 24264 KB Output is correct