Submission #232350

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
232350	2020-05-16T19:53:25 Z	cfalas	Poi (IOI09_poi)	C++14	100 / 100	833 ms	16120 KB

poi

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID (l+r)/2
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6

#define T double
typedef complex<T> pt;
#define x real()
#define y imag()
T dot(pt v, pt w) {return (conj(v)*w).x;}
T cross(pt v, pt w) {return (conj(v)*w).y;}
T orient(pt a, pt b, pt c) {return cross(b-a,c-a);}
T dist(pt a, pt b) {return abs(a-b);}

int main(){
	int n, m, k;
	cin>>n>>m>>k;
	int a[n][m];
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++) cin>>a[i][j];
	}
	int scnt[m] = {};
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++) if(a[i][j]==0) scnt[j]++;
	}
	pair<ii, int> sc[n];
	for(int i=0;i<n;i++){
		sc[i].F = ii(0,0);
		sc[i].S = i;
		for(int j=0;j<m;j++){
			if(a[i][j]) sc[i].F.F-=scnt[j], sc[i].F.S--;
		}
	}
	sort(sc, sc+n);
	for(int i=0;i<n;i++){
		if(sc[i].S==k-1) cout<<-sc[i].F.F<<" "<<i+1<<endl;
	}
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	256 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	6 ms	384 KB	Output is correct
9	Correct	7 ms	384 KB	Output is correct
10	Correct	11 ms	384 KB	Output is correct
11	Correct	30 ms	760 KB	Output is correct
12	Correct	46 ms	1144 KB	Output is correct
13	Correct	136 ms	2672 KB	Output is correct
14	Correct	183 ms	3704 KB	Output is correct
15	Correct	316 ms	6264 KB	Output is correct
16	Correct	337 ms	6896 KB	Output is correct
17	Correct	511 ms	9720 KB	Output is correct
18	Correct	568 ms	11256 KB	Output is correct
19	Correct	760 ms	14584 KB	Output is correct
20	Correct	833 ms	16120 KB	Output is correct