oj.uz

답안 #1050714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050714 2024-08-09T13:14:58 Z duckindog Joker (BOI20_joker) C++17
14 / 100
 21 ms 10292 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 200'000 + 10;
int n, m, q;
struct Edge { 
  int u, v;
  friend istream& operator >> (istream& is, auto& rhs) { 
    return is >> rhs.u >> rhs.v;
  }
} edge[N];
 
struct DSU { 
  int id[N], co[N], cnt;
  vector<tuple<int, int, int, int, int, int>> undo;
  bool mk[N];
  
  void clear() { 
    cnt = 0;
    memset(id, -1, (n + 1) * sizeof(int));
    memset(co, 0, (n + 1) * sizeof(int));
    memset(mk, false, (n + 1) * sizeof(int));
  }
  int root(int u) { return id[u] < 0 ? u : root(id[u]); }
  bool chk(int u) { return id[u] < 0 ? mk[u] : mk[u] ^ chk(id[u]); }
  inline int color(int u) { return co[u] ^ chk(u); }
  inline void add(int u, int v) { 
    int oU = u, oV = v;
 
    u = root(u); v = root(v);
    if (u == v) { 
      undo.emplace_back(0, 0, 0, 0, 0, cnt);
      cnt += color(oU) == color(oV); 
      return; 
    }

    if (id[u] > id[v]) swap(u, v);

    undo.emplace_back(u, id[u], v, id[v], mk[v], cnt);

    if (color(oU) == color(oV)) mk[v] ^= 1;
    id[u] += id[v];
    id[v] = u; 
  }
  inline void rollBack() { 
    auto [u, idU, v, idV, mkV, pCnt] = undo.back(); undo.pop_back();
    id[u] = idU;
    id[v] = idV;
    mk[v] = mkV;
    cnt = pCnt;
  }
} T;

int f[N];
void dnc(int l, int r, int lt, int rt) { 
  if (l > r) return;
  int mid = l + r >> 1;
  auto& ret = f[mid];
  
  for (int i = l; i < mid; ++i) T.add(edge[i].u, edge[i].v);
  for (int i = rt; i >= max(mid + 1, lt); --i) T.add(edge[i].u, edge[i].v);
 
  for (int i = max(mid + 1, lt); i <= rt; ++i) {
    const auto& [u, v] = edge[i];
    if (T.cnt) ret = i - 1;
    T.rollBack();
  } if (T.cnt) ret = rt;
 
  T.add(edge[mid].u, edge[mid].v);
  dnc(mid + 1, r, !ret ? lt : ret, rt);
  for (int i = l; i <= mid; ++i) T.rollBack();
 
  for (int i = rt; i > (!ret ? rt : ret); --i) T.add(edge[i].u, edge[i].v);
  dnc(l, mid - 1, lt, (!ret ? rt : ret));
  for (int i = rt; i > (!ret ? rt : ret); --i) T.rollBack();
}

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);
 
  cin >> n >> m >> q;
  for (int i = 1; i <= m; ++i) cin >> edge[i];
  
  T.clear();
  dnc(1, m, 1, m);
  while (q--) { 
    int l, r; cin >> l >> r;
    cout << (r <= f[l] ? "YES" : "NO") << "\n";
  }
}

Compilation message

Joker.cpp:9:45: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
    9 |   friend istream& operator >> (istream& is, auto& rhs) {
      |                                             ^~~~
Joker.cpp: In function 'void dnc(int, int, int, int)':
Joker.cpp:58:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |   int mid = l + r >> 1;
      |             ~~^~~
Joker.cpp:65:17: warning: unused structured binding declaration [-Wunused-variable]
   65 |     const auto& [u, v] = edge[i];
      |                 ^~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 2392 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 476 KB Output is correct
28 Correct 1 ms 344 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 2392 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 476 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 4 ms 344 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 2 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 1 ms 2572 KB Output is correct
38 Correct 15 ms 2684 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 2 ms 2652 KB Output is correct
41 Correct 2 ms 2652 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 1 ms 2652 KB Output is correct
44 Correct 2 ms 2692 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 1 ms 2652 KB Output is correct
48 Correct 1 ms 2524 KB Output is correct
49 Correct 1 ms 2684 KB Output is correct
50 Correct 1 ms 2652 KB Output is correct
51 Correct 2 ms 2652 KB Output is correct
52 Correct 1 ms 2536 KB Output is correct
53 Correct 2 ms 2652 KB Output is correct
54 Correct 2 ms 2572 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Runtime error 21 ms 10292 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 2392 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 476 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Runtime error 21 ms 10292 KB Execution killed with signal 6
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 2392 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 476 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 4 ms 344 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 2 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 1 ms 2572 KB Output is correct
38 Correct 15 ms 2684 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 2 ms 2652 KB Output is correct
41 Correct 2 ms 2652 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 1 ms 2652 KB Output is correct
44 Correct 2 ms 2692 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 1 ms 2652 KB Output is correct
48 Correct 1 ms 2524 KB Output is correct
49 Correct 1 ms 2684 KB Output is correct
50 Correct 1 ms 2652 KB Output is correct
51 Correct 2 ms 2652 KB Output is correct
52 Correct 1 ms 2536 KB Output is correct
53 Correct 2 ms 2652 KB Output is correct
54 Correct 2 ms 2572 KB Output is correct
55 Runtime error 20 ms 10064 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 2392 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 476 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 4 ms 344 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 2 ms 2652 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 1 ms 2572 KB Output is correct
38 Correct 15 ms 2684 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 2 ms 2652 KB Output is correct
41 Correct 2 ms 2652 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 1 ms 2652 KB Output is correct
44 Correct 2 ms 2692 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 1 ms 2652 KB Output is correct
48 Correct 1 ms 2524 KB Output is correct
49 Correct 1 ms 2684 KB Output is correct
50 Correct 1 ms 2652 KB Output is correct
51 Correct 2 ms 2652 KB Output is correct
52 Correct 1 ms 2536 KB Output is correct
53 Correct 2 ms 2652 KB Output is correct
54 Correct 2 ms 2572 KB Output is correct
55 Runtime error 21 ms 10292 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -