Submission #150483

#TimeUsernameProblemLanguageResultExecution timeMemory
150483등수만큼 신재웅 생일빵 때림 (10대) (#200)Trip to the Galapagos Islands (FXCUP4_island)C++17
31 / 100
4307 ms232672 KiB
#include <bits/stdc++.h> using namespace std; #define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1)) #define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple #define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N #define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__)) #define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs) #define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs) #define macro_dispatcher___(macro, nargs) macro ## nargs #define Debug1(a) cout<<#a<<"="<<(a)<<"\n" #define Debug2(a,b) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n" #define Debug3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n" #define Debug4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n" #define Debug5(a,b,c,d,e) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n" #define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n" #define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__) #define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n" #define TT1 template<class T> #define TT1T2 template<class T1, class T2> #define TT1T2T3 template<class T1, class T2, class T3> template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v); TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; } TT1 ostream& operator << (ostream& os, const vector<T>& v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; } template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) { bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; } TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; } TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; } TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; } TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; } TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; } TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); } void cio(){ ios::sync_with_stdio(false); cin.tie(NULL); } #define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC ) typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define Fi first #define Se second #define pb(x) push_back(x) #define sz(x) (int)x.size() #define rep(i, n) for(int i=0;i<n;i++) #define repp(i, n) for(int i=1;i<=n;i++) #define all(x) x.begin(), x.end() #define geti1(X) cin >> X #define geti2(X,Y) cin >> X >> Y #define geti3(X,Y,Z) cin >> X >> Y >> Z #define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W #define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME #define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__) #define endl '\n' #include "island.h" int N, M, K; int BSize = 0; vector<int> F; vector<pii> elist; int par[600][300500]; int find(int t, int x){ if( par[t][x] == x ) return x; return par[t][x] = find(t, par[t][x]); } vector<pii> v; void uni(int t, int a, int b) { a = find(t, a); b = find(t, b); if( a == b ) return; par[t][a] = b; } int find2(int t, int x) { if( par[t][x] == x ) return x; return find(t, par[t][x]); } void uni2(int t, int a, int b) { a = find2(t, a); b = find2(t, b); if( a == b ) return; v.push_back({a, par[t][a]}); par[t][a] = b; } vector<int> ff[100100]; int BCNT; void Init(int _K, std::vector<int> _F, std::vector<int> S, std::vector<int> E){ K = _K; F = _F; N = F.size(), M = S.size(); BSize = (int) sqrt(M + 1); for(int i = 0; i< N; i++) ff[F[i]].push_back(i); rep(i,M) elist.push_back({S[i], E[i]}); reverse(all(elist)); for (int t = 0; t <= BSize; t++) rep(i,N) par[t][i] = i; int bcnt = 1; for (int base = 0; base < M; base += BSize, bcnt++) { for (int i = 0; i < N; i++) { if( bcnt > 0 ) par[bcnt][i] = par[bcnt-1][i]; } for (int i = base; i < min(M, base + BSize); i++) { int a = elist[i].Fi, b = elist[i].Se; uni(bcnt, a, b); } } BCNT = bcnt; for (int t = 0; t < BCNT; t++) { rep(i,N) find(t, i); } } int Separate(int A, int B){ int bcnt = 0; for (bcnt = 0; bcnt < BCNT; bcnt++) { // Debug(bcnt, ff[A][0], ff[B][0], find2(bcnt, ff[A][0]), find2(bcnt, ff[B][0])); if( find2(bcnt, ff[A][0]) == find2(bcnt, ff[B][0]) ){ break; } } bcnt--; // Debug(A, B, bcnt, BSize); int ans = 0; v.clear(); for (int i = bcnt * BSize; i < min(M, (bcnt+1)*BSize); i++) { int a = elist[i].Fi, b = elist[i].Se; if( find2(bcnt, a) == find2(bcnt, b) ) continue; else{ uni2(bcnt, a, b); } if( find2(bcnt, ff[A][0]) == find2(bcnt, ff[B][0]) ) { ans = M - i; break; } } for(int i = sz(v)-1; i >= 0; i--) { pii e = v[i]; par[bcnt][e.Fi] = e.Se; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...