# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
156744 | 2019-10-07T08:25:54 Z | AKaan37 | Split the Attractions (IOI19_split) | C++17 | 0 ms | 0 KB |
#include "split.h" //Sani buyuk Osman Pasa Plevneden cikmam diyor. //FatihSultanMehmedHan //Abdulhamid Han //Bismillahirrahmanirrahim //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█▄█ //█─█─█▄─█▄─█─█─█─█ #pragma GCC optimize ("O3") #pragma GCC target ("sse4") #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > 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,b[li],a[li],k,flag,t,vis[li],bb,say,visit[li],renk[li]; int cev; string s; vector<int> v[li]; vector<int> vv; inline void dfs(int node,int der,int ind){ if(vis[node]==1)return ; vis[node]=1; for(int i=0;i<(int)v[node].size();i++){ int go=v[node][i]; dfs(go,der+1,ind); } if(visit[node]==0){ if(say>=bb)return ; say++; visit[node]=ind; //~ cout<<say<<endl; } //~ renk[node]=ind; }