Submission #50808

#	Time	Username	Problem	Language	Result	Execution time	Memory
50808		Just_Solve_The_Problem	Friend (IOI14_friend)	C++11	8 / 100	6 ms	3024 KiB

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
• Subtask 2: 0 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31