# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071820 | cpdreamer | Friend (IOI14_friend) | C++14 | 1 ms | 860 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "friend.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>
#define V vector
#define F first
#define S second
#define P pair
#define pb push_back
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
V<int>adj[(int)1001];
void dfs(int n,bool vis[],V<int>&vp){
if(vis[n])return;
vis[n]=true;
vp.pb(n);
for(auto u:adj[n]) {
dfs(u, vis,vp);
}
}
bool custom(P<int,int>a,P<int,int>b){
return a.S<=b.S;
}
int findSample(int n,int confidence[],int host[],int protocol[]){
for(int i=1;i<n;i++){
if(protocol[i]==0){
adj[host[i]].pb(i);
adj[i].pb(host[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |