Submission #586236

#	Time	Username	Problem	Language	Result	Execution time	Memory
586236		Tekor	Friend (IOI14_friend)	C++17	0 / 100	10 ms	10952 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair <int,int>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
#define ll long long
const int N = 3e5 + 100;
const int M = 20;
vector <int> g[N];
int tek,tek1;
int cost[N];
int findSample(int n,int c[],int st[],int type[]){
	for(int i = 1;i < n;i++) {
		if(type[i] == 0) {
			g[st[i]].pb(i);
			g[i].pb(st[i]);
		}else if(type[i] == 1) {
			for(auto to : g[st[i]]) {
				g[to].pb(i);
				g[i].pb(to);
			}
		}else {
			g[st[i]].pb(i);
			g[i].pb(st[i]);
			for(auto to : g[st[i]]) {
				g[to].pb(i);
				g[i].pb(to);
			}
		}
	}
	int ans = 0;
	return ans;
}

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