Submission #232348

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
232348	2020-05-16T19:49:23 Z	cfalas	Poi (IOI09_poi)	C++14	5 / 100	828 ms	23932 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<<" "<<sc[i].F.S<<endl;
	}
}

Subtask #1

5.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	256 KB	Output isn't correct
2	Incorrect	5 ms	256 KB	Output isn't correct
3	Incorrect	4 ms	256 KB	Output isn't correct
4	Correct	4 ms	256 KB	Output is correct
5	Incorrect	5 ms	384 KB	Output isn't correct
6	Incorrect	5 ms	384 KB	Output isn't correct
7	Incorrect	6 ms	384 KB	Output isn't correct
8	Incorrect	6 ms	384 KB	Output isn't correct
9	Incorrect	8 ms	384 KB	Output isn't correct
10	Incorrect	11 ms	512 KB	Output isn't correct
11	Incorrect	30 ms	1016 KB	Output isn't correct
12	Incorrect	47 ms	1536 KB	Output isn't correct
13	Incorrect	132 ms	3832 KB	Output isn't correct
14	Incorrect	189 ms	5344 KB	Output isn't correct
15	Incorrect	322 ms	9208 KB	Output isn't correct
16	Incorrect	359 ms	9924 KB	Output isn't correct
17	Incorrect	518 ms	14456 KB	Output isn't correct
18	Incorrect	571 ms	16376 KB	Output isn't correct
19	Incorrect	754 ms	21780 KB	Output isn't correct
20	Incorrect	828 ms	23932 KB	Output isn't correct