Submission #565876

#TimeUsernameProblemLanguageResultExecution timeMemory
565876DeepessonICC (CEOI16_icc)C++17
7 / 100
346 ms472 KiB
#include <bits/stdc++.h> #include "icc.h" #define MAX 105 int query(int size_a, int size_b, int a[], int b[]); int query(std::vector<int> a,std::vector<int> b){ for(auto&x:a)++x; for(auto&x:b)++x; return query(a.size(),b.size(),a.data(),b.data()); } void setRoad(int a, int b); void InformaRua(int a,int b){setRoad(a+1,b+1);} int pai[MAX]; int find(int a){ if(pai[a]==a){ return a; } return pai[a]=find(pai[a]); } void Union(int a,int b){ a=find(a); b=find(b); pai[a]=b; } void run(int N) { for(int i=0;i!=MAX;++i)pai[i]=i; for(int i=1;i!=N;++i){ for(int u=0;u!=N;++u){ for(int v=u+1;v!=N;++v){ std::vector<int> a,b; a.push_back(u); b.push_back(v); if(query(a,b)){ Union(u,v); InformaRua(u,v); goto prox; } } } prox:{} } }
#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...