oj.uz

답안 #609726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609726 2022-07-27T19:56:12 Z Sam_a17 Jail (JOI22_jail) C++14
72 / 100
 4276 ms 1048576 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());

#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}

// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 10, LOG = 22;
vector<int> adj[N], dir[N], starts[N], endi[N];
int n, m, p[N], vis[N], up[N][LOG], depths[N];
bool flag;

void dfs(int node, int parent) {
  p[node] = parent;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    up[i][0] = node;
    for(int j = 1; j < LOG; j++) {
      up[i][j] = up[up[i][j - 1]][j - 1];
    }
    depths[i] = depths[node] + 1;
    dfs(i, node);
  }
}

int lca(int a, int b) {
  if(a == b) {
    return a;
  }
 
  if(depths[a] > depths[b]) {
    swap(a, b);
  }
 
  int delta = depths[b] - depths[a];
  for(int i = 0; i < LOG; i++) {
    if(delta & (1 << i)) {
      b = up[b][i];
    }
  }
 
  if(a == b) {
    return a;
  }
 
  for(int i = LOG - 1; i >= 0; i--) {
    if(up[a][i] != up[b][i]) {
      a = up[a][i], b = up[b][i];
    }
  }
  return up[a][0];
}

void dfsCycle(int node) {
  vis[node] = 1;

  for(auto i: dir[node]) {
    if(vis[i] == 1) {
      flag = true;
      return;
    } else if(!vis[i]) {
      dfsCycle(i);
    }

    if(flag) {
      return;
    }
  }

  vis[node] = 2;
}

vector<int> path(int a, int b) {
  int lc = lca(a, b);

  vector<int> nodes;
  while(a != lc) {
    nodes.push_back(a);
    a = p[a];
  }
  
  while(b != lc) {
    nodes.push_back(b);
    b = p[b];
  }

  nodes.push_back(lc);
  return nodes;
}

void clear() {
  flag = false;
  for(int i = 1; i <= n; i++) {
    starts[i].clear(), endi[i].clear();
    adj[i].clear();
  }

  for(int i = 0; i < m; i++) {
    dir[i].clear(), vis[i] = 0;
  }
}

