Submission #531448

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
531448	2022-02-28T17:30:09 Z	AdamGS	Poi (IOI09_poi)	C++17	100 / 100	239 ms	23800 KB

poi

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e3+7;
int ile[LIM], T[LIM][LIM];
pair<pair<int,int>,int>W[LIM];
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, t, p;
	cin >> n >> t >> p; --p;
	rep(i, t) ile[i]=n;
	rep(i, n) rep(j, t) {
		cin >> T[i][j];
		if(T[i][j]) --ile[j];
	}
	rep(i, n) {
		int a=0, b=0;
		rep(j, t) {
			if(T[i][j]) a+=ile[j];
			b+=T[i][j];
		}
		W[i]={{-a, -b}, i};
	}
	sort(W, W+n);
	rep(i, n) if(W[i].nd==p) {
		cout << -W[i].st.st << " " << i+1 << '\n';
	}
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	452 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	588 KB	Output is correct
8	Correct	1 ms	588 KB	Output is correct
9	Correct	2 ms	720 KB	Output is correct
10	Correct	3 ms	1228 KB	Output is correct
11	Correct	8 ms	2188 KB	Output is correct
12	Correct	13 ms	3452 KB	Output is correct
13	Correct	75 ms	6640 KB	Output is correct
14	Correct	59 ms	9292 KB	Output is correct
15	Correct	92 ms	12668 KB	Output is correct
16	Correct	101 ms	13704 KB	Output is correct
17	Correct	146 ms	16708 KB	Output is correct
18	Correct	172 ms	18932 KB	Output is correct
19	Correct	215 ms	22976 KB	Output is correct
20	Correct	239 ms	23800 KB	Output is correct