Submission #659797

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
659797	2022-11-19T09:34:08 Z	Gabi88	Poi (IOI09_poi)	C++14	60 / 100	525 ms	16168 KB

poi

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

#define LL long long
#define F first
#define S second

vector<pair<int, pair<int, int> > > v;
int n, m, k, l[2009][2009], rj[2009], na[2009], sum, usp = -1, pos = -1, br = 1;

int main(){
	cin >> n >> m >> k;
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			cin >> l[i][j];
			na[i] += l[i][j];
			rj[j] += (l[i][j]+1)%2;
		}
	}
	for(int i=0; i<n; i++){
		sum = 0;
		for(int j=0; j<m; j++) sum += rj[j]*l[i][j];
		v.push_back(make_pair(sum, make_pair(na[i], i+1)));
	}
	sort(v.begin(), v.end());
	sum = -1;
	for(int i=n-1; i >= 0; i--){
		if (sum != v[i].first or usp != v[i].second.first){
			sum = v[i].first;
			usp = v[i].second.first;
			pos = br;
		}
		if (v[i].second.second == k){cout << sum << " " << pos; return 0;}
		br++;
	}
	return 0;
}

/*

6 4 4
0 0 1 1
1 0 1 0
1 1 1 1
0 0 0 1
0 1 1 0
1 0 0 0

*/

Subtask #1

60.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	340 KB	Output isn't correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	312 KB	Output is correct
4	Incorrect	0 ms	340 KB	Output isn't correct
5	Correct	1 ms	440 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Incorrect	1 ms	596 KB	Output isn't correct
8	Correct	1 ms	596 KB	Output is correct
9	Incorrect	3 ms	724 KB	Output isn't correct
10	Correct	6 ms	1236 KB	Output is correct
11	Correct	18 ms	2112 KB	Output is correct
12	Incorrect	31 ms	3256 KB	Output isn't correct
13	Incorrect	82 ms	5404 KB	Output isn't correct
14	Correct	113 ms	7688 KB	Output is correct
15	Incorrect	192 ms	9804 KB	Output isn't correct
16	Correct	218 ms	10780 KB	Output is correct
17	Incorrect	319 ms	12132 KB	Output isn't correct
18	Correct	348 ms	13744 KB	Output is correct
19	Correct	470 ms	16168 KB	Output is correct
20	Correct	525 ms	16048 KB	Output is correct