void solve_() {
  cin >> n;

  for(int i = 1; i <= n - 1; i++) {
    int a, b; cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  cin >> m;

  vector<vector<int>> paths;
  vector<pair<int, int>> start_end;

  dfs(1, -1);

  for(int i = 1; i <= m; i++) {
    int a, b; cin >> a >> b;
    start_end.push_back({a, b});


    // int node = b;
    // vector<int> nodes;
    // while(node != -1) {
    //   nodes.push_back(node);
    //   node = p[node];
    // }

    vector<int> nodes = path(a, b);
    // dbg(nodes)
    starts[a].push_back(i - 1);
    endi[b].push_back(i - 1);

    sort(all(nodes));
    paths.push_back(nodes);
  }

  // check for every pair
  for(int i = 0; i < m; i++) {
    for(auto j: paths[i]) {
      for(auto k: starts[j]) {
        if(k == i) continue;
        dir[k].push_back(i);
      }

      for(auto k: endi[j]) {
        if(k == i) continue;
        dir[i].push_back(k);
      }
    }
  }

  // check for cycles
  for(int i = 0; i < m; i++) {
    if(!vis[i]) {
      dfsCycle(i);

      if(flag) {
        clear();
        printf("No\n");
        return;
      }
    }
  }

  printf("Yes\n");
  clear();
}

int main () {
  setIO("");

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1; cin >> test_cases;
  solve(test_cases);

  return 0;
}

Compilation message

jail.cpp: In function 'void setIO(std::string)':
jail.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
jail.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 12 ms 19136 KB Output is correct
4 Correct 23 ms 19144 KB Output is correct
5 Correct 44 ms 19184 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 11 ms 19156 KB Output is correct
8 Correct 14 ms 19424 KB Output is correct
9 Correct 275 ms 34764 KB Output is correct
10 Correct 1161 ms 276980 KB Output is correct
11 Correct 17 ms 19148 KB Output is correct
12 Correct 74 ms 19272 KB Output is correct
13 Correct 261 ms 102036 KB Output is correct
14 Correct 345 ms 125904 KB Output is correct
15 Runtime error 4276 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19136 KB Output is correct
3 Correct 14 ms 19236 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 14 ms 19156 KB Output is correct
6 Correct 13 ms 19160 KB Output is correct
7 Correct 14 ms 19112 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 12 ms 19244 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19088 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19136 KB Output is correct
3 Correct 14 ms 19236 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 14 ms 19156 KB Output is correct
6 Correct 13 ms 19160 KB Output is correct
7 Correct 14 ms 19112 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 12 ms 19244 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19088 KB Output is correct
14 Correct 10 ms 19116 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 12 ms 19156 KB Output is correct
17 Correct 12 ms 19124 KB Output is correct
18 Correct 12 ms 19156 KB Output is correct
19 Correct 10 ms 19132 KB Output is correct
20 Correct 14 ms 19156 KB Output is correct
21 Correct 12 ms 19156 KB Output is correct
22 Correct 11 ms 19156 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 11 ms 19116 KB Output is correct
25 Correct 12 ms 19156 KB Output is correct
26 Correct 13 ms 19156 KB Output is correct
27 Correct 12 ms 19096 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19136 KB Output is correct
3 Correct 14 ms 19236 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 14 ms 19156 KB Output is correct
6 Correct 13 ms 19160 KB Output is correct
7 Correct 14 ms 19112 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 12 ms 19244 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19088 KB Output is correct
14 Correct 10 ms 19116 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 12 ms 19156 KB Output is correct
17 Correct 12 ms 19124 KB Output is correct
18 Correct 12 ms 19156 KB Output is correct
19 Correct 10 ms 19132 KB Output is correct
20 Correct 14 ms 19156 KB Output is correct
21 Correct 12 ms 19156 KB Output is correct
22 Correct 11 ms 19156 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 11 ms 19116 KB Output is correct
25 Correct 12 ms 19156 KB Output is correct
26 Correct 13 ms 19156 KB Output is correct
27 Correct 12 ms 19096 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct
29 Correct 16 ms 19448 KB Output is correct
30 Correct 13 ms 19236 KB Output is correct
31 Correct 13 ms 19256 KB Output is correct
32 Correct 13 ms 19208 KB Output is correct
33 Correct 13 ms 19156 KB Output is correct
34 Correct 13 ms 19236 KB Output is correct
35 Correct 14 ms 19284 KB Output is correct
36 Correct 13 ms 19184 KB Output is correct
37 Correct 15 ms 19124 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19136 KB Output is correct
3 Correct 14 ms 19236 KB Output is correct
4 Correct 12 ms 19156 KB Output is correct
5 Correct 14 ms 19156 KB Output is correct
6 Correct 13 ms 19160 KB Output is correct
7 Correct 14 ms 19112 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 12 ms 19156 KB Output is correct
11 Correct 12 ms 19244 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19088 KB Output is correct
14 Correct 10 ms 19116 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 12 ms 19156 KB Output is correct
17 Correct 12 ms 19124 KB Output is correct
18 Correct 12 ms 19156 KB Output is correct
19 Correct 10 ms 19132 KB Output is correct
20 Correct 14 ms 19156 KB Output is correct
21 Correct 12 ms 19156 KB Output is correct
22 Correct 11 ms 19156 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 11 ms 19116 KB Output is correct
25 Correct 12 ms 19156 KB Output is correct
26 Correct 13 ms 19156 KB Output is correct
27 Correct 12 ms 19096 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct
29 Correct 16 ms 19448 KB Output is correct
30 Correct 13 ms 19236 KB Output is correct
31 Correct 13 ms 19256 KB Output is correct
32 Correct 13 ms 19208 KB Output is correct
33 Correct 13 ms 19156 KB Output is correct
34 Correct 13 ms 19236 KB Output is correct
35 Correct 14 ms 19284 KB Output is correct
36 Correct 13 ms 19184 KB Output is correct
37 Correct 15 ms 19124 KB Output is correct
38 Correct 302 ms 35048 KB Output is correct
39 Correct 1178 ms 277164 KB Output is correct
40 Correct 142 ms 23500 KB Output is correct
41 Correct 57 ms 20516 KB Output is correct
42 Correct 112 ms 23500 KB Output is correct
43 Correct 44 ms 20304 KB Output is correct
44 Correct 23 ms 19520 KB Output is correct
45 Correct 86 ms 34708 KB Output is correct
46 Correct 93 ms 34776 KB Output is correct
47 Correct 247 ms 75656 KB Output is correct
48 Correct 257 ms 77520 KB Output is correct
49 Correct 103 ms 36512 KB Output is correct
50 Correct 89 ms 36484 KB Output is correct
51 Correct 67 ms 35748 KB Output is correct
52 Correct 71 ms 35660 KB Output is correct
53 Correct 24 ms 20396 KB Output is correct
54 Correct 95 ms 34520 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 10 ms 19028 KB Output is correct
5 Correct 18 ms 19280 KB Output is correct
6 Correct 11 ms 19156 KB Output is correct
7 Correct 11 ms 19156 KB Output is correct
8 Correct 12 ms 19028 KB Output is correct
9 Correct 11 ms 19104 KB Output is correct
10 Correct 11 ms 19116 KB Output is correct
11 Correct 10 ms 19028 KB Output is correct
12 Correct 15 ms 19252 KB Output is correct
13 Correct 42 ms 19328 KB Output is correct
14 Correct 57 ms 19304 KB Output is correct
15 Correct 51 ms 19340 KB Output is correct
16 Correct 109 ms 36572 KB Output is correct
17 Correct 260 ms 50192 KB Output is correct
18 Correct 609 ms 80000 KB Output is correct
19 Correct 122 ms 38296 KB Output is correct
20 Correct 131 ms 38312 KB Output is correct
21 Correct 121 ms 38348 KB Output is correct
22 Correct 218 ms 51004 KB Output is correct
23 Correct 187 ms 51312 KB Output is correct
24 Correct 196 ms 50844 KB Output is correct
25 Correct 190 ms 51152 KB Output is correct
26 Correct 201 ms 51128 KB Output is correct
27 Correct 260 ms 55432 KB Output is correct
28 Correct 287 ms 59612 KB Output is correct
29 Correct 269 ms 56636 KB Output is correct
30 Correct 159 ms 46336 KB Output is correct
31 Correct 200 ms 46852 KB Output is correct
32 Correct 169 ms 45480 KB Output is correct
33 Correct 173 ms 46864 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 12 ms 19136 KB Output is correct
4 Correct 23 ms 19144 KB Output is correct
5 Correct 44 ms 19184 KB Output is correct
6 Correct 10 ms 19156 KB Output is correct
7 Correct 11 ms 19156 KB Output is correct
8 Correct 14 ms 19424 KB Output is correct
9 Correct 275 ms 34764 KB Output is correct
10 Correct 1161 ms 276980 KB Output is correct
11 Correct 17 ms 19148 KB Output is correct
12 Correct 74 ms 19272 KB Output is correct
13 Correct 261 ms 102036 KB Output is correct
14 Correct 345 ms 125904 KB Output is correct
15 Runtime error 4276 ms 1048576 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -