답안 #97267 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97267	2019-02-14T17:01:31 Z	MvC	친구 (IOI14_friend)	C++11	8 / 100	3 ms	384 KB

friend

#pragma GCC optimize("O3")
//#include "friend.h"
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int findSample(int n,int c[],int host[],int pr[])
{
	int i;
	//for(i=0;i<n;i++)p[i].fr=c[i],p[i].sc=i;
	//sort(p,p+n);
	//reverse(p,p+n);
	int s=0;
	for(i=0;i<n;i++)s+=c[i];
	sort(c,c+n);
	//if(pr[0]==2)return c[n-1];
	return c[n-1];
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	
    return 0;
}*/

Subtask #1
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Incorrect	2 ms	384 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	2 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	356 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct