Submission #987375

#	Time	Username	Problem	Language	Result	Execution time	Memory
987375		yeediot	Werewolf (IOI18_werewolf)	C++17	100 / 100	1606 ms	114580 KiB

werewolf

#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include "werewolf.h"
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#define why_TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn=2e5+5;
const int inf=1e9;
int n;
vector<int>adj2[mxn];
struct DSU{
    int to[mxn],num[mxn];
    void init(){
        for(int i=0;i<mxn;i++){
            to[i]=i;
            num[i]=1;
        }
    }
    int find(int x){
        return x==to[x]?x:to[x]=find(to[x]);
    }
}d;
struct tree{
    vector<int>adj[mxn];
    vector<tuple<int,int,int>>edges;
    int flg, jump[20][mxn], timer, in[mxn], out[mxn], ord[mxn];
    void dfs(int v,int pa){
        in[v]=++timer;
        ord[timer]=v;
        jump[0][v]=pa;
        for(auto u:adj[v]){
            if(u!=pa)dfs(u,v);
        }
        out[v]=timer;
    }
    void build(){
        for(int i=1;i<20;i++){
            for(int j=1;j<=n;j++){
                jump[i][j]=jump[i-1][jump[i-1][j]];
            }
        }
    }
    int find(int st,int x){
        if(flg){
            for(int i=19;i>=0;i--){
                if(jump[i][st]<=x){
                    st=jump[i][st];
                }
            }
        }
        else{
            for(int i=19;i>=0;i--){
                if(jump[i][st]>=x){
                    st=jump[i][st];
                }
            }
        }
        return st;
    }
}mn, mx;
vector<int>upd[mxn],ans;
vector<tuple<int,int,int>>in[mxn],out[mxn];
int bit[mxn];
void modify(int p){
    for(;p<=n;p+=p&-p){
        bit[p]++;
    }
}
int query(int p){
    int res=0;
    for(;p;p-=p&-p){
        res+=bit[p];
    }
    return res;
}
vi check_validity(int N,vi X,vi Y,vi S,vi E,vi L,vi R){
    n=N;
    ans.resize(sz(E));
    for(int i=0;i<sz(X);i++){
        int a=X[i],b=Y[i];
        a++;
        b++;
        adj2[a].pb(b);
        adj2[b].pb(a);
    }
    d.init();
    for(int x=n;x>=1;x--){
        for(auto y:adj2[x]){
            if(y<x)continue;
            int fx=d.find(y),fy=d.find(x);
            if(fx==fy)continue;
            mx.adj[fy].pb(fx);
            d.to[fx]=fy;
        }
    }
    d.init();
    for(int x=1;x<=n;x++){
        for(auto y:adj2[x]){
            if(y>x)continue;
            int fx=d.find(y),fy=d.find(x);
            if(fx==fy)continue;
            mn.adj[fy].pb(fx);
            d.to[fx]=fy;
        }
    }
    mn.dfs(n,n);
    mx.dfs(1,1);
    mn.flg=1;
    mx.flg=0;
    mn.build();
    mx.build();
    for(int i=1;i<=n;i++){
        upd[i].pb(mn.in[mx.ord[i]]);
    }
    for(int i=0;i<sz(S);i++){
        int s=S[i]+1,e=E[i]+1,l=L[i]+1,r=R[i]+1;
        int fs=mx.find(s,l),se=mn.find(e,r);
        in[mx.in[fs]].pb({mn.in[se],mn.out[se],i});
        out[mx.out[fs]].pb({mn.in[se],mn.out[se],i});
    }
    for(int i=1;i<=n;i++){
        for(auto [l,r,id]:in[i]){
            ans[id]-=query(r)-query(l-1);
        }
        for(auto p:upd[i]){
            modify(p);
        }
        for(auto [l,r,id]:out[i]){
            ans[id]+=query(r)-query(l-1);
        }
    }
    for(int i=0;i<sz(E);i++){
        if(ans[i])ans[i]=1;
    }
    return ans;
}
#ifdef local
int main(){
    why_TOI_is_so_de;
    int n, m, q;
    cin>>n>>m>>q;
    vi x(m),y(m),s(q),e(q),l(q),r(q);
    for(int i=0;i<m;i++){
        cin>>x[i]>>y[i];
    }
    for(int i=0;i<q;i++){
        cin>>s[i]>>e[i]>>l[i]>>r[i];
    }
    vi temp=check_validity(n,x,y,s,e,l,r);
    for(auto i:temp){
        cout<<i<<'\n';
    }
}
#endif
/*
input:
 [fx,fy] = [2, 3]
[fx,fy] = [3, 4]
[fx,fy] = [1, 4]
[fx,fy] = [4, 5]
[fx,fy] = [5, 6]
[fx,fy] = [5, 4]
[fx,fy] = [6, 3]
[fx,fy] = [3, 2]
[fx,fy] = [4, 2]
[fx,fy] = [2, 1]
*/

Compilation message (stderr)

werewolf.cpp: In function 'void setIO(std::string)':
werewolf.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
werewolf.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 34 / 34
• Subtask 4: 51 / 51