제출 #421565

#제출 시각아이디문제언어결과실행 시간메모리
421565alishahali1382늑대인간 (IOI18_werewolf)C++14
100 / 100
1959 ms146032 KiB
#include "werewolf.h" #include<bits/stdc++.h> #pragma GCC optimize ("O2") using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; #define debug(x) {cerr<<#x<<"="<<x<<"\n";} #define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";} #define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";} #define debugv(abcd) {cerr<<#abcd<<": ";for (auto dcba:abcd) cerr<<dcba<<", "; cerr<<"\n";} #define pb push_back #define SZ(x) ((int)x.size()) #define all(x) x.begin(), x.end() const int inf=1000001000; // 1e9 const ll INF=10000000010000000ll; // 1e16 const int mod=1000000007; const int MAXN=300010, LOG=18; int n, m, k, x, y, u, v, timer, ans; int par1[LOG][MAXN]; int par2[LOG][MAXN]; int dsu[MAXN]; int stt1[MAXN], fnt1[MAXN]; int stt2[MAXN], fnt2[MAXN]; vector<int> G[MAXN]; vector<int> seg[MAXN<<2]; int getpar(int x){ return (dsu[x]==x?x:dsu[x]=getpar(dsu[x]));} void dfs1(int node, int stt[], int fnt[]){ stt[node]=timer++; for (int v:G[node]) dfs1(v, stt, fnt); fnt[node]=timer; } void Add(int id, int tl, int tr, int pos, int val){ if (pos<tl || tr<=pos) return ; seg[id].pb(val); if (tr-tl==1) return ; int mid=(tl+tr)>>1; Add(id<<1, tl, mid, pos, val); Add(id<<1 | 1, mid, tr, pos, val); } int Get(int id, int tl, int tr, int l, int r, int val){ if (r<=tl || tr<=l) return inf; if (l<=tl && tr<=r) return *lower_bound(all(seg[id]), val); int mid=(tl+tr)>>1; return min(Get(id<<1, tl, mid, l, r, val), Get(id<<1 | 1, mid, tr, l, r, val)); } bool Solve(int y, int x, int l, int r){ // go from y to x for (int i=LOG-1; ~i; i--) if (par1[i][x] && par1[i][x]<=r) x=par1[i][x]; for (int i=LOG-1; ~i; i--) if (par2[i][y] && par2[i][y]>=l) y=par2[i][y]; return Get(1, 1, n+1, stt1[x], fnt1[x], stt2[y])<fnt2[y]; } vi check_validity(int _n, vi X, vi Y, vi S, vi E, vi L, vi R){ n=_n; m=SZ(X); while (m--){ int u=X[m], v=Y[m]; u++; v++; G[u].pb(v); G[v].pb(u); } iota(dsu+1, dsu+n+1, 1); for (int i=1; i<=n; i++){ for (int j:G[i]) if (j<i){ int x=getpar(j); if (x==i) continue ; par1[0][x]=i; dsu[x]=i; } } iota(dsu+1, dsu+n+1, 1); for (int i=n; i; i--){ for (int j:G[i]) if (j>i){ int x=getpar(j); if (x==i) continue ; // debug2(x, i) par2[0][x]=i; dsu[x]=i; } } for (int i=1; i<=n; i++) G[i].clear(); for (int i=1; i<n; i++) G[par1[0][i]].pb(i); timer=1; dfs1(n, stt1, fnt1); for (int i=1; i<=n; i++) G[i].clear(); for (int i=2; i<=n; i++) G[par2[0][i]].pb(i); timer=1; dfs1(1, stt2, fnt2); for (int j=1; j<LOG; j++) for (int i=1; i<=n; i++){ par1[j][i]=par1[j-1][par1[j-1][i]]; par2[j][i]=par2[j-1][par2[j-1][i]]; } for (int i=1; i<=n; i++) Add(1, 1, n+1, stt1[i], stt2[i]); for (int i=1; i<4*MAXN; i++) sort(all(seg[i])), seg[i].pb(inf); m=SZ(S); vi out(m, 0); for (int i=0; i<m; i++) out[i]=Solve(S[i]+1, E[i]+1, L[i]+1, R[i]+1); return out; } /* 6 6 3 5 1 1 2 1 3 3 4 3 0 5 2 4 2 1 2 4 2 2 2 5 4 3 4 6 6 1 5 1 1 2 1 3 3 4 3 0 5 2 4 2 1 2 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...