Submission #157231

#TimeUsernameProblemLanguageResultExecution timeMemory
157231AKaan37장난감 기차 (IOI17_train)C++17
0 / 100
2075 ms760 KiB
#include "train.h" //Sani buyuk Osman Pasa Plevneden cikmam diyor. //FatihSultanMehmedHan //Abdulhamid Han //Bismillahirrahmanirrahim //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█▄█ //█─█─█▄─█▄─█─█─█─█ #pragma GCC optimize ("O3") #pragma GCC target ("sse4") #include <bits/stdc++.h> #include <cstdio> #include <vector> #include <cassert> 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 n,m,b[li],a[li],k,flag,t,fa[li],vis[li]; int cev; string s; vector<int> v; inline int dsu(int x){ if(x==fa[x])return x; return fa[x]=dsu(fa[x]); } std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> x, std::vector<int> y) { for(int i = 0; i < (int)a.size(); i++){ flag=0; for(int j=0;j<(int)a.size();j++)fa[j]=j; for(int j=0;j<(int)x.size();j++){ for(int k=0;k<(int)y.size();k++){ if(dsu(x[j])==dsu(y[k]) && (vis[dsu(x[j])]==1 || vis[dsu(y[k])]==1))flag=1; fa[dsu(x[j])]=dsu(y[k]); vis[dsu(x[j])]=1; } } if(flag==1)v.pb(1); else v.pb(0); } return v; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...