답안 #495537

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
495537 2021-12-19T09:48:49 Z PiejanVDC Poi (IOI09_poi) C++17
70 / 100
553 ms 884 KB
#include <bits/stdc++.h>
using namespace std;

signed main() {
    int n,t,p; cin>>n>>t>>p;
    vector<int>v(t,n);
    vector<vector<bool>>l(n,vector<bool>(t,0));
    for(int i = 0 ; i < n ; i++) {
        for(int j = 0 ; j < t ; j++) {
            int x; cin>>x;
            if(x) l[i][j] = 1;
            if(l[i][j]) v[j]--;
        }
    }
    vector<pair<int,int>>scores;
    for(int i = 0 ; i < n ; i++) {
        int score = 0;
        for(int j = 0 ; j < t ; j++) {
            if(l[i][j]) score += v[j];
        }
        scores.push_back({score,i});
    }
    p--;
    sort(scores.rbegin(),scores.rend());
    for(int i = 0 ; i < n ; i++) {
        if(scores[i].second == p) {
            int j = i+1;
            int cnt=0;
            while(j < n && scores[j].first == scores[i].first) cnt++,j++;
            j = i-1;
            int cntB=0;
            while(j >= 0 && scores[j].first == scores[i].first) cntB++,j--;
            cout << scores[i].first << " " << i - cntB + cnt + 1;
            return 0;
        }
    }
    assert(0);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Incorrect 0 ms 204 KB Output isn't correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 4 ms 204 KB Output is correct
11 Correct 18 ms 312 KB Output is correct
12 Correct 28 ms 332 KB Output is correct
13 Incorrect 90 ms 384 KB Output isn't correct
14 Correct 122 ms 432 KB Output is correct
15 Incorrect 203 ms 536 KB Output isn't correct
16 Correct 225 ms 544 KB Output is correct
17 Correct 322 ms 632 KB Output is correct
18 Correct 379 ms 696 KB Output is correct
19 Correct 498 ms 844 KB Output is correct
20 Correct 553 ms 884 KB Output is correct