oj.uz

Submission #522609

# Submission time Handle Problem Language Result Execution time Memory
522609 2022-02-05T09:27:26 Z ddy888 Poi (IOI09_poi) C++17
100 / 100
 232 ms 17384 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define rep(i,a,b) for (int i = a; i < b; i++)
#define db(x) cerr << "[ " << #x << ": " << x << " ]";
#define fast ios_base::sync_with_stdio(0); cin.tie(0)
typedef pair<int,int> pi;
typedef pair<pi,int> pii;

ll n,t,p,done[2005];
vector<int> v[2005];
vector<tuple<int,int,int> > score; // score, position, solves

bool cmp(tuple<int,int,int> a, tuple<int,int,int> b) {
    if (get<0>(a) != get<0>(b)) return get<0>(a) > get<0>(b);
    else if (get<2>(a) != get<2>(b)) return get<2>(a) > get<2>(b);
    else return get<1>(a) < get<1>(b);
}

int main() {
    fast;
    cin >> n >> t >> p;
    rep(i,0,n) {
        rep(j,0,t) {
            int tp; cin >> tp;
            if (tp == 1) v[i].pb(j);
            done[j] += tp; 
        }
    }
    rep(i,0,n) {
        ll tmp = 0;
        for (auto it: v[i]) {
            tmp += n - done[it];
        }
        score.pb(make_tuple(tmp,i,v[i].size()));
    }
    sort(score.begin(),score.end(),cmp);
    ll cnt = 1;
    for (auto it: score) {
        if (get<1>(it)+1 == p) {
            cout << get<0>(it) << " " << cnt;
            return 0;
        }
        cnt++;
    }
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 8 ms 772 KB Output is correct
12 Correct 11 ms 1176 KB Output is correct
13 Correct 32 ms 2836 KB Output is correct
14 Correct 46 ms 4040 KB Output is correct
15 Correct 84 ms 8168 KB Output is correct
16 Correct 90 ms 8728 KB Output is correct
17 Correct 135 ms 11100 KB Output is correct
18 Correct 153 ms 12688 KB Output is correct
19 Correct 203 ms 15508 KB Output is correct
20 Correct 232 ms 17384 KB Output is correct