Submission #383303

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
383303	2021-03-29T14:07:58 Z	Iwanttobreakfree	Poi (IOI09_poi)	C++17	100 / 100	752 ms	24044 KB

poi

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
	long long int n,t,p;
	cin>>n>>t>>p;
	p--;
	vector<pair<long long int,pair<long long int,long long int> > > puntos(n);
	int task[n][t];
	for(int i=0;i<n;i++){
	puntos[i].second.second=n-i;
	puntos[i].first=0;
	puntos[i].second.first=0;	
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<t;j++){
			cin>>task[i][j];
		}
	}
	for(int i=0;i<t;i++){
		int cont=0;
		for(int j=0;j<n;j++){
			if(task[j][i]==0)cont++;
		}
		for(int j=0;j<n;j++){
			if(task[j][i]==1){
			puntos[j].first+=cont;
			puntos[j].second.first++;	
			}
		}
	}
	cout<<puntos[p].first<<' ';
	sort(puntos.rbegin(),puntos.rend());
	for(int i=0;i<n;i++){
		if(puntos[i].second.second==n-p)cout<<i+1;
		//cout<<puntos[i].first<<' '<<puntos[i].second.first<<' '<<puntos[i].second.second<<'\n';
	}
}

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	364 KB	Output is correct
4	Correct	1 ms	364 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	3 ms	364 KB	Output is correct
9	Correct	4 ms	364 KB	Output is correct
10	Correct	6 ms	492 KB	Output is correct
11	Correct	22 ms	1004 KB	Output is correct
12	Correct	43 ms	1516 KB	Output is correct
13	Correct	105 ms	3820 KB	Output is correct
14	Correct	152 ms	5356 KB	Output is correct
15	Correct	272 ms	9196 KB	Output is correct
16	Correct	299 ms	9836 KB	Output is correct
17	Correct	446 ms	14468 KB	Output is correct
18	Correct	506 ms	16304 KB	Output is correct
19	Correct	680 ms	21612 KB	Output is correct
20	Correct	752 ms	24044 KB	Output is correct