Submission #232349

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
232349	2020-05-16T19:52:15 Z	cfalas	Poi (IOI09_poi)	C++14	0 / 100	830 ms	16376 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

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	256 KB	Output isn't correct
2	Incorrect	4 ms	256 KB	Output isn't correct
3	Incorrect	4 ms	256 KB	Output isn't correct
4	Incorrect	4 ms	256 KB	Output isn't correct
5	Incorrect	5 ms	256 KB	Output isn't correct
6	Incorrect	5 ms	256 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	31 ms	1144 KB	Output isn't correct
12	Incorrect	47 ms	1400 KB	Output isn't correct
13	Incorrect	129 ms	3064 KB	Output isn't correct
14	Incorrect	188 ms	3964 KB	Output isn't correct
15	Incorrect	314 ms	6516 KB	Output isn't correct
16	Incorrect	379 ms	6904 KB	Output isn't correct
17	Incorrect	503 ms	9976 KB	Output isn't correct
18	Incorrect	571 ms	11256 KB	Output isn't correct
19	Incorrect	746 ms	14712 KB	Output isn't correct
20	Incorrect	830 ms	16376 KB	Output isn't correct