| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 658060 | jiahng | 낙하산 고리들 (IOI12_rings) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>using namespace std; typedef long long ll;typedef pair<int,int> pi;typedef vector <int> vi;typedef vector <pi> vpi;typedef pair<pi, ll> pii;typedef set <ll> si;typedef long double ld;#define f first#define s second#define mp make_pair#define FOR(i,s,e) for(int i=s;i<=int(e);++i)#define DEC(i,s,e) for(int i=s;i>=int(e);--i)#define pb push_back#define all(x) (x).begin(), (x).end()#define lbd(x, y) lower_bound(all(x), y)#define ubd(x, y) upper_bound(all(x), y)#define aFOR(i,x) for (auto i: x)#define mem(x,i) memset(x,i,sizeof x)#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)#define maxn 1000010#define INF (ll)1e9#define MOD 1000000007typedef pair <vi, int> pvi;typedef pair <int,pi> ipi;typedef vector <pii> vpii;int N;unordered_set <int> st[maxn];int d[maxn];int maxD;unordered_set <int> adj[maxn]; vpi all_edges;int p[6][maxn];int edges[6][maxn], sz[6][maxn];unordered_set <int> cycles[maxn];vi pos;int fl(int i, int x){ if (p[i][x] == x) return x; return p[i][x] = fl(i, p[i][x]);} void add(int i, int A, int B){ edges[i][fl(i,B)]++; if (fl(i, A) != fl(i,B)){ int pA = fl(i,A), pB = fl(i,B); sz[i][pB] += sz[i][pA]; edges[i][pB] += edges[i][pA]; if (cycles[i].find(pA) != cycles[i].end()) cycles[i].erase(pA); p[i][pA] = pB; } if (edges[i][fl(i,B)] >= sz[i][fl(i,B)]) cycles[i].insert(fl(i,B));}int bigx;multiset <int> degrees;void Init(int N_) { N = N_; maxD = 0; FOR(i,0,5) FOR(j,0,N-1) p[i][j] = j,sz[i][j] = 1; FOR(i,0,N-1) st[0].insert(i); FOR(i,0,N-1) degrees.insert(0); bigx = -1;}void Link(int A, int B) { st[d[A]].erase(A); st[d[B]].erase(B); degrees.erase(degrees.find(d[A])); degrees.erase(degrees.find(d[B])); d[A]++; d[B]++; st[d[A]].insert(A); st[d[B]].insert(B); degrees.insert(d[A]); degrees.insert(d[B]); assert(!adj[A].count(B) && !adj[B].count(A)); adj[A].insert(B); adj[B].insert(A); if (pos.empty() && (d[A] == 3 || d[B] == 3)){ if (d[A] == 3){ aFOR(i, adj[A]) pos.pb(i); pos.pb(A); }else if (d[B] == 3){ pos.pb(B); aFOR(i, adj[B]) pos.pb(i); } FOR(i,0,pos.size()-1){ aFOR(j, all_edges) if (j.f != pos[i] && j.s != pos[i]) add(i,j.f,j.s); } assert(pos.size() == 4); } if (bigx == -1 && (d[A] >= 4 || d[B] >= 4)){ if (d[A] >= 4) bigx = A; else if (d[B] >= 4) bigx = B; aFOR(i, all_edges) if (i.f != bigx && i.s != bigx) add(4,i.f,i.s); } all_edges.pb(pi(A,B)); maxD = max({maxD, d[A], d[B]}); add(5,A,B); FOR(i,0,pos.size()-1) if (A != pos[i] && B != pos[i]) add(i,A,B); if (bigx != -1 && A != bigx && B != bigx) add(4, A, B);} int CountCritical() { if (maxD >= 4){ if (*(----degrees.end()) >= 4) return 0; if (st[maxD].size() == 1){ int x = *st[maxD].begin(); bool no = 0; if (!cycles[4].empty()) no = 1; aFOR(i, st[3]) if (find(all(adj[x]),i) == adj[x].end()) no = 1; if (no) return 0; return 1; }else return 0; }else if (maxD <= 1) return N; else if (maxD == 3){ if (st[3].size() > 4) return 0; int ans = 0; /* FOR(i,0,N-1){ cout << "ADJ " << i << ": "; aFOR(j, adj[i]) cout << j << ' '; cout << '\n'; } cout << "POS: "; aFOR(i, pos) cout << i << ' '; cout << '\n'; */ aFOR(i, pos){ bool no = 0; aFOR(j, st[3]) if (pos[i] != j && find(all(adj[pos[i]]), j) == adj[pos[i]].end()){ //cout << "NO " << pos[i] << ' ' << j << '\n'; no = 1; break; } if (no) continue; if (cycles[i].empty()){ //cout << "! " << i << '\n'; ans++; } } return ans; }else{ if (cycles[5].size() == 0) return N; else if (cycles[5].size() == 1) return sz[5][fl(5,*cycles[5].begin())]; else return 0; }}using namespace std; typedef long long ll;typedef pair<int,int> pi;typedef vector <int> vi;typedef vector <pi> vpi;typedef pair<pi, ll> pii;typedef set <ll> si;typedef long double ld;#define f first#define s second#define mp make_pair#define FOR(i,s,e) for(int i=s;i<=int(e);++i)#define DEC(i,s,e) for(int i=s;i>=int(e);--i)#define pb push_back#define all(x) (x).begin(), (x).end()#define lbd(x, y) lower_bound(all(x), y)#define ubd(x, y) upper_bound(all(x), y)#define aFOR(i,x) for (auto i: x)#define mem(x,i) memset(x,i,sizeof x)#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)#define maxn 1000010#define INF (ll)1e9#define MOD 1000000007typedef pair <vi, int> pvi;typedef pair <int,pi> ipi;typedef vector <pii> vpii;int N;unordered_set <int> st[maxn];int d[maxn];int maxD;unordered_set <int> adj[maxn]; vpi all_edges;int p[6][maxn];int edges[6][maxn], sz[6][maxn];unordered_set <int> cycles[maxn];vi pos;int fl(int i, int x){ if (p[i][x] == x) return x; return p[i][x] = fl(i, p[i][x]);} void add(int i, int A, int B){ edges[i][fl(i,B)]++; if (fl(i, A) != fl(i,B)){ int pA = fl(i,A), pB = fl(i,B); sz[i][pB] += sz[i][pA]; edges[i][pB] += edges[i][pA]; if (cycles[i].find(pA) != cycles[i].end()) cycles[i].erase(pA); p[i][pA] = pB; } if (edges[i][fl(i,B)] >= sz[i][fl(i,B)]) cycles[i].insert(fl(i,B));}int bigx;multiset <int> degrees;void Init(int N_) { N = N_; maxD = 0; FOR(i,0,5) FOR(j,0,N-1) p[i][j] = j,sz[i][j] = 1; FOR(i,0,N-1) st[0].insert(i); FOR(i,0,N-1) degrees.insert(0); bigx = -1;}void Link(int A, int B) { st[d[A]].erase(A); st[d[B]].erase(B); degrees.erase(degrees.find(d[A])); degrees.erase(degrees.find(d[B])); d[A]++; d[B]++; st[d[A]].insert(A); st[d[B]].insert(B); degrees.insert(d[A]); degrees.insert(d[B]); assert(!adj[A].count(B) && !adj[B].count(A)); adj[A].insert(B); adj[B].insert(A); if (pos.empty() && (d[A] == 3 || d[B] == 3)){ if (d[A] == 3){ aFOR(i, adj[A]) pos.pb(i); pos.pb(A); }else if (d[B] == 3){ pos.pb(B); aFOR(i, adj[B]) pos.pb(i); } FOR(i,0,pos.size()-1){ aFOR(j, all_edges) if (j.f != pos[i] && j.s != pos[i]) add(i,j.f,j.s); } assert(pos.size() == 4); } if (bigx == -1 && (d[A] >= 4 || d[B] >= 4)){ if (d[A] >= 4) bigx = A; else if (d[B] >= 4) bigx = B; aFOR(i, all_edges) if (i.f != bigx && i.s != bigx) add(4,i.f,i.s); } all_edges.pb(pi(A,B)); maxD = max({maxD, d[A], d[B]}); add(5,A,B); FOR(i,0,pos.size()-1) if (A != pos[i] && B != pos[i]) add(i,A,B); if (bigx != -1 && A != bigx && B != bigx) add(4, A, B);} int CountCritical() { if (maxD >= 4){ if (*(----degrees.end()) >= 4) return 0; if (st[maxD].size() == 1){ int x = *st[maxD].begin(); bool no = 0; if (!cycles[4].empty()) no = 1; aFOR(i, st[maxD]) if (find(all(adj[x]),i) == adj[x].end()) no = 1; if (no) return 0; return 1; }else return 0; }else if (maxD <= 1) return N; else if (maxD == 3){ if (st[3].size() > 4) return 0; int ans = 0; /* FOR(i,0,N-1){ cout << "ADJ " << i << ": "; aFOR(j, adj[i]) cout << j << ' '; cout << '\n'; } cout << "POS: "; aFOR(i, pos) cout << i << ' '; cout << '\n'; */ aFOR(i, pos){ bool no = 0; aFOR(j, st[3]) if (pos[i] != j && find(all(adj[pos[i]]), j) == adj[pos[i]].end()){ //cout << "NO " << pos[i] << ' ' << j << '\n'; no = 1; break; } if (no) continue; if (cycles[i].empty()){ //cout << "! " << i << '\n'; ans++; } } return ans; }else{ if (cycles[5].size() == 0) return N; else if (cycles[5].size() == 1) return sz[5][fl(5,*cycles[5].begin())]; else return 0; }}using namespace std; typedef long long ll;typedef pair<int,int> pi;typedef vector <int> vi;typedef vector <pi> vpi;typedef pair<pi, ll> pii;typedef set <ll> si;typedef long double ld;#define f first#define s second#define mp make_pair#define FOR(i,s,e) for(int i=s;i<=int(e);++i)#define DEC(i,s,e) for(int i=s;i>=int(e);--i)#define pb push_back#define all(x) (x).begin(), (x).end()#define lbd(x, y) lower_bound(all(x), y)#define ubd(x, y) upper_bound(all(x), y)#define aFOR(i,x) for (auto i: x)#define mem(x,i) memset(x,i,sizeof x)#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)#define maxn 1000010#define INF (ll)1e9#define MOD 1000000007typedef pair <vi, int> pvi;typedef pair <int,pi> ipi;typedef vector <pii> vpii;int N;unordered_set <int> st[maxn];int d[maxn];int maxD;unordered_set <int> adj[maxn]; vpi all_edges;int p[6][maxn];int edges[6][maxn], sz[6][maxn];unordered_set <int> cycles[maxn];vi pos;int fl(int i, int x){ if (p[i][x] == x) return x; return p[i][x] = fl(i, p[i][x]);} void add(int i, int A, int B){ edges[i][fl(i,B)]++; if (fl(i, A) != fl(i,B)){ int pA = fl(i,A), pB = fl(i,B); sz[i][pB] += sz[i][pA]; edges[i][pB] += edges[i][pA]; if (cycles[i].find(pA) != cycles[i].end()) cycles[i].erase(pA); p[i][pA] = pB; } if (edges[i][fl(i,B)] >= sz[i][fl(i,B)]) cycles[i].insert(fl(i,B));}int bigx;multiset <int> degrees;void Init(int N_) { N = N_; maxD = 0; FOR(i,0,5) FOR(j,0,N-1) p[i][j] = j,sz[i][j] = 1; FOR(i,0,N-1) st[0].insert(i); FOR(i,0,N-1) degrees.insert(0); bigx = -1;}void Link(int A, int B) { st[d[A]].erase(A); st[d[B]].erase(B); degrees.erase(degrees.find(d[A])); degrees.erase(degrees.find(d[B])); d[A]++; d[B]++; st[d[A]].insert(A); st[d[B]].insert(B); degrees.insert(d[A]); degrees.insert(d[B]); assert(!adj[A].count(B) && !adj[B].count(A)); adj[A].insert(B); adj[B].insert(A); if (pos.empty() && (d[A] == 3 || d[B] == 3)){ if (d[A] == 3){ aFOR(i, adj[A]) pos.pb(i); pos.pb(A); }else if (d[B] == 3){ pos.pb(B); aFOR(i, adj[B]) pos.pb(i); } FOR(i,0,pos.size()-1){ aFOR(j, all_edges) if (j.f != pos[i] && j.s != pos[i]) add(i,j.f,j.s); } assert(pos.size() == 4); } if (bigx == -1 && (d[A] >= 4 || d[B] >= 4)){ if (d[A] >= 4) bigx = A; else if (d[B] >= 4) bigx = B; aFOR(i, all_edges) if (i.f != bigx && i.s != bigx) add(4,i.f,i.s); } all_edges.pb(pi(A,B)); maxD = max({maxD, d[A], d[B]}); add(5,A,B); FOR(i,0,pos.size()-1) if (A != pos[i] && B != pos[i]) add(i,A,B); if (bigx != -1 && A != bigx && B != bigx) add(4, A, B);} int CountCritical() { if (maxD >= 4){ if (*(----degrees.end()) >= 4) return 0; if (st[maxD].size() == 1){ int x = *st[maxD].begin(); bool no = 0; if (!cycles[4].empty()) no = 1; aFOR(i, st[maxD]) if (find(all(adj[x]),i) == adj[x].end()) no = 1; if (no) return 0; return 1; }else return 0; }else if (maxD <= 1) return N; else if (maxD == 3){ if (st[3].size() > 4) return 0; int ans = 0; /* FOR(i,0,N-1){ cout << "ADJ " << i << ": "; aFOR(j, adj[i]) cout << j << ' '; cout << '\n'; } cout << "POS: "; aFOR(i, pos) cout << i << ' '; cout << '\n'; */ aFOR(i, pos){ bool no = 0; aFOR(j, st[3]) if (pos[i] != j && find(all(adj[pos[i]]), j) == adj[pos[i]].end()){ //cout << "NO " << pos[i] << ' ' << j << '\n'; no = 1; break; } if (no) continue; if (cycles[i].empty()){ //cout << "! " << i << '\n'; ans++; } } return ans; }else{ if (cycles[5].size() == 0) return N; else if (cycles[5].size() == 1) return sz[5][fl(5,*cycles[5].begin())]; else return 0; }}