Submission #539165

# Submission time Handle Problem Language Result Execution time Memory
539165 2022-03-18T14:11:56 Z astoria Poi (IOI09_poi) C++14
100 / 100
582 ms 23760 KB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N,T,P;
    cin >> N >> T >> P;
    P--;
    
    int taskssolved[N][T];
    int score[T] = {0};
    
    for (int i=0; i<N; i++){
        for (int j=0; j<T; j++){
            cin >> taskssolved[i][j];
            if (taskssolved[i][j] == 0) score[j]++;
        }
    }
    
    int scores[N] = {0};
    
    for (int i=0; i<N; i++){
        for (int j=0; j<T; j++){
            if (taskssolved[i][j] == 1) scores[i] += score[j];
        }
    }
    
    int numsolves[N] = {0};
    
    for (int i=0; i<N; i++){
        for (int j=0; j<T; j++){
            if (taskssolved[i][j] == 1) numsolves[i]++;
        }
    }
    
    for (int i=0; i<N; i++){
        scores[i] = 0-scores[i];
        numsolves[i] = 0-numsolves[i];
    }
    
    pair<int,pair<int,int> > alltheinfo[N]; // <score, <numsolves,id> >
    
    for (int i=0; i<N; i++){
        alltheinfo[i] = make_pair(scores[i], make_pair(numsolves[i],i));
    }
    sort(alltheinfo,alltheinfo+N);
    
    for (int i=0; i<N; i++){
        if (alltheinfo[i].second.second == P){
            cout << 0-alltheinfo[i].first << " " << (i+1);
        }
    }
}
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 5 ms 472 KB Output is correct
11 Correct 19 ms 1004 KB Output is correct
12 Correct 29 ms 1440 KB Output is correct
13 Correct 96 ms 3772 KB Output is correct
14 Correct 131 ms 5268 KB Output is correct
15 Correct 236 ms 9208 KB Output is correct
16 Correct 267 ms 9948 KB Output is correct
17 Correct 354 ms 14284 KB Output is correct
18 Correct 419 ms 16252 KB Output is correct
19 Correct 569 ms 21428 KB Output is correct
20 Correct 582 ms 23760 KB Output is correct