제출 #715361

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715361		Toxtaq	Poi (IOI09_poi)	C++17	100 / 100	576 ms	16156 KiB

poi

#include<bits/stdc++.h>
using namespace std;
struct Person{
    int point = 0, num_of_solved = 0, indx = 0;
    friend bool operator<(Person &a, Person &b){
        if(a.point == b.point && a.num_of_solved == b.num_of_solved)return a.indx < b.indx;
        else if(a.point == b.point)return a.num_of_solved > b.num_of_solved;
        return a.point > b.point;
    }
};
int main()
{
    int n, t, p;
    cin >> n >> t >> p;
    vector<vector<int>>v(n + 1, vector<int>(t + 1));
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= t;++j){
            cin >> v[i][j];
        }
    }
    vector<int>point_for_each_task(t + 1);
    for(int i = 1;i <= t;++i){
        for(int j = 1;j <= n;++j){
            point_for_each_task[i] += (v[j][i] == 0);
        }
    }
    vector<Person>people(n);
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= t;++j){
            if(v[i][j])people[i - 1].point += point_for_each_task[j];
            people[i - 1].num_of_solved += (v[i][j] == 1);
        }
        people[i - 1].indx = i;
    }
    sort(people.begin(), people.end());
    for(int i = 0;i < n;++i){
        if(people[i].indx == p){
            cout << people[i].point << " " << i + 1;
            return 0;
        }
    }
}

• Subtask 1: 100 / 100