oj.uz

답안 #609698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609698 2022-07-27T19:26:39 Z Sam_a17 Jail (JOI22_jail) C++14
61 / 100
 5000 ms 261772 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], starts[N], endi[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++) {
    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;

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

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

  for(int i = 0; i < m; i++) {
    sort(all(dir[i]));
    uniq(dir[i]);
  }

  // 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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Correct 9 ms 19028 KB Output is correct
4 Correct 19 ms 19084 KB Output is correct
5 Correct 32 ms 19028 KB Output is correct
6 Correct 13 ms 19136 KB Output is correct
7 Correct 10 ms 19156 KB Output is correct
8 Correct 18 ms 19284 KB Output is correct
9 Correct 822 ms 34104 KB Output is correct
10 Correct 1796 ms 261516 KB Output is correct
11 Correct 20 ms 19116 KB Output is correct
12 Correct 128 ms 19264 KB Output is correct
13 Execution timed out 5052 ms 27600 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 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 11 ms 19028 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 11 ms 19036 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 11 ms 19140 KB Output is correct
10 Correct 11 ms 19080 KB Output is correct
11 Correct 10 ms 19068 KB Output is correct
12 Correct 12 ms 19028 KB Output is correct
13 Correct 10 ms 19028 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 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 11 ms 19028 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 11 ms 19036 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 11 ms 19140 KB Output is correct
10 Correct 11 ms 19080 KB Output is correct
11 Correct 10 ms 19068 KB Output is correct
12 Correct 12 ms 19028 KB Output is correct
13 Correct 10 ms 19028 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 11 ms 19044 KB Output is correct
17 Correct 11 ms 19136 KB Output is correct
18 Correct 14 ms 19144 KB Output is correct
19 Correct 10 ms 19000 KB Output is correct
20 Correct 11 ms 19028 KB Output is correct
21 Correct 13 ms 19132 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 11 ms 19112 KB Output is correct
26 Correct 10 ms 19028 KB Output is correct
27 Correct 11 ms 19076 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 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 11 ms 19028 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 11 ms 19036 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 11 ms 19140 KB Output is correct
10 Correct 11 ms 19080 KB Output is correct
11 Correct 10 ms 19068 KB Output is correct
12 Correct 12 ms 19028 KB Output is correct
13 Correct 10 ms 19028 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 11 ms 19044 KB Output is correct
17 Correct 11 ms 19136 KB Output is correct
18 Correct 14 ms 19144 KB Output is correct
19 Correct 10 ms 19000 KB Output is correct
20 Correct 11 ms 19028 KB Output is correct
21 Correct 13 ms 19132 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 11 ms 19112 KB Output is correct
26 Correct 10 ms 19028 KB Output is correct
27 Correct 11 ms 19076 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct
29 Correct 18 ms 19284 KB Output is correct
30 Correct 15 ms 19152 KB Output is correct
31 Correct 15 ms 19156 KB Output is correct
32 Correct 14 ms 19156 KB Output is correct
33 Correct 12 ms 19028 KB Output is correct
34 Correct 15 ms 19156 KB Output is correct
35 Correct 21 ms 19156 KB Output is correct
36 Correct 17 ms 19160 KB Output is correct
37 Correct 13 ms 19156 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 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 11 ms 19028 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 11 ms 19036 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 11 ms 19140 KB Output is correct
10 Correct 11 ms 19080 KB Output is correct
11 Correct 10 ms 19068 KB Output is correct
12 Correct 12 ms 19028 KB Output is correct
13 Correct 10 ms 19028 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 11 ms 19044 KB Output is correct
17 Correct 11 ms 19136 KB Output is correct
18 Correct 14 ms 19144 KB Output is correct
19 Correct 10 ms 19000 KB Output is correct
20 Correct 11 ms 19028 KB Output is correct
21 Correct 13 ms 19132 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 11 ms 19028 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 11 ms 19112 KB Output is correct
26 Correct 10 ms 19028 KB Output is correct
27 Correct 11 ms 19076 KB Output is correct
28 Correct 10 ms 19028 KB Output is correct
29 Correct 18 ms 19284 KB Output is correct
30 Correct 15 ms 19152 KB Output is correct
31 Correct 15 ms 19156 KB Output is correct
32 Correct 14 ms 19156 KB Output is correct
33 Correct 12 ms 19028 KB Output is correct
34 Correct 15 ms 19156 KB Output is correct
35 Correct 21 ms 19156 KB Output is correct
36 Correct 17 ms 19160 KB Output is correct
37 Correct 13 ms 19156 KB Output is correct
38 Correct 857 ms 33992 KB Output is correct
39 Correct 1776 ms 261772 KB Output is correct
40 Correct 1194 ms 22640 KB Output is correct
41 Correct 1110 ms 19840 KB Output is correct
42 Correct 585 ms 22660 KB Output is correct
43 Correct 129 ms 19388 KB Output is correct
44 Correct 126 ms 19340 KB Output is correct
45 Correct 3123 ms 23952 KB Output is correct
46 Correct 3140 ms 23824 KB Output is correct
47 Correct 1204 ms 62236 KB Output is correct
48 Correct 1150 ms 64088 KB Output is correct
49 Correct 2017 ms 25480 KB Output is correct
50 Correct 2509 ms 25624 KB Output is correct
51 Correct 562 ms 23924 KB Output is correct
52 Correct 586 ms 23964 KB Output is correct
53 Correct 128 ms 19644 KB Output is correct
54 Correct 2853 ms 23608 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 11 ms 19028 KB Output is correct
5 Correct 20 ms 19132 KB Output is correct
6 Correct 12 ms 19028 KB Output is correct
7 Correct 12 ms 19076 KB Output is correct
8 Correct 11 ms 19032 KB Output is correct
9 Correct 10 ms 19028 KB Output is correct
10 Correct 10 ms 19028 KB Output is correct
11 Correct 10 ms 19028 KB Output is correct
12 Correct 14 ms 19152 KB Output is correct
13 Correct 73 ms 19140 KB Output is correct
14 Correct 86 ms 19260 KB Output is correct
15 Correct 82 ms 19028 KB Output is correct
16 Execution timed out 5015 ms 23856 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Correct 9 ms 19028 KB Output is correct
4 Correct 19 ms 19084 KB Output is correct
5 Correct 32 ms 19028 KB Output is correct
6 Correct 13 ms 19136 KB Output is correct
7 Correct 10 ms 19156 KB Output is correct
8 Correct 18 ms 19284 KB Output is correct
9 Correct 822 ms 34104 KB Output is correct
10 Correct 1796 ms 261516 KB Output is correct
11 Correct 20 ms 19116 KB Output is correct
12 Correct 128 ms 19264 KB Output is correct
13 Execution timed out 5052 ms 27600 KB Time limit exceeded
14 Halted 0 ms 0 KB -