oj.uz

Submission #735078

# Submission time Handle Problem Language Result Execution time Memory
735078 2023-05-03T13:14:25 Z cadmiumsky Jail (JOI22_jail) C++17
60 / 100
 1008 ms 473268 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

const int nmax = 12e4 + 5;
//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

pii chains[nmax];

namespace Tree {
  
  int pin[nmax], pout[nmax], area[nmax], inp;
  int p[nmax], jump[nmax], d[nmax];
  int pch[nmax];
  
  namespace G {
      vector<vector<int>> g;
      vector<int> occ;
      
      // Low level
      int newnode() { 
        g.emplace_back();
        occ.emplace_back(0);
        return sz(g) - 1;
      }
      void addedge(int x, int y) {
        if(x != 0 && y != 0)
          g[x].emplace_back(y);
      }
      bool dfs(int node) {
        if(occ[node] == 2) return 0;
        if(occ[node] == 1) return 1;
        occ[node] = 1;
        bool ok = 0;
        for(auto x : g[node])
          ok |= dfs(x);
        occ[node] = 2;
        return ok;
      }
      bool findcyc() {
        bool found = 0;
        for(int i = 0; !found && i < sz(g); i++) {
          found |= dfs(i);
        }
        return found;
      }
      // High Level
      
      int inspre[16][nmax]; // sus in jos
      int dinspre[16][nmax]; // jos in sus
      int lg2[nmax];
      
      void init(vector<int> T, vector<int> A) {
        int n = sz(T);
        for(int i = 2; i < n; i++)
          lg2[i] = lg2[i >> 1] + 1;
        for(int i = 0; i < n; i++) 
          inspre[0][i] = T[i];
        for(int step = 1; step < 16; step++) {
          for(int i = 0; i + (1 << step) <= n; i++) {
            inspre[step][i] = newnode();
            addedge(inspre[step][i], inspre[step - 1][i]);
            addedge(inspre[step][i], inspre[step - 1][i + (1 << step - 1)]);
          }
        }
        n = sz(A);
        for(int i = 0; i < n; i++) 
          dinspre[0][i] = A[i];
        for(int step = 1; step < 16; step++) {
          for(int i = 0; i + (1 << step) <= n; i++) {
            dinspre[step][i] = newnode();
            addedge(dinspre[step - 1][i], dinspre[step][i]);
            addedge(dinspre[step - 1][i + (1 << step - 1)], dinspre[step][i]);
          }
        }
        return;
      }
      void pushdown(int X, int l, int r) {
        int step = lg2[r - l + 1];
        addedge(X, inspre[step][l]);
        addedge(X, inspre[step][r - (1 << step) + 1]);
        //cerr << X << " --> " << l << ", " << r << '\n';
      }
      void pushup(int X, int l, int r) {
        int step = lg2[r - l + 1];
        addedge(dinspre[step][r - (1 << step) + 1], X);
        addedge(dinspre[step][l], X);
        //cerr << X << " <-- " << l << ", " << r << '\n';
      }
      void push(int X, int l, int r, int pass = 0) {
        if(r < l) return;
        int mid = -1;
        if(pass == 0) mid = pin[chains[X].first];
        else if(pass == 1) mid = pin[chains[X].second];
        
        if(l <= mid && mid <= r) {
          push(X, l, mid - 1, pass + 1),
          push(X, mid + 1, r, pass + 1);
          return;
        }
        if(pass != 2) {
          push(X, l, r, pass + 1);
          return;
        }
        pushup(X, l, r);
        pushdown(X, l, r);
        return;
      }
      
      void init(int n) {
        g.clear();
        occ.clear();
        g.resize(n + 1);
        occ.resize(n + 1, 0);
      }
    }
  
  vector<int> g[nmax];
  
  void initstd(int node, int f) {
    p[node] = f;
    jump[node] = f;
    d[node] = d[f] + 1;
    if(d[jump[f]] - d[jump[jump[f]]] == d[f] - d[jump[f]])
      jump[node] = jump[jump[f]];
      
    //cerr << node << '>' << jump[node] << '\n';
      
    area[node] = 1;
    for(auto x : g[node]) {
      if(x == f) continue;
      initstd(x, node);
      area[node] += area[x];
    }
    return;
  }
  
