Submission #1232039

#TimeUsernameProblemLanguageResultExecution timeMemory
1232039kl0989eFriend (IOI14_friend)C++20
8 / 100
0 ms328 KiB
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()

/*int findSample(int n, int val[],int host[],int prot[]) {// sub1
	
}*/

/*int findSample(int n, int val[],int host[],int prot[]) {// sub2
	
}*/

int findSample(int n, int val[],int host[],int prot[]) {// sub3
	return *max_element(val,val+n);
}

/*int findSample(int n, int val[],int host[],int prot[]) {// sub4
	
}*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...