제출 #1188326

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1188326		exoworldgd	Poi (IOI09_poi)	C++20	100 / 100	193 ms	16184 KiB

poi

#include <bits/stdc++.h>
using namespace std;
int main(void) {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,m,p;
    cin >> n >> m >> p;
    vector<vector<int>> solved(n+1,vector<int>(m));
    for(int i = 1; i <= n; i++) for(int j = 0; j < m; j++) cin >> solved[i][j];
    vector<int> w(m,0);
    for(int j = 0; j < m; j++) for(int i = 1; i <= n; i++) if(!solved[i][j]) w[j]++;
    vector<int> score(n+1,0),cnt(n+1,0);
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < m; j++){
            if(solved[i][j]){
                score[i] += w[j];
                cnt[i]++;
            }
        }
    }
    vector<tuple<int,int,int>> v;
    v.reserve(n);
    for(int i = 1; i <= n; i++) v.emplace_back(-score[i], -cnt[i], i);
    sort(v.begin(),v.end());
    int rank = 0;
    for(int i = 0; i < n; i++){
        if(get<2>(v[i]) == p){
            rank = i+1;
            break;
        }
    }
    cout << score[p] << " " << rank;
}

• Subtask 1: 100 / 100