oj.uz

답안 #597620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
597620 2022-07-16T12:12:12 Z l_reho Poi (IOI09_poi) C++14
45 / 100
 626 ms 16024 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

int N, K, P;
vector<vector<int>> V;
vector<int> S;

bool compare(array<int, 3> a1, array<int, 3> a2){
	return a1[0] > a2[0] || ((a1[0] == a2[0] && a1[1] > a2[1]) || (a1[1] == a2[1] && a1[2] < a2[2]));
}

void solve(){
	
	cin>>N>>K>>P;
	V.assign(N, vector<int>(K, 0));
	S.assign(K, 0);
	
	for(int i = 0; i < N; i++)
		for(int j = 0; j < K;  j++) cin>>V[i][j];
	
	
	
	for(int i = 0; i < K; i++){
		for(int j = 0; j < N; j++){
			S[i]+=V[j][i];
		}
		S[i] = N-S[i];
	}
	
	vector<array<int, 3>> A(N);
	
	// faccio cose
	for(int i = 0; i < N; i++){
		int points = 0, solved = 0;
		for(int j = 0; j < K; j++){
			solved += V[i][j];
			if(V[i][j]) points += S[j];
		}
		A[i] = array<int,3>{points, solved, i};
	}
	
	
	sort(A.begin(), A.end(), compare);
	
	for(int i = 0; i < N; i++) if(A[i][2] == P-1){cout<<A[i][0]<<" "<<i+1<<endl; break;}
	
}

int main(){
	solve();
}

Subtask #1
45.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 296 KB Output isn't correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Incorrect 3 ms 340 KB Output isn't correct
10 Incorrect 5 ms 468 KB Output isn't correct
11 Incorrect 22 ms 852 KB Output isn't correct
12 Incorrect 29 ms 1108 KB Output isn't correct
13 Incorrect 84 ms 2752 KB Output isn't correct
14 Correct 118 ms 3784 KB Output is correct
15 Correct 204 ms 6572 KB Output is correct
16 Incorrect 225 ms 7068 KB Output isn't correct
17 Incorrect 339 ms 9988 KB Output isn't correct
18 Incorrect 386 ms 11084 KB Output isn't correct
19 Incorrect 517 ms 14448 KB Output isn't correct
20 Incorrect 626 ms 16024 KB Output isn't correct