  bool isanc(int x, int y) { return pin[x] <= pin[y] && pout[y] <= pout[x]; }
  int lca(int x, int y) {
    while(!isanc(x, y)) {
      if(!isanc(jump[x], y)) x = jump[x];
      x = p[x];
    }
    return x;
  }
  
  namespace HLD {
    
    void initp(int node, int f) {
      pin[node] = inp++;
      //cerr << node << ' ' << inp - 1 << '\n';
      int atrs = -1;
      for(auto x : g[node]) {
        if(x == f) continue;
        if(atrs == -1 || area[atrs] < area[x]) atrs = x;
      }
      if(atrs == -1) { pout[node] = inp - 1; return; }
      pch[atrs] = pch[node];
      initp(atrs, node);
      for(auto x : g[node]) {
        if(x == f || x == atrs) continue;
        pch[x] = x;
        initp(x, node);
      }
      
      pout[node] = inp - 1;
      return;
    }
    void pushQ(int x, int y, int X) {
      if(isanc(x, y) && x != y) return;
      //cerr << X << '\t' << x << ' ' << y << '\n';
      if(pch[x] == pch[y]) { G::push(X, pin[y], pin[x]); return; }
      G::push(X, pin[pch[x]], pin[x]);
      pushQ(p[pch[x]], y, X);
    }
  }
  

  
  void init(int n) {
    inp = 0;
    for(int i = 0; i <= n; i++)
      g[i].clear();
  }
}

void driver() {
  int n, m;
  cin >> n;
  Tree::init(n);
  for(int i = 1, x, y; i < n; i++) {
    cin >> x >> y;
    Tree::g[x].emplace_back(y);
    Tree::g[y].emplace_back(x);
  }
  Tree::g[0].emplace_back(1);
  Tree::g[1].emplace_back(0);
  Tree::initstd(0, 0);
  Tree::HLD::initp(0, 0);
  cin >> m;
  vector<int> ends(n + 1), starts(n + 1);
  for(int i = 1, S, T; i <= m; i++) {
    cin >> S >> T;
    starts[Tree::pin[S]] = i;
    ends[Tree::pin[T]] = i;
    chains[i] = pii{S, T};
  }
  //for(auto x : ends) cerr << x << ' '; cerr << '\n';
  //for(auto x : starts) cerr << x << ' '; cerr << '\n';
  
  Tree::G::init(m);
  Tree::G::init(ends, starts);
  for(int i = 1, S, T; i <= m; i++) {
    tie(S, T) = chains[i];
    int L = Tree::lca(S, T);
    Tree::HLD::pushQ(S, L, i);
    Tree::HLD::pushQ(T, L, i);
    Tree::G::pushdown(i, Tree::pin[S], Tree::pin[S]);
    Tree::G::pushup(i, Tree::pin[T], Tree::pin[T]);
  }
  cout << (Tree::G::findcyc()? "No\n" : "Yes\n");
}

signed main() {
  int T;
  cin >> T;
  while(T--) driver();
  
}

/**
      Anul asta se da centroid.
-- Surse oficiale
*/

Compilation message

jail.cpp: In function 'void Tree::G::init(std::vector<int>, std::vector<int>)':
jail.cpp:70:70: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   70 |             addedge(inspre[step][i], inspre[step - 1][i + (1 << step - 1)]);
      |                                                                 ~~~~~^~~
jail.cpp:80:54: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   80 |             addedge(dinspre[step - 1][i + (1 << step - 1)], dinspre[step][i]);
      |                                                 ~~~~~^~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 2 ms 3156 KB Output is correct
3 Correct 2 ms 3156 KB Output is correct
4 Correct 57 ms 3628 KB Output is correct
5 Correct 114 ms 3952 KB Output is correct
6 Correct 7 ms 3412 KB Output is correct
7 Correct 10 ms 3400 KB Output is correct
8 Correct 10 ms 3540 KB Output is correct
9 Correct 321 ms 13224 KB Output is correct
10 Runtime error 609 ms 473148 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 2 ms 3136 KB Output is correct
3 Correct 7 ms 3412 KB Output is correct
4 Correct 7 ms 3412 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 8 ms 3400 KB Output is correct
7 Correct 8 ms 3412 KB Output is correct
8 Correct 8 ms 3404 KB Output is correct
9 Correct 8 ms 3408 KB Output is correct
10 Correct 9 ms 3412 KB Output is correct
11 Correct 8 ms 3404 KB Output is correct
12 Correct 6 ms 3376 KB Output is correct
13 Correct 6 ms 3412 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 2 ms 3136 KB Output is correct
3 Correct 7 ms 3412 KB Output is correct
4 Correct 7 ms 3412 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 8 ms 3400 KB Output is correct
7 Correct 8 ms 3412 KB Output is correct
8 Correct 8 ms 3404 KB Output is correct
9 Correct 8 ms 3408 KB Output is correct
10 Correct 9 ms 3412 KB Output is correct
11 Correct 8 ms 3404 KB Output is correct
12 Correct 6 ms 3376 KB Output is correct
13 Correct 6 ms 3412 KB Output is correct
14 Correct 2 ms 3156 KB Output is correct
15 Correct 2 ms 3156 KB Output is correct
16 Correct 8 ms 3412 KB Output is correct
17 Correct 8 ms 3504 KB Output is correct
18 Correct 9 ms 3412 KB Output is correct
19 Correct 2 ms 3156 KB Output is correct
20 Correct 8 ms 3404 KB Output is correct
21 Correct 8 ms 3464 KB Output is correct
22 Correct 8 ms 3404 KB Output is correct
23 Correct 2 ms 3156 KB Output is correct
24 Correct 3 ms 3284 KB Output is correct
25 Correct 8 ms 3404 KB Output is correct
26 Correct 3 ms 3412 KB Output is correct
27 Correct 8 ms 3408 KB Output is correct
28 Correct 2 ms 3156 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 2 ms 3136 KB Output is correct
3 Correct 7 ms 3412 KB Output is correct
4 Correct 7 ms 3412 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 8 ms 3400 KB Output is correct
7 Correct 8 ms 3412 KB Output is correct
8 Correct 8 ms 3404 KB Output is correct
9 Correct 8 ms 3408 KB Output is correct
10 Correct 9 ms 3412 KB Output is correct
11 Correct 8 ms 3404 KB Output is correct
12 Correct 6 ms 3376 KB Output is correct
13 Correct 6 ms 3412 KB Output is correct
14 Correct 2 ms 3156 KB Output is correct
15 Correct 2 ms 3156 KB Output is correct
16 Correct 8 ms 3412 KB Output is correct
17 Correct 8 ms 3504 KB Output is correct
18 Correct 9 ms 3412 KB Output is correct
19 Correct 2 ms 3156 KB Output is correct
20 Correct 8 ms 3404 KB Output is correct
21 Correct 8 ms 3464 KB Output is correct
22 Correct 8 ms 3404 KB Output is correct
23 Correct 2 ms 3156 KB Output is correct
24 Correct 3 ms 3284 KB Output is correct
25 Correct 8 ms 3404 KB Output is correct
26 Correct 3 ms 3412 KB Output is correct
27 Correct 8 ms 3408 KB Output is correct
28 Correct 2 ms 3156 KB Output is correct
29 Correct 10 ms 3540 KB Output is correct
30 Correct 9 ms 3412 KB Output is correct
31 Correct 9 ms 3564 KB Output is correct
32 Correct 9 ms 3540 KB Output is correct
33 Correct 11 ms 3540 KB Output is correct
34 Correct 8 ms 3424 KB Output is correct
35 Correct 9 ms 3488 KB Output is correct
36 Correct 8 ms 3412 KB Output is correct
37 Correct 6 ms 3408 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 2 ms 3136 KB Output is correct
3 Correct 7 ms 3412 KB Output is correct
4 Correct 7 ms 3412 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 8 ms 3400 KB Output is correct
7 Correct 8 ms 3412 KB Output is correct
8 Correct 8 ms 3404 KB Output is correct
9 Correct 8 ms 3408 KB Output is correct
10 Correct 9 ms 3412 KB Output is correct
11 Correct 8 ms 3404 KB Output is correct
12 Correct 6 ms 3376 KB Output is correct
13 Correct 6 ms 3412 KB Output is correct
14 Correct 2 ms 3156 KB Output is correct
15 Correct 2 ms 3156 KB Output is correct
16 Correct 8 ms 3412 KB Output is correct
17 Correct 8 ms 3504 KB Output is correct
18 Correct 9 ms 3412 KB Output is correct
19 Correct 2 ms 3156 KB Output is correct
20 Correct 8 ms 3404 KB Output is correct
21 Correct 8 ms 3464 KB Output is correct
22 Correct 8 ms 3404 KB Output is correct
23 Correct 2 ms 3156 KB Output is correct
24 Correct 3 ms 3284 KB Output is correct
25 Correct 8 ms 3404 KB Output is correct
26 Correct 3 ms 3412 KB Output is correct
27 Correct 8 ms 3408 KB Output is correct
28 Correct 2 ms 3156 KB Output is correct
29 Correct 10 ms 3540 KB Output is correct
30 Correct 9 ms 3412 KB Output is correct
31 Correct 9 ms 3564 KB Output is correct
32 Correct 9 ms 3540 KB Output is correct
33 Correct 11 ms 3540 KB Output is correct
34 Correct 8 ms 3424 KB Output is correct
35 Correct 9 ms 3488 KB Output is correct
36 Correct 8 ms 3412 KB Output is correct
37 Correct 6 ms 3408 KB Output is correct
38 Correct 326 ms 13204 KB Output is correct
39 Runtime error 582 ms 473268 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 2 ms 3156 KB Output is correct
3 Correct 2 ms 3156 KB Output is correct
4 Correct 2 ms 3156 KB Output is correct
5 Correct 24 ms 3284 KB Output is correct
6 Correct 5 ms 3404 KB Output is correct
7 Correct 5 ms 3412 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 2 ms 3136 KB Output is correct
10 Correct 2 ms 3284 KB Output is correct
11 Correct 3 ms 3128 KB Output is correct
12 Correct 7 ms 3400 KB Output is correct
13 Correct 87 ms 3864 KB Output is correct
14 Correct 166 ms 4148 KB Output is correct
15 Correct 117 ms 4032 KB Output is correct
16 Correct 501 ms 228756 KB Output is correct
17 Correct 770 ms 242444 KB Output is correct
18 Correct 1008 ms 268696 KB Output is correct
19 Correct 625 ms 229636 KB Output is correct
20 Correct 541 ms 229744 KB Output is correct
21 Correct 633 ms 229700 KB Output is correct
22 Correct 661 ms 240864 KB Output is correct
23 Correct 612 ms 239872 KB Output is correct
24 Correct 650 ms 240252 KB Output is correct
25 Correct 605 ms 239936 KB Output is correct
26 Correct 662 ms 239996 KB Output is correct
27 Correct 717 ms 242800 KB Output is correct
28 Correct 702 ms 247032 KB Output is correct
29 Correct 691 ms 244020 KB Output is correct
30 Correct 652 ms 235636 KB Output is correct
31 Correct 596 ms 236196 KB Output is correct
32 Correct 644 ms 234864 KB Output is correct
33 Correct 622 ms 236336 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3156 KB Output is correct
2 Correct 2 ms 3156 KB Output is correct
3 Correct 2 ms 3156 KB Output is correct
4 Correct 57 ms 3628 KB Output is correct
5 Correct 114 ms 3952 KB Output is correct
6 Correct 7 ms 3412 KB Output is correct
7 Correct 10 ms 3400 KB Output is correct
8 Correct 10 ms 3540 KB Output is correct
9 Correct 321 ms 13224 KB Output is correct
10 Runtime error 609 ms 473148 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -