Submission #430681

#	Time	Username	Problem	Language	Result	Execution time	Memory
430681		Rouge_Hugo	Friend (IOI14_friend)	C++14	8 / 100	1 ms	332 KiB

friend

#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++)
    {
        if(p[i]==0){
        v[h[i]].pb(i);
        v[i].pb(h[i]);}
        else {
            for(auto it:v[h[i]]){
                v[i].pb(it);
                v[it].pb(i);
            }
        }
    }
    int mx=0;
    for(int i=n-1;i>-1;i--)
    {
        if(vis[i]!=-1)continue;
        re=0;al=0;
        dfs(i,1);
        mx+=max(re,al-re);
    }
    return mx;*/
}
/*
5
1 100 1 1 100
0 0
0 0
1 1
2 2
*/

• Subtask 1: 0 / 11
• Subtask 2: 0 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 19
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31