// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN NEEDED)\
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")\
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// -------------------</optimizations>--------------------
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
// ---------------</Headers and namespaces>---------------
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
typedef long double LD;
typedef long long ll;
// #define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name".in", "r", stdin); \
freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// ----------------</Defines and typedefs>----------------
// -------------------<Debugging stuff>-------------------
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
// ------------------</Debugging stuff>-------------------
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
// ------------------------</RNG>-------------------------
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
const int FACSZ = 1; // Make sure to change this
int fact[FACSZ],ifact[FACSZ];
void precom(int c = MOD){
fact[0] = 1;
FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
REPD(i,FACSZ-1){
ifact[i] = mul(i+1,ifact[i+1],c);
}
}
int ncr(int n,int r,int c = MOD){
return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
}
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
int N,M;
vi adj[200005];
int dsu[2][200005];
vi g[2][200005];
int par[2][200005][21];
int find(int idx,int u){
if(dsu[idx][u] == u) return u;
return dsu[idx][u] = find(idx,dsu[idx][u]);
}
vi v1,v2;
vi euler[2];
int tim;
pii pos[2][200005];
vi seg[400005];
void dfs(int idx,int u,int p){
pos[idx][u].F = tim++;
euler[idx].pb(u);
par[idx][u][0] = p;
for(auto v:g[idx][u]){
if(v != p) dfs(idx,v,u);
}
pos[idx][u].S = tim;
}
void dfs1(int u){
v1.pb(u);
for(auto v:g[0][u]) if(v != par[0][u][0]) dfs1(v);
}
void dfs2(int u){
v2.pb(u);
for(auto v:g[1][u]) if(v != par[1][u][0]) dfs2(v);
}
int query(int l,int r,int l1,int r1){
l += N;
r += N;
while(l < r){
if(l%2){
int ind = lower_bound(all(seg[l]),l1)-seg[l].begin();
if(ind != seg[l].size() and seg[l][ind] < r1) return 1;
l++;
}
if(r%2){
--r;
int ind = lower_bound(all(seg[r]),l1)-seg[r].begin();
if(ind != seg[r].size() and seg[r][ind] < r1) return 1;
}
l /= 2;
r /= 2;
}
return 0;
}
vi check_validity(int n, vi X, vi Y, vi S, vi E, vi L, vi R){
N = n;
M = X.size();
REP(i,M){
X[i]++;
Y[i]++;
adj[X[i]].pb(Y[i]);
adj[Y[i]].pb(X[i]);
}
FOR(i,1,N+1){
dsu[0][i] = dsu[1][i] = i;
}
FORD(i,N,1){
for(auto u:adj[i]){
if(u > i){
u = find(0,u);
if(i == u) continue;
dsu[0][u] = i;
g[0][u].pb(i);
g[0][i].pb(u);
}
}
}
FOR(i,1,N+1){
for(auto u:adj[i]){
if(u < i){
u = find(1,u);
if(i == u) continue;
dsu[1][u] = i;
g[1][u].pb(i);
g[1][i].pb(u);
}
}
}
tim = 0;
dfs(0,1,1);
tim = 0;
dfs(1,N,N);
REP(i,euler[1].size()){
euler[1][i] = pos[0][euler[1][i]].F;
}
// FOR(i,1,N+1){
// trace(i,par[0][i][0],par[1][i][0]);
// }
FOR(j,1,21){
FOR(i,1,N+1){
par[0][i][j] = par[0][par[0][i][j-1]][j-1];
par[1][i][j] = par[1][par[1][i][j-1]][j-1];
}
}
vi ans;
REP(i,N){
seg[i+N].pb(euler[1][i]);
}
FORD(i,N-1,1){
for(auto x:seg[2*i]) seg[i].pb(x);
for(auto x:seg[2*i+1]) seg[i].pb(x);
sort(all(seg[i]));
}
REP(i,S.size()){
S[i]++;
E[i]++;
L[i]++;
R[i]++;
int u = S[i],v = E[i];
// trace(u,v);
FORD(j,20,0){
// trace(u,j,par[0][u][j]);
// trace(v,j,par[1][v][j]);
if(par[0][u][j] >= L[i]) u = par[0][u][j];
if(par[1][v][j] <= R[i]) v = par[1][v][j];
}
ans.pb(query(pos[1][v].F,pos[1][v].S,pos[0][u].F,pos[0][u].S));
}
return ans;
}
// signed main(){
// vi mkc = check_validity(6, {5, 1, 1, 3, 3, 5}, {1, 2, 3, 4, 0, 2},{4, 4, 5}, {2, 2, 4}, {1, 2, 3}, {2,2,4});
// for(auto x:mkc) pfi(x)
// }
Compilation message
werewolf.cpp:4:1: warning: multi-line comment [-Wcomment]
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
^
werewolf.cpp:6:1: warning: multi-line comment [-Wcomment]
//(UNCOMMENT WHEN NEEDED)\
^
werewolf.cpp:56:1: warning: multi-line comment [-Wcomment]
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
^
werewolf.cpp: In function 'int query(int, int, int, int)':
werewolf.cpp:254:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(ind != seg[l].size() and seg[l][ind] < r1) return 1;
~~~~^~~~~~~~~~~~~~~~
werewolf.cpp:260:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(ind != seg[r].size() and seg[r][ind] < r1) return 1;
~~~~^~~~~~~~~~~~~~~~
werewolf.cpp: In function 'vi check_validity(int, vi, vi, vi, vi, vi, vi)':
werewolf.cpp:66:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define REP(i,n) for (int i = 0; i < n; i++)
werewolf.cpp:306:6:
REP(i,euler[1].size()){
~~~~~~~~~~~~~~~~~
werewolf.cpp:306:2: note: in expansion of macro 'REP'
REP(i,euler[1].size()){
^~~
werewolf.cpp:66:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define REP(i,n) for (int i = 0; i < n; i++)
werewolf.cpp:327:6:
REP(i,S.size()){
~~~~~~~~~~
werewolf.cpp:327:2: note: in expansion of macro 'REP'
REP(i,S.size()){
^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 2 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 3 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 4 |
Correct |
20 ms |
23808 KB |
Output is correct |
| 5 |
Correct |
20 ms |
23928 KB |
Output is correct |
| 6 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 7 |
Correct |
22 ms |
23936 KB |
Output is correct |
| 8 |
Correct |
21 ms |
23936 KB |
Output is correct |
| 9 |
Correct |
21 ms |
23936 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 2 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 3 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 4 |
Correct |
20 ms |
23808 KB |
Output is correct |
| 5 |
Correct |
20 ms |
23928 KB |
Output is correct |
| 6 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 7 |
Correct |
22 ms |
23936 KB |
Output is correct |
| 8 |
Correct |
21 ms |
23936 KB |
Output is correct |
| 9 |
Correct |
21 ms |
23936 KB |
Output is correct |
| 10 |
Correct |
29 ms |
25336 KB |
Output is correct |
| 11 |
Correct |
27 ms |
25344 KB |
Output is correct |
| 12 |
Correct |
27 ms |
25344 KB |
Output is correct |
| 13 |
Correct |
28 ms |
25472 KB |
Output is correct |
| 14 |
Correct |
28 ms |
25472 KB |
Output is correct |
| 15 |
Correct |
30 ms |
25408 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
898 ms |
119788 KB |
Output is correct |
| 2 |
Correct |
841 ms |
121836 KB |
Output is correct |
| 3 |
Correct |
809 ms |
119656 KB |
Output is correct |
| 4 |
Correct |
888 ms |
118504 KB |
Output is correct |
| 5 |
Correct |
914 ms |
125804 KB |
Output is correct |
| 6 |
Correct |
954 ms |
125672 KB |
Output is correct |
| 7 |
Correct |
891 ms |
125548 KB |
Output is correct |
| 8 |
Correct |
815 ms |
128620 KB |
Output is correct |
| 9 |
Correct |
824 ms |
126572 KB |
Output is correct |
| 10 |
Correct |
671 ms |
125804 KB |
Output is correct |
| 11 |
Correct |
710 ms |
125668 KB |
Output is correct |
| 12 |
Correct |
865 ms |
125544 KB |
Output is correct |
| 13 |
Correct |
947 ms |
130028 KB |
Output is correct |
| 14 |
Correct |
924 ms |
129896 KB |
Output is correct |
| 15 |
Correct |
915 ms |
130020 KB |
Output is correct |
| 16 |
Correct |
925 ms |
129960 KB |
Output is correct |
| 17 |
Correct |
870 ms |
125420 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 2 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 3 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 4 |
Correct |
20 ms |
23808 KB |
Output is correct |
| 5 |
Correct |
20 ms |
23928 KB |
Output is correct |
| 6 |
Correct |
20 ms |
23936 KB |
Output is correct |
| 7 |
Correct |
22 ms |
23936 KB |
Output is correct |
| 8 |
Correct |
21 ms |
23936 KB |
Output is correct |
| 9 |
Correct |
21 ms |
23936 KB |
Output is correct |
| 10 |
Correct |
29 ms |
25336 KB |
Output is correct |
| 11 |
Correct |
27 ms |
25344 KB |
Output is correct |
| 12 |
Correct |
27 ms |
25344 KB |
Output is correct |
| 13 |
Correct |
28 ms |
25472 KB |
Output is correct |
| 14 |
Correct |
28 ms |
25472 KB |
Output is correct |
| 15 |
Correct |
30 ms |
25408 KB |
Output is correct |
| 16 |
Correct |
898 ms |
119788 KB |
Output is correct |
| 17 |
Correct |
841 ms |
121836 KB |
Output is correct |
| 18 |
Correct |
809 ms |
119656 KB |
Output is correct |
| 19 |
Correct |
888 ms |
118504 KB |
Output is correct |
| 20 |
Correct |
914 ms |
125804 KB |
Output is correct |
| 21 |
Correct |
954 ms |
125672 KB |
Output is correct |
| 22 |
Correct |
891 ms |
125548 KB |
Output is correct |
| 23 |
Correct |
815 ms |
128620 KB |
Output is correct |
| 24 |
Correct |
824 ms |
126572 KB |
Output is correct |
| 25 |
Correct |
671 ms |
125804 KB |
Output is correct |
| 26 |
Correct |
710 ms |
125668 KB |
Output is correct |
| 27 |
Correct |
865 ms |
125544 KB |
Output is correct |
| 28 |
Correct |
947 ms |
130028 KB |
Output is correct |
| 29 |
Correct |
924 ms |
129896 KB |
Output is correct |
| 30 |
Correct |
915 ms |
130020 KB |
Output is correct |
| 31 |
Correct |
925 ms |
129960 KB |
Output is correct |
| 32 |
Correct |
870 ms |
125420 KB |
Output is correct |
| 33 |
Correct |
1076 ms |
126728 KB |
Output is correct |
| 34 |
Correct |
384 ms |
55932 KB |
Output is correct |
| 35 |
Correct |
1121 ms |
129004 KB |
Output is correct |
| 36 |
Correct |
1027 ms |
126188 KB |
Output is correct |
| 37 |
Correct |
1132 ms |
128372 KB |
Output is correct |
| 38 |
Correct |
1063 ms |
126756 KB |
Output is correct |
| 39 |
Correct |
1238 ms |
134936 KB |
Output is correct |
| 40 |
Correct |
1107 ms |
134808 KB |
Output is correct |
| 41 |
Correct |
954 ms |
127856 KB |
Output is correct |
| 42 |
Correct |
804 ms |
126184 KB |
Output is correct |
| 43 |
Correct |
1073 ms |
132832 KB |
Output is correct |
| 44 |
Correct |
1080 ms |
128364 KB |
Output is correct |
| 45 |
Correct |
970 ms |
135008 KB |
Output is correct |
| 46 |
Correct |
988 ms |
134700 KB |
Output is correct |
| 47 |
Correct |
998 ms |
130104 KB |
Output is correct |
| 48 |
Correct |
996 ms |
129908 KB |
Output is correct |
| 49 |
Correct |
980 ms |
130028 KB |
Output is correct |
| 50 |
Correct |
946 ms |
129896 KB |
Output is correct |
| 51 |
Correct |
1047 ms |
135484 KB |
Output is correct |
| 52 |
Correct |
1058 ms |
135404 KB |
Output is correct |
