# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
430681 | Rouge_Hugo | Friend (IOI14_friend) | C++14 | 1 ms | 332 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<bits/stdc++.h>
#include "friend.h"
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N=1009;
vector<int>v[N];
int vis[N],a[N];int re=0,al=0;
void dfs(int x,int z)
{
if(vis[x]!=-1&&vis[x]!=z)while(1)re++;
if(vis[x]!=-1)return;
vis[x]=z;if(z)re++;
al++;
for(auto it:v[x])
{
// if(vis[it]!=-1)continue;
dfs(it,1-z);
}
}
int findSample(int n,int c[],int h[],int p[]){
//memset(vis,-1,sizeof vis);
int ans=0;
for(int i=0;i<n;i++)ans=max(ans,c[i]);
return ans;/*
for(int i=1;i<n;i++)
{
# | 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... |