Submission #347184

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
347184	2021-01-12T08:34:15 Z	BlancaHM	Poi (IOI09_poi)	C++14	100 / 100	772 ms	24172 KB

poi

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> puntos, solucionesPorProblema, problemasResueltos;

bool comp(int i, int j) {
	// comparador para ordenar los jugadores
	if (puntos[i] > puntos[j]) return true;
	else if (puntos[i] < puntos[j]) return false;
	else if (problemasResueltos[i] > problemasResueltos[j]) return true;
	else if (problemasResueltos[i] < problemasResueltos[j]) return false;
	else return i < j;
}

void ordenarJugadores(vector<vector<int>> & tabla, vector<int> & jugadores) {
	int T = (int) tabla[0].size(), N = (int) jugadores.size();
	for (int i = 0; i < T; i++) {
		for (int j = 0; j < N; j++) solucionesPorProblema[i] += tabla[j][i];
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < T; j++) {
			if (tabla[i][j]) {
				puntos[i] += (N-solucionesPorProblema[j]);
				problemasResueltos[i]++;
			}
		}
	}

	sort(jugadores.begin(), jugadores.end(), comp);
}

int main() {
	int N, T, P;
	cin >> N >> T >> P;
	vector<vector<int>> tabla(N, vector<int>(T));
	vector<int> jugadores(N);
	puntos.assign(N, 0);
	problemasResueltos.assign(N, 0);
	solucionesPorProblema.assign(T, 0);
	for (int i = 0; i < N; i++) {
		jugadores[i] = i;
		for (int j = 0; j < T; j++) {
			cin >> tabla[i][j];
		}
	}

	ordenarJugadores(tabla, jugadores);

	for (int i = 0; i < N; i++) {
		if (jugadores[i] == P-1) {
			cout << puntos[P-1] << " " << i+1 << "\n";
			break;
		}
	}
	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	3 ms	376 KB	Output is correct
10	Correct	7 ms	492 KB	Output is correct
11	Correct	23 ms	1004 KB	Output is correct
12	Correct	37 ms	1516 KB	Output is correct
13	Correct	112 ms	3820 KB	Output is correct
14	Correct	157 ms	5356 KB	Output is correct
15	Correct	279 ms	9196 KB	Output is correct
16	Correct	310 ms	10220 KB	Output is correct
17	Correct	479 ms	14444 KB	Output is correct
18	Correct	528 ms	16620 KB	Output is correct
19	Correct	701 ms	21612 KB	Output is correct
20	Correct	772 ms	24172 KB	Output is correct