oj.uz

Submission #609661

# Submission time Handle Problem Language Result Execution time Memory
609661 2022-07-27T18:57:32 Z Sam_a17 Jail (JOI22_jail) C++14
61 / 100
 5000 ms 252148 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;
vector<int> adj[N], dir[N];
int n, m, p[N], vis[N];
bool flag;

void dfs(int node, int parent) {
  p[node] = parent;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    dfs(i, node);
  }
}

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;
}

void clear() {
  flag = false;
  for(int i = 1; i <= n; i++) {
    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;
  for(int i = 1; i <= m; i++) {
    int a, b; cin >> a >> b;
    start_end.push_back({a, b});

    dfs(a, -1);

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

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

  // check for every pair
  for(int i = 0; i < m; i++) {
    int st = start_end[i].first, en = start_end[i].second;
    for(int j = 0; j < m; j++) {
      if(i == j) continue;
      auto it = lower_bound(all(paths[j]), st);
      if(it != paths[j].end() && *it == st) {
        dir[j].push_back(i);
      }

      it = lower_bound(all(paths[j]), en);
      if(it != paths[j].end() && *it == en) {
        dir[i].push_back(j);
      }
    }
  } 

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

      if(flag) {
        clear();
        cout << "No" << endl;
        return;
      }
    }
  }

  cout << "Yes" << endl;
  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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9632 KB Output is correct
3 Correct 5 ms 9640 KB Output is correct
4 Correct 15 ms 9684 KB Output is correct
5 Correct 25 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 18 ms 9940 KB Output is correct
9 Correct 988 ms 23140 KB Output is correct
10 Correct 1750 ms 252088 KB Output is correct
11 Correct 16 ms 9728 KB Output is correct
12 Correct 179 ms 9952 KB Output is correct
13 Execution timed out 5049 ms 18068 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9660 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 7 ms 9740 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9696 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9660 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 7 ms 9740 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9696 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 6 ms 9636 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9744 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9712 KB Output is correct
25 Correct 6 ms 9736 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 7 ms 9684 KB Output is correct
28 Correct 5 ms 9684 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9660 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 7 ms 9740 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9696 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 6 ms 9636 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9744 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9712 KB Output is correct
25 Correct 6 ms 9736 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 7 ms 9684 KB Output is correct
28 Correct 5 ms 9684 KB Output is correct
29 Correct 17 ms 9896 KB Output is correct
30 Correct 13 ms 9684 KB Output is correct
31 Correct 15 ms 9780 KB Output is correct
32 Correct 15 ms 9684 KB Output is correct
33 Correct 8 ms 9684 KB Output is correct
34 Correct 17 ms 9768 KB Output is correct
35 Correct 21 ms 9848 KB Output is correct
36 Correct 13 ms 9756 KB Output is correct
37 Correct 12 ms 9760 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9660 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 7 ms 9740 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9696 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Correct 6 ms 9636 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9744 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9712 KB Output is correct
25 Correct 6 ms 9736 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 7 ms 9684 KB Output is correct
28 Correct 5 ms 9684 KB Output is correct
29 Correct 17 ms 9896 KB Output is correct
30 Correct 13 ms 9684 KB Output is correct
31 Correct 15 ms 9780 KB Output is correct
32 Correct 15 ms 9684 KB Output is correct
33 Correct 8 ms 9684 KB Output is correct
34 Correct 17 ms 9768 KB Output is correct
35 Correct 21 ms 9848 KB Output is correct
36 Correct 13 ms 9756 KB Output is correct
37 Correct 12 ms 9760 KB Output is correct
38 Correct 995 ms 23128 KB Output is correct
39 Correct 1743 ms 252148 KB Output is correct
40 Correct 1493 ms 13000 KB Output is correct
41 Correct 1309 ms 10188 KB Output is correct
42 Correct 726 ms 13240 KB Output is correct
43 Correct 132 ms 9992 KB Output is correct
44 Correct 244 ms 9900 KB Output is correct
45 Correct 3350 ms 14532 KB Output is correct
46 Correct 3225 ms 14480 KB Output is correct
47 Correct 1185 ms 52896 KB Output is correct
48 Correct 1224 ms 54644 KB Output is correct
49 Correct 2232 ms 16004 KB Output is correct
50 Correct 2449 ms 16092 KB Output is correct
51 Correct 596 ms 14492 KB Output is correct
52 Correct 563 ms 14468 KB Output is correct
53 Correct 212 ms 10088 KB Output is correct
54 Correct 3097 ms 14260 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9696 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 15 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9664 KB Output is correct
9 Correct 10 ms 9632 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 13 ms 9756 KB Output is correct
13 Correct 121 ms 9748 KB Output is correct
14 Correct 101 ms 9736 KB Output is correct
15 Correct 110 ms 9760 KB Output is correct
16 Execution timed out 5037 ms 14416 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9632 KB Output is correct
3 Correct 5 ms 9640 KB Output is correct
4 Correct 15 ms 9684 KB Output is correct
5 Correct 25 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 18 ms 9940 KB Output is correct
9 Correct 988 ms 23140 KB Output is correct
10 Correct 1750 ms 252088 KB Output is correct
11 Correct 16 ms 9728 KB Output is correct
12 Correct 179 ms 9952 KB Output is correct
13 Execution timed out 5049 ms 18068 KB Time limit exceeded
14 Halted 0 ms 0 KB -