oj.uz

Submission #30576

# Submission time Handle Problem Language Result Execution time Memory
30576 2017-07-25T03:10:49 Z sampriti File Paths (BOI15_fil) C++14
100 / 100
 416 ms 10460 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

int K, S;
vector<int> T[3001];
int dir_par[3001], dir_len[3001];
int sieve[1000001];
int val_cnt[1000001];
int D[3001];
set<int> D_set;
int file_par[3001], file_len[3001];
bool ans[3001];
vector<int> files_by_dir[3001];

void dfs_dist(int i, int d) {
  d += dir_len[i];
  D[i] = d;

  for(int u: T[i]) {
    dfs_dist(u, d);
  }
}

void add(int i, int d) {
  int len = d + S;
  if(len > 1000000) return;
  val_cnt[len]++;
  if(val_cnt[len] == 1) {
    for(int j = len; j <= 1000000; j += len) {
      sieve[j]++;
    }
  }
  for(int u: T[i]) {
    add(u, d + dir_len[u]);
  }
}

void remove(int i, int d) {
  for(int u: T[i]) {
    remove(u, d + dir_len[u]);
  }

  int len = d + S;
  if(len > 1000000) return;
  if(val_cnt[len] == 1) {
    for(int j = len; j <= 1000000; j += len) {
      sieve[j]--;
    }
  }
  val_cnt[len]--;
}

void dfs_solve_loop(int i) {
  add(i, 0);

  for(int q: files_by_dir[i]) {
    int req = K - file_len[q] - D[file_par[q]];
    if(req > 0 && sieve[req]) {
      ans[q] = true;
    }
  }

  for(int u: T[i]) {
    dfs_solve_loop(u);
  }

  remove(i, 0);
}

int main() {
  ios::sync_with_stdio(false); cin.tie(0);

  int N, M; cin >> N >> M >> K;
  cin >> S; S++;

  dir_par[0] = -1; dir_len[0] = 1;
  for(int i = 1; i <= N; i++) {
    cin >> dir_par[i] >> dir_len[i];
    dir_len[i]++;
    T[dir_par[i]].push_back(i);
  }

  for(int i = 1; i <= M; i++) {
    cin >> file_par[i] >> file_len[i];
  }

  dfs_dist(0, 0);
  for(int i = 0; i <= N; i++) D_set.insert(D[i]);

  for(int i = 1; i <= M; i++) {
    int req = K - file_len[i];

    if(D[file_par[i]] == req) {
      ans[i] = true;
      continue;
    }

    int j = file_par[i], len = 0;
    while(j != -1) {
      if(D_set.count(req - len - S)) {
        ans[i] = true;
        break;
      }
      len += dir_len[j];
      j = dir_par[j];
    }
  }

  for(int i = 1; i <= M; i++) {
    files_by_dir[file_par[i]].push_back(i);
  }

  dfs_solve_loop(0);

  for(int i = 1; i <= M; i++) {
    if(ans[i]) cout << "YES" << endl;
    else cout << "NO" << endl;
  }
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10196 KB Output is correct
2 Correct 0 ms 10196 KB Output is correct
3 Correct 0 ms 10196 KB Output is correct
4 Correct 13 ms 10196 KB Output is correct
5 Correct 9 ms 10196 KB Output is correct
6 Correct 3 ms 10196 KB Output is correct
7 Correct 13 ms 10196 KB Output is correct
8 Correct 0 ms 10196 KB Output is correct
9 Correct 0 ms 10196 KB Output is correct
10 Correct 3 ms 10196 KB Output is correct
11 Correct 26 ms 10196 KB Output is correct
12 Correct 43 ms 10196 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10328 KB Output is correct
2 Correct 6 ms 10328 KB Output is correct
3 Correct 6 ms 10328 KB Output is correct
4 Correct 6 ms 10328 KB Output is correct
5 Correct 289 ms 10460 KB Output is correct
6 Correct 296 ms 10460 KB Output is correct
7 Correct 176 ms 10460 KB Output is correct
8 Correct 259 ms 10460 KB Output is correct
9 Correct 9 ms 10328 KB Output is correct
10 Correct 3 ms 10328 KB Output is correct
11 Correct 163 ms 10328 KB Output is correct
12 Correct 279 ms 10460 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10196 KB Output is correct
2 Correct 0 ms 10196 KB Output is correct
3 Correct 0 ms 10196 KB Output is correct
4 Correct 13 ms 10196 KB Output is correct
5 Correct 9 ms 10196 KB Output is correct
6 Correct 3 ms 10196 KB Output is correct
7 Correct 13 ms 10196 KB Output is correct
8 Correct 0 ms 10196 KB Output is correct
9 Correct 0 ms 10196 KB Output is correct
10 Correct 3 ms 10196 KB Output is correct
11 Correct 26 ms 10196 KB Output is correct
12 Correct 43 ms 10196 KB Output is correct
13 Correct 6 ms 10328 KB Output is correct
14 Correct 6 ms 10328 KB Output is correct
15 Correct 6 ms 10328 KB Output is correct
16 Correct 6 ms 10328 KB Output is correct
17 Correct 289 ms 10460 KB Output is correct
18 Correct 296 ms 10460 KB Output is correct
19 Correct 176 ms 10460 KB Output is correct
20 Correct 259 ms 10460 KB Output is correct
21 Correct 9 ms 10328 KB Output is correct
22 Correct 3 ms 10328 KB Output is correct
23 Correct 163 ms 10328 KB Output is correct
24 Correct 279 ms 10460 KB Output is correct
25 Correct 0 ms 10328 KB Output is correct
26 Correct 9 ms 10328 KB Output is correct
27 Correct 9 ms 10328 KB Output is correct
28 Correct 9 ms 10328 KB Output is correct
29 Correct 316 ms 10460 KB Output is correct
30 Correct 256 ms 10460 KB Output is correct
31 Correct 199 ms 10460 KB Output is correct
32 Correct 226 ms 10460 KB Output is correct
33 Correct 16 ms 10328 KB Output is correct
34 Correct 13 ms 10328 KB Output is correct
35 Correct 246 ms 10460 KB Output is correct
36 Correct 416 ms 10460 KB Output is correct