Submission #1018307

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018307		vjudge1	Werewolf (IOI18_werewolf)	C++17	15 / 100	4054 ms	23480 KiB

werewolf

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("popcnt")
#define endl '\n'
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
#define pq_min(a) priority_queue<a, vector<a>, greater<a>>
#define fls cout.flush()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using ii = pair<int,int>;
using mii = map<int,int>;
using lld = long double;
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
vi check_validity(int N, vi X, vi Y,vi S, vi E,vi L, vi R) {
    int Q = S.size(), M = sz(X);
    vi ans(Q,0);
    vector<vi> graph(N);
    fo(i,M)graph[X[i]].pb(Y[i]),graph[Y[i]].pb(X[i]);
    fo(i, Q){
        int l = L[i], r = R[i];
        vi ra(N, 0), rb(N, 0);
        queue<int> q;
        if(S[i] >= l)q.push(S[i]), ra[S[i]]=1;
        while(!q.empty()){
            int nodo = q.front();q.pop();
            for(int v : graph[nodo]){
                if(ra[v]==0&&v>=l){
                    q.push(v);
                    ra[v] = 1;
                }
            }
        }
        if(E[i] <= r)q.push(E[i]), rb[E[i]]=1;
        while(!q.empty()){
            int nodo = q.front();q.pop();
            for(int v : graph[nodo]){
                if(rb[v]==0&&v<=r){
                    q.push(v);
                    rb[v]=1;
                }
            }
        }
        fo(j,N)
            if(ra[j]&&rb[j])
                ans[i]=1;
    }
    return ans;
}

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