Submission #524306

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
524306	2022-02-09T02:59:56 Z	itachi	Poi (IOI09_poi)	C++14	100 / 100	253 ms	15680 KB

poi

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<iomanip>

using namespace std;
struct player {
	int id;
	int tasks;
	int points;
	string doneTasks = "";
	player(int id, int tasks, int points) {
		this->id = id;
		this->tasks = tasks;
		this->points = points;
	}

	friend bool operator < (player a, player b) {
		if(a.points == b.points) {
			if(a.tasks == b.tasks) {
				return a.id < b.id;
			}
			return a.tasks > b.tasks;
		}
		return a.points > b.points;
	}
};


int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);

	int n;
	cin >> n;
	vector<player> players(n,player(0,0,0));
	int t,k;
	cin >> t >> k;
	vector<int> tasks(t,0);
	for(int i = 0; i < n; i++) {
		for (int j = 0; j < t; j++)
		{
			int l;
			cin >> l;
			tasks[j] += l;
			players[i].doneTasks += (l?'1':'0');
			players[i].id = i;
			players[i].tasks += l;
		}
	}

	for(int i=0;i<n;i++){
		for(int j=0;j<t;j++){
			if(players[i].doneTasks[j] == '1'){
				players[i].points += (n-tasks[j]);
			}
		}
	}

	sort(players.begin(), players.end());

	for(int i=0;i<n;i++){
		if(players[i].id+1 == k){
			cout << players[i].points << " " << i+1 << endl;
			break;
		}
	}

}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	308 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	328 KB	Output is correct
11	Correct	8 ms	588 KB	Output is correct
12	Correct	13 ms	844 KB	Output is correct
13	Correct	37 ms	2084 KB	Output is correct
14	Correct	53 ms	2840 KB	Output is correct
15	Correct	92 ms	5472 KB	Output is correct
16	Correct	100 ms	5956 KB	Output is correct
17	Correct	148 ms	7864 KB	Output is correct
18	Correct	168 ms	8804 KB	Output is correct
19	Correct	223 ms	11252 KB	Output is correct
20	Correct	253 ms	15680 KB	Output is correct