Submission #372862

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
372862	2021-03-02T05:36:31 Z	lakshith_	Poi (IOI09_poi)	C++14	100 / 100	681 ms	16236 KB

poi

#include <bits/stdc++.h>

using namespace std;

struct student{
	int id;
	int score;
	vector<int> solved;
};

bool comp(student s1,student s2){
	if(s1.score!=s2.score)return s1.score>s2.score;
	if(s1.solved.size()!=s2.solved.size())return s1.solved.size() > s2.solved.size();
	else return s1.id < s2.id;
}

int main(){
	int n,t,p;
	cin >> n >> t >> p;
	int c[t];
	memset(c,0,sizeof(c));
	vector<student> students;
	for(int i=0;i<n;i++){
		student s;
		for(int j=0;j<t;j++){
			int a;
			cin >> a;
			c[j] += (a==0);
			if(a==1)
			s.solved.push_back(j);
		}
		s.id = i+1;
		s.score = 0;
		students.push_back(s);
	}
	for(int i=0;i<n;i++){
		int r = 0;
		for(int x:students[i].solved)r += c[x];
		students[i].score = r;
	}
	sort(students.begin(),students.end(),comp);
	for(int i =0;i<n;i++){
		if(students[i].id==p){
			cout << students[i].score << " " << i+1 << "\n";
			return 0;
		}
	}
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 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	2 ms	384 KB	Output is correct
9	Correct	3 ms	364 KB	Output is correct
10	Correct	6 ms	492 KB	Output is correct
11	Correct	21 ms	876 KB	Output is correct
12	Correct	34 ms	1132 KB	Output is correct
13	Correct	100 ms	2668 KB	Output is correct
14	Correct	154 ms	3820 KB	Output is correct
15	Correct	287 ms	6524 KB	Output is correct
16	Correct	268 ms	6736 KB	Output is correct
17	Correct	423 ms	9780 KB	Output is correct
18	Correct	454 ms	11244 KB	Output is correct
19	Correct	599 ms	14848 KB	Output is correct
20	Correct	681 ms	16236 KB	Output is correct