oj.uz

답안 #347213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347213 2021-01-12T11:24:15 Z Iwanttobreakfree Poi (IOI09_poi) C++14
65 / 100
 769 ms 20460 KB 
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int N,T,P,contador,objetivopuntos,objetivopreg;
int main(){
	while(cin>>N>>T>>P){
		int rank=1;
		int puntos[N][T];
		vector <int> puntospreg(T);//Valor de cada pregunta
		vector <int> puntosconc(N,0); //Calificación de cada concursante
		vector <int> pregconc(N,0); //Nº de preguntas que respondió cada concursante
		for(int a=0;a<N;a++){
			for(int b=0;b<T;b++){
				cin>>puntos[a][b];
			}
		}
		for(int b=0;b<T;b++){
			contador=0;
			for(int a=0;a<N;a++){
				if(puntos[a][b]==0) contador++;
			}
			puntospreg[b]=contador;
		}
		for(int a=0;a<N;a++){
			for(int b=0;b<T;b++){
				if(puntos[a][b]==1) puntosconc[a]+=puntospreg[b],pregconc[a]++;
			}
		}
		objetivopuntos=puntosconc[P-1]; //Puntos de Philip
		objetivopreg=pregconc[P-1]; //Preguntas respondidas x Philip
		for(int a=0;a<P-1;a++){
			if(objetivopuntos==puntosconc[a]){
				if(objetivopreg>=pregconc[a]) rank++;
			}
		}
		sort(puntosconc.rbegin(),puntosconc.rend());
		int pasada=0;
		while(puntosconc[pasada]>objetivopuntos){
			rank++;
			pasada++;

	}
		cout<<objetivopuntos<<" "<<rank<<'\n';
	}
	return 0;
}

Subtask #1
65.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Incorrect 2 ms 364 KB Output isn't correct
9 Incorrect 3 ms 364 KB Output isn't correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 25 ms 1004 KB Output is correct
12 Correct 38 ms 1648 KB Output is correct
13 Incorrect 113 ms 3820 KB Output isn't correct
14 Incorrect 160 ms 5272 KB Output isn't correct
15 Incorrect 301 ms 9116 KB Output isn't correct
16 Correct 295 ms 9964 KB Output is correct
17 Correct 457 ms 14304 KB Output is correct
18 Correct 511 ms 15472 KB Output is correct
19 Correct 671 ms 19004 KB Output is correct
20 Correct 769 ms 20460 KB Output is correct