Submission #50808

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
50808	2018-06-13T11:22:03 Z	Just_Solve_The_Problem	Friend (IOI14_friend)	C++11	8 / 100	6 ms	3024 KB

friend

#include <bits/stdc++.h>
#include "friend.h"

using namespace std;

#define pb push_back
#define sz(s) (int)s.size()
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define all(s) s.begin(), s.end()

const int N = (int)1e5 + 7;
const int smN = (int)1e3 + 7;

vector < int > gr[N];
int has[smN][smN];
int c[N];

int findSample(int n, int confidence[], int host[], int protocol[]){
  int mx = 0;
  for (int i = 0; i < n; i++) {
    mx = max(mx, confidence[i]);
  }
  return mx;
}

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2680 KB	Output is correct
2	Incorrect	4 ms	2680 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	2848 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2872 KB	Output is correct
2	Correct	6 ms	2872 KB	Output is correct
3	Correct	4 ms	2872 KB	Output is correct
4	Correct	5 ms	2872 KB	Output is correct
5	Correct	5 ms	3024 KB	Output is correct
6	Correct	5 ms	3024 KB	Output is correct
7	Correct	4 ms	3024 KB	Output is correct
8	Correct	4 ms	3024 KB	Output is correct
9	Correct	4 ms	3024 KB	Output is correct
10	Correct	4 ms	3024 KB	Output is correct