제출 #147567

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
147567		AKaan37	Split the Attractions (IOI19_split)	C++17	0 / 100	15 ms	14072 KiB

split

//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include "split.h"

using namespace std;

typedef long long lo;
typedef pair< int,int > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int m,bb,k,flag,t,vis[li],say,visit[li];
int cev;
string s;
vector<int> v[li];
vector<int> vv;

inline void dfs(int node,int der){
	if(vis[node]==1 || visit[node]==1)return ;
	if(say==bb)return ;
	say++;
	vis[node]=1;
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i];
		dfs(go,der+1);
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	bb=b;
	for(int i=0;i<(int)p.size();i++){
		v[q[i]].pb(p[i]);
		v[p[i]].pb(q[i]);
	}
	dfs(0,0);
	for(int i=0;i<n;i++){
		if(vis[i]==1){vv.pb(2);visit[i]=1;}
	}
	memset(vis,0,sizeof(vis));
	say=0;
	dfs(0,0);
	for(int i=0;i<n;i++){
		if(vis[i]==1){vv.pb(1);}
		else if(visit[i]==0)vv.pb(3);
	}
	return vv;
}

//~ int main(){
	//~ vector<int>vec;
	//~ vector<int>vec1;
	//~ vector<int>vec2;
	//~ vec.clear();
	//~ vec1.clear();
	//~ vec2.clear();
	//~ vec1.pb(0);vec1.pb(0);vec1.pb(0);vec1.pb(0);vec1.pb(0);
	//~ vec2.pb(1);vec2.pb(2);vec2.pb(3);vec2.pb(4);vec2.pb(4);
	//~ vec=find_split(5,1,2,2,vec1,vec2);
	//~ for(int i=0;i<(int)vec.size();i++){
		//~ printf("%d\n",vec[i]);
	//~ }
	//~ return 0;
//~ }

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36