Submission #1234505

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234505		PlayVoltz	Poi (IOI09_poi)	C++20	100 / 100	373 ms	16152 KiB

poi

#include <bits/stdc++.h>
using namespace std;

bool customsort(pair<int, pair<int, int> >&a, pair<int, pair<int, int> >&b){
	if (a.first==b.first){
		if (a.second.first==b.second.first){
			return a.second.second<b.second.second;
		}
		return a.second.first>b.second.first;
	}
	return a.first>b.first;
}

int main(){
	int n, t, p;
	cin>>n>>t>>p;
	vector <vector <int> > vect;
	vect.resize(n, vector<int>(t));
	vector <int> points(t, 0);
	for (int i=0; i<n; ++i){
		for (int j=0; j<t; ++j){
			cin>>vect[i][j];
			if (vect[i][j]==0){
				points[j]+=1;
			}
		}
	}
	vector <pair<int, pair<int, int> > > results;
	for (int i=0; i<n; ++i){
		int point = 0, solved = 0;
		for (int j=0; j<t; ++j){
			if (vect[i][j]==1){
				point+=points[j];
				++solved;
			}
		}
		results.push_back(make_pair(point, make_pair(solved, i+1)));
	}
	sort(results.begin(), results.end(), customsort);
	for (int i=0; i<n; ++i){
		if (results[i].second.second==p){
			cout<<results[i].first<<" "<<i+1;
			break;
		}
	}
}

• Subtask 1: 100 / 100