oj.uz

답안 #617777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617777 2022-08-01T14:06:47 Z Icebear16 Poi (IOI09_poi) C++14
85 / 100
 272 ms 31676 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1e18//change to const int INF=1e18 if causing problem
const ll MOD=998244353;
const ll alt=1e10;
const ll inf=1e9+7;//Precalc is not a bad idea
#define int ll
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define mod(a) (a+inf)%inf
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
/* run this program using the console pauser or add your own getch, system("pause") or input loop*/

struct triple{
	int b;
	int c;
	int d;
};

bool cmp(triple a,triple aa){
	if(a.b!=aa.b) return a.b>aa.b;
	else{
		if(a.c!=aa.d) return a.c>aa.c;
		else return a.d<aa.d;
	}
}

int32_t main(){
	std::ios_base::sync_with_stdio(false);
//	cin.tie(0)->sync_with_stdio(0);
	int n,t,p;
	cin>>n>>t>>p;
	int a[n][t];
	vector<int> v(t,0);
	vector<triple> e(n);
	for(int i=0;i<n;i++){
		for(int j=0;j<t;j++){
			cin>>a[i][j];
		}
	}
	for(int i=0;i<t;i++){
		for(int j=0;j<n;j++){
			if(a[j][i]==0) v[i]++;
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<t;j++){
			if(a[i][j]==1) a[i][j]=v[j];
		}
	}
	for(int i=0;i<n;i++){
		int y=0,x=0;
		for(int j=0;j<t;j++){
			x+=a[i][j];
			if(a[i][j]>0) y++;
		}
		e[i].b=x;
		e[i].c=y;
		e[i].d=i+1;
	}
	sort(all(e),cmp);
	int ans1,ans2;
	for(int i=0;i<n;i++){
		if(e[i].d==p){
			ans1=e[i].b;
			ans2=i+1;
			break;
		}
	}
	cout<<ans1<<" "<<ans2<<endl;
	return 0;
}
//Icebear16

Subtask #1
85.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 11 ms 1260 KB Output is correct
12 Incorrect 13 ms 1876 KB Output isn't correct
13 Correct 38 ms 4976 KB Output is correct
14 Correct 58 ms 6996 KB Output is correct
15 Correct 97 ms 11988 KB Output is correct
16 Correct 106 ms 13056 KB Output is correct
17 Incorrect 195 ms 19132 KB Output isn't correct
18 Correct 188 ms 21640 KB Output is correct
19 Incorrect 253 ms 28500 KB Output isn't correct
20 Correct 272 ms 31676 KB Output is correct