Submission #568623

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
568623	2022-05-25T20:12:46 Z	TomkeMonke	Poi (IOI09_poi)	C++17	15 / 100	586 ms	23796 KB

poi

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e3 + 7;

int tab[MAXN][MAXN];

int scores[MAXN];

int main(){
	
	int n, t, p;
	cin >> n >> t >> p;
	
	for(int i = 1; i <= n; i++){
		
		for(int j = 1; j <= t; j++){
		
			cin >> tab[i][j];
		}	
	}
	
	//for(int j = 1; j <= t; j++)
	//	cout << tab[p][j] << endl;
	
	int res = 0;
	
	for(int i = 1; i <= t; i++){
		
		res = 0;
		
		for(int j = 1; j <= n; j++){
		
			if(tab[j][i] == 0) res++;
		}
		
		for(int j = 1; j <= n; j++){
		
			if(tab[j][i] == 1) scores[j] += res;
		}
	}
	
	cout << scores[p] << " ";
	
	//for(int i = 1; i <= n; i++) 
	//	cout << scores[i] << " ";
		
	//cout << endl;	
	
	res = scores[p];
	
	sort(scores + 1, scores + n + 1);
	
	for(int i = 1; i <= n; i++){
		
		if(scores[i] == res){
			
			cout << (n - i - 1) << endl;
			break;
		}
		
	}
		
	
	return 0;
}

Subtask #1

15.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	212 KB	Output isn't correct
2	Incorrect	0 ms	340 KB	Output isn't correct
3	Incorrect	1 ms	340 KB	Output isn't correct
4	Incorrect	1 ms	340 KB	Output isn't correct
5	Incorrect	1 ms	340 KB	Output isn't correct
6	Incorrect	1 ms	468 KB	Output isn't correct
7	Correct	1 ms	568 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Incorrect	3 ms	780 KB	Output isn't correct
10	Incorrect	6 ms	1220 KB	Output isn't correct
11	Incorrect	18 ms	2112 KB	Output isn't correct
12	Incorrect	29 ms	3404 KB	Output isn't correct
13	Incorrect	85 ms	6532 KB	Output isn't correct
14	Incorrect	122 ms	9212 KB	Output isn't correct
15	Correct	239 ms	12680 KB	Output is correct
16	Incorrect	238 ms	13732 KB	Output isn't correct
17	Incorrect	371 ms	16696 KB	Output isn't correct
18	Incorrect	397 ms	19012 KB	Output isn't correct
19	Incorrect	533 ms	23160 KB	Output isn't correct
20	Incorrect	586 ms	23796 KB	Output isn't correct