Submission #369335

#	Time	Username	Problem	Language	Result	Execution time	Memory
369335		ACmachine	File Paths (BOI15_fil)	C++17	100 / 100	573 ms	5484 KiB

fil

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
 
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
 
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
 
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const unordered_set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
 
    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m, k;
    cin >> n >> m >> k;
    int s; cin >> s; 
    vector<vector<array<int, 2>>> g(n + 1 + m);
    vector<int> par(n + m + 1, -1);
    FOR(i, 1, n + 1, 1){
        int p, l;
        cin >> p >> l;
        g[p].pb({i, l + 1});
        g[i].pb({p, l + 1});
        par[i] = p;
        //cout << i << " " << p << "\n";
    }
    FOR(i, n + 1, n + 1 + m, 1){
        int p, l;
        cin >> p >> l;
        g[p].pb({i, l + 1});
        g[i].pb({p, l + 1});
        par[i] = p;
        //cout << i << " " << p << "\n";
    }
    vector<int> ans(m, 0); 
    // no symlink case; + 1 symlink
    vector<int> dist_pre(n + m + 1, 0);
    function<void(int, int, int)> dfs1 = [&](int v, int p, int d){
        dist_pre[v] = d;
        if(v > n){
            if(d == k){
                ans[v - (n + 1)] = 1;
            }
        }
        for(auto x : g[v]){
            if(x[0] == p) continue;
            dfs1(x[0], v, d + x[1]); 
        }
    };
    dfs1(0, -1, 0);
    vector<int> is_dist_pre(1e6 + 6, 0);
    REP(i, n + 1) is_dist_pre[dist_pre[i]] = 1;
    vector<int> distcurr;
    function<void(int, int)> dfs2 = [&](int v, int p){
        distcurr.pb(dist_pre[v]);
        if(v > n){
            for(int val : distcurr){
                int suff = dist_pre[v] - val;
                if(suff == 0) continue;
                if((k - (suff + s + 1)) >= 0 && is_dist_pre[k - (suff + s + 1)])
                    ans[v - (n + 1)] = 1;
            }
        }
        for(auto x : g[v]){
            if(x[0] == p) continue;
            dfs2(x[0], v);
        }
        distcurr.pop_back(); 
    };
    dfs2(0, -1);
    vector<bool> is_pred(2e6 + 6, false);
    auto solve3 = [&](int v){
        vector<bool> is_on_path(n + m + 1, false);
        int tm = v;
        while(tm != -1){
            is_on_path[tm] = true;
            tm = par[tm];
        }
        int want = k - dist_pre[v];
        unordered_set<int> div;
        for(ll i = 1; i * i <= want; i++){
            if(want%i == 0){
                div.insert(i);
                div.insert(want / i);
            }
        }
        unordered_set<int> pred;
        vector<int> st;
        tm = v;
        while(tm != -1){
            st.pb(tm);
            tm = par[tm];
        }
        reverse(all(st));
        auto check = [&](int d){
            for(int dv : div){
                if(d + s + 1 - dv >= 0 && is_pred[d + s + 1 - dv])
                    return true; 
            }
            return false;
        };
        function<void(int, int)> dfs3 = [&](int ver, int p){
            if(ver > n) return;
            if(check(dist_pre[ver])) ans[v - (n + 1)] =1;
            for(auto x : g[ver]){
                if(x[0] == p) continue;
                dfs3(x[0], ver);
            }
        };
        for(int vert : st){
            if(vert == v) continue;
            is_pred[dist_pre[vert]] = true;
            if(check(dist_pre[vert])) ans[v - (n + 1)] = 1;
            for(auto x : g[vert]){
                if(x[0] == par[vert]) continue; 
                if(is_on_path[x[0]]) continue;
                dfs3(x[0], vert);
            }
        }
        for(int vert : st) 
            is_pred[dist_pre[vert]] = false;
    };
    FOR(i, n + 1, n + 1 + m, 1) solve3(i);
    REP(i, m){
        if(ans[i]){
            cout << "YES" << "\n";
        }
        else{
            cout << "NO" << "\n";
        }
    }
    
 
	
    return 0;
}

• Subtask 1: 33 / 33
• Subtask 2: 33 / 33
• Subtask 3: 34 / 34