Submission #203954

#	Time	Username	Problem	Language	Result	Execution time	Memory
203954		LittleFlowers__	Werewolf (IOI18_werewolf)	C++14	15 / 100	342 ms	24312 KiB

werewolf

#include <bits/stdc++.h>
#include "werewolf.h"
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(false),cin.tie(nullptr);
#define task "werewolf"
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))

int cnt,cur;
int fre[100010];
vector<int> ad[100010];

void add(int u,queue<int>&q){
    q.push(u);
    cnt=cnt||fre[u]+1==cur&&!(cur&1);
    fre[u]=cur;
}

void bfs(int s,int l,int r){
    cur++; queue<int> q; add(s,q);
    while(q.size()){
        int u=q.front(); q.pop();
        forv(v,ad[u]) if(l<=v && v<=r && fre[v]<cur) add(v,q);
    }
}

vector<int> check_validity(int n, vector<int>x, vector<int>y, vector<int>s, vector<int>t, vector<int>l, vector<int>r){
    int m=x.size();
    forinc(i,0,m-1){
        ad[x[i]].pb(y[i]);
        ad[y[i]].pb(x[i]);
    }
    int q=s.size();
    vector<int> ret;
    forinc(i,0,q-1){
        if(s[i]<l[i] || t[i]>r[i]){
            ret.pb(0);
            continue;
        }
        cnt=0;
        bfs(t[i],0,r[i]);
        bfs(s[i],l[i],n-1);
        ret.pb(cnt);
    }
    return ret;
}
/**
main(){
    #define task "WEREWOLF"
    freopen(task".inp","r",stdin);
    freopen(task".ans","w",stdout);
    vector<int> x,y,st,ed,lf,rt;
    int n,m,q; cin>>n>>m>>q;
    forinc(i,1,m){
        x.pb(in),y.pb(in);
    }

    forinc(i,1,q){
        st.pb(in), ed.pb(in), lf.pb(in), rt.pb(in);
    }
    forv(i,check_validity(n,x,y,st,ed,lf,rt)) cout<<i;
}
*/

Compilation message (stderr)

werewolf.cpp: In function 'void add(int, std::queue<int>&)':
werewolf.cpp:29:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     cnt=cnt||fre[u]+1==cur&&!(cur&1);
              ~~~~~~~~~~~~~^~~~~~~~~~

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