oj.uz

Submission #59650

# Submission time Handle Problem Language Result Execution time Memory
59650 2018-07-22T20:43:38 Z Benq File Paths (BOI15_fil) C++11
0 / 100
 4 ms 872 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 6001;

int n,m,k,s,l[MX];
vi child[MX];
bitset<MX> ans;
bitset<1000001> root;

int ok = 0;

void dfs0(int x, int cdepth) {
    cdepth += l[x];
    if (cdepth <= k) root[cdepth] = 1;
    for (int i: child[x]) dfs0(i,cdepth);
}

void dfs1(int x, int cdepth) {
    cdepth += l[x];
    if (cdepth <= k && root[k-cdepth]) ok ++;
    if (ok) ans[x] = 1;
    for (int i: child[x]) dfs1(i,cdepth);
    if (cdepth <= k && root[k-cdepth]) ok --;
}

void case1() {
    dfs0(0,0);
    if (root[k]) ok ++;
    dfs1(1,0);
}

void dfs2() {
    
}

void case2() {
    // case 2: path from root to x, cycle starting on path from root to x 
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> k >> s; s ++;
    FOR(i,1,n+1) {
        int p; cin >> p >> l[i]; l[i] ++;
        child[p].pb(i);
    }
    FOR(i,n+1,n+m+1) {
        int p; cin >> p >> l[i]; l[i] ++;
        child[p].pb(i);
    }
    case1();
    case2();
    FOR(i,n+1,n+m+1) {
        if (ans[i]) cout << "YES";
        else cout << "NO";
        cout << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 872 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -