oj.uz

Submission #1094137

# Submission time Handle Problem Language Result Execution time Memory
1094137 2024-09-28T15:17:27 Z Wjsc Joker (BOI20_joker) C++14
49 / 100
 1016 ms 23636 KB 
#include<bits/stdc++.h>

using namespace std;

#define pi pair<int, int>
#define fi first
#define se second
#define all(v) v.begin(), v.end()

const int N = 2e5 + 5;

using tp = tuple<int, int, int>;

int n, m, q;
pi edge[N];
tp Q[N];
vector<int> ad[N];

namespace sub2 {
  bool ok = 0;
  int col[N];

  void dfs(int u, int c) {
    col[u] = c;
    for(auto v : ad[u]) {
      if(col[v] == col[u]) ok = 1;
      if(col[v] == -1) dfs(v, c ^ 1);
    }
  }

  void solve() {
    for(int que = 1; que <= q; ++que) {
      int l, r, id; tie(l, r, id) = Q[que];

      for(int i = 1; i <= n; ++i) ad[i].clear();

      for(int i = 1; i < l; ++i) {
        int u, v; tie(u, v) = edge[i];
        ad[u].push_back(v);
        ad[v].push_back(u);
      }
      for(int i = r + 1; i <= m; ++i) {
        int u, v; tie(u, v) = edge[i];
        ad[u].push_back(v);
        ad[v].push_back(u);
      }

      for(int i = 1; i <= n; ++i) col[i] = -1;

      ok = 0;
      for(int i = 1; i <= n; ++i)
        if(col[i] == -1) dfs(i, 0);

      cout << (ok ? "YES\n" : "NO\n");
    }
  }
}

///
namespace sub3 {
  int par[N], sz[N], lz[N], ans[N];
  vector<int> L;
  vector<pi> queries[N];

  void make_set() {
    for(int i = 1; i <= n; ++i) par[i] = i, sz[i] = 1, lz[i] = 0;
  }

  int find_set(int v, int &c) {
    c ^= lz[v];
    if(v == par[v]) return v;
    return find_set(par[v], c);
  }

  void union_set(int a, int b) {
    int ca = 0, cb = 0;
    a = find_set(a, ca); b = find_set(b, cb);
    if(a != b) {
      if(sz[a] < sz[b]) swap(a, b);
      sz[a] += sz[b];
      par[b] = a;
      if(ca == cb) lz[b] = 1;
    }
  }

  bool check(int a, int b) {
    int ca = 0, cb = 0;
    a = find_set(a, ca); b = find_set(b, cb);
    if(a == b && ca == cb) return true;
    return false;
  }

  void solve() {
    sort(Q + 1, Q + q + 1);

    for(int i = 1, cur = 0; i <= q; ++i) {
      int l, r, id; tie(l, r, id) = Q[i];
      if(l != cur) cur = l, L.push_back(cur);
      queries[cur].emplace_back(r, id);
    }

    for(auto x : L) sort(all(queries[x]), greater<pi>());

    for(auto l : L) {
      make_set();
      bool ok = 0;

      for(int i = 1; i < l; ++i) {
        int u, v; tie(u, v) = edge[i];
        if(check(u, v)) ok = 1;
        union_set(u, v);
      }

      int j = m;
      for(int i = m; i > queries[l][0].fi; --i) {
        int u, v; tie(u, v) = edge[i];
        if(check(u, v)) ok = 1;
        union_set(u, v);
        j = i;
      }
      ans[queries[l][0].se] = ok;

      for(int i = 1; i < queries[l].size(); ++i) {
        int r, id; tie(r, id) = queries[l][i];
        if(ok) {
          ans[id] = ok;
          continue;
        }

        while(j > r) {
          if(check(edge[j].fi, edge[j].se)) ok = 1;
          union_set(edge[j].fi, edge[j].se);
          --j;
        }
        ans[id] = ok;
      }
    }

    for(int i = 1; i <= q; ++i) cout << (ans[i] ? "YES\n" : "NO\n");
  }
}

signed main() {
  cin.tie(0)->sync_with_stdio(0);

  if(fopen("task.inp", "r")) {
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
  }

  cin >> n >> m >> q;

  for(int i = 1; i <= m; ++i) {
    int u, v; cin >> u >> v;
    edge[i] = {u, v};
  }

  bool chk = 1;
  for(int i = 1; i <= q; ++i) {
    int l, r; cin >> l >> r;
    Q[i] = {l, r, i};
    if(l > 200) chk = 0;
  }

  if(chk) sub3 :: solve();
  else if(n <= 2000 && m <= 2000 && q <= 2000) sub2 :: solve();
}

Compilation message

Joker.cpp: In function 'void sub3::solve()':
Joker.cpp:123:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |       for(int i = 1; i < queries[l].size(); ++i) {
      |                      ~~^~~~~~~~~~~~~~~~~~~
Joker.cpp: In function 'int main()':
Joker.cpp:147:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  147 |     freopen("task.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:148:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  148 |     freopen("task.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 4 ms 9652 KB Output is correct
3 Correct 4 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 5 ms 9816 KB Output is correct
6 Correct 4 ms 9716 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9816 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 5 ms 9816 KB Output is correct
11 Correct 5 ms 9816 KB Output is correct
12 Correct 5 ms 9908 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 5 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 5 ms 9820 KB Output is correct
21 Correct 5 ms 9816 KB Output is correct
22 Correct 5 ms 9820 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 4 ms 9824 KB Output is correct
25 Correct 5 ms 9824 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9828 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 4 ms 9652 KB Output is correct
3 Correct 4 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 5 ms 9816 KB Output is correct
6 Correct 4 ms 9716 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9816 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 5 ms 9816 KB Output is correct
11 Correct 5 ms 9816 KB Output is correct
12 Correct 5 ms 9908 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 5 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 5 ms 9820 KB Output is correct
21 Correct 5 ms 9816 KB Output is correct
22 Correct 5 ms 9820 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 4 ms 9824 KB Output is correct
25 Correct 5 ms 9824 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9828 KB Output is correct
29 Correct 42 ms 9992 KB Output is correct
30 Correct 81 ms 9828 KB Output is correct
31 Correct 78 ms 9828 KB Output is correct
32 Correct 63 ms 9820 KB Output is correct
33 Correct 50 ms 9828 KB Output is correct
34 Correct 95 ms 9824 KB Output is correct
35 Correct 96 ms 9828 KB Output is correct
36 Correct 39 ms 9820 KB Output is correct
37 Correct 61 ms 10056 KB Output is correct
38 Correct 52 ms 9820 KB Output is correct
39 Correct 58 ms 9824 KB Output is correct
40 Correct 59 ms 9824 KB Output is correct
41 Correct 57 ms 9816 KB Output is correct
42 Correct 56 ms 9820 KB Output is correct
43 Correct 53 ms 9820 KB Output is correct
44 Correct 62 ms 9820 KB Output is correct
45 Correct 68 ms 9820 KB Output is correct
46 Correct 70 ms 10040 KB Output is correct
47 Correct 53 ms 10072 KB Output is correct
48 Correct 58 ms 9816 KB Output is correct
49 Correct 69 ms 9816 KB Output is correct
50 Correct 81 ms 9820 KB Output is correct
51 Correct 54 ms 10004 KB Output is correct
52 Correct 63 ms 9820 KB Output is correct
53 Correct 71 ms 9816 KB Output is correct
54 Correct 85 ms 9816 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 4 ms 9652 KB Output is correct
3 Correct 72 ms 21960 KB Output is correct
4 Correct 72 ms 22732 KB Output is correct
5 Correct 71 ms 23120 KB Output is correct
6 Correct 75 ms 21984 KB Output is correct
7 Correct 72 ms 21960 KB Output is correct
8 Correct 71 ms 20940 KB Output is correct
9 Correct 69 ms 21560 KB Output is correct
10 Correct 72 ms 22828 KB Output is correct
11 Correct 72 ms 21884 KB Output is correct
12 Correct 74 ms 22984 KB Output is correct
13 Correct 72 ms 20936 KB Output is correct
14 Correct 73 ms 21448 KB Output is correct
15 Correct 73 ms 22468 KB Output is correct
16 Correct 79 ms 23244 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 4 ms 9652 KB Output is correct
3 Correct 4 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 5 ms 9816 KB Output is correct
6 Correct 4 ms 9716 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9816 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 5 ms 9816 KB Output is correct
11 Correct 5 ms 9816 KB Output is correct
12 Correct 5 ms 9908 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 5 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 5 ms 9820 KB Output is correct
21 Correct 5 ms 9816 KB Output is correct
22 Correct 5 ms 9820 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 4 ms 9824 KB Output is correct
25 Correct 5 ms 9824 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9828 KB Output is correct
29 Correct 72 ms 21960 KB Output is correct
30 Correct 72 ms 22732 KB Output is correct
31 Correct 71 ms 23120 KB Output is correct
32 Correct 75 ms 21984 KB Output is correct
33 Correct 72 ms 21960 KB Output is correct
34 Correct 71 ms 20940 KB Output is correct
35 Correct 69 ms 21560 KB Output is correct
36 Correct 72 ms 22828 KB Output is correct
37 Correct 72 ms 21884 KB Output is correct
38 Correct 74 ms 22984 KB Output is correct
39 Correct 72 ms 20936 KB Output is correct
40 Correct 73 ms 21448 KB Output is correct
41 Correct 73 ms 22468 KB Output is correct
42 Correct 79 ms 23244 KB Output is correct
43 Correct 418 ms 22356 KB Output is correct
44 Correct 1016 ms 23240 KB Output is correct
45 Correct 949 ms 23632 KB Output is correct
46 Correct 116 ms 22416 KB Output is correct
47 Correct 125 ms 22464 KB Output is correct
48 Correct 357 ms 21928 KB Output is correct
49 Correct 573 ms 23376 KB Output is correct
50 Correct 613 ms 22100 KB Output is correct
51 Correct 508 ms 22868 KB Output is correct
52 Correct 469 ms 23636 KB Output is correct
53 Correct 411 ms 21224 KB Output is correct
54 Correct 341 ms 22036 KB Output is correct
55 Correct 475 ms 22952 KB Output is correct
56 Correct 567 ms 23520 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 4 ms 9652 KB Output is correct
3 Correct 4 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 5 ms 9816 KB Output is correct
6 Correct 4 ms 9716 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9816 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 5 ms 9816 KB Output is correct
11 Correct 5 ms 9816 KB Output is correct
12 Correct 5 ms 9908 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 5 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 5 ms 9820 KB Output is correct
21 Correct 5 ms 9816 KB Output is correct
22 Correct 5 ms 9820 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 4 ms 9824 KB Output is correct
25 Correct 5 ms 9824 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9828 KB Output is correct
29 Correct 42 ms 9992 KB Output is correct
30 Correct 81 ms 9828 KB Output is correct
31 Correct 78 ms 9828 KB Output is correct
32 Correct 63 ms 9820 KB Output is correct
33 Correct 50 ms 9828 KB Output is correct
34 Correct 95 ms 9824 KB Output is correct
35 Correct 96 ms 9828 KB Output is correct
36 Correct 39 ms 9820 KB Output is correct
37 Correct 61 ms 10056 KB Output is correct
38 Correct 52 ms 9820 KB Output is correct
39 Correct 58 ms 9824 KB Output is correct
40 Correct 59 ms 9824 KB Output is correct
41 Correct 57 ms 9816 KB Output is correct
42 Correct 56 ms 9820 KB Output is correct
43 Correct 53 ms 9820 KB Output is correct
44 Correct 62 ms 9820 KB Output is correct
45 Correct 68 ms 9820 KB Output is correct
46 Correct 70 ms 10040 KB Output is correct
47 Correct 53 ms 10072 KB Output is correct
48 Correct 58 ms 9816 KB Output is correct
49 Correct 69 ms 9816 KB Output is correct
50 Correct 81 ms 9820 KB Output is correct
51 Correct 54 ms 10004 KB Output is correct
52 Correct 63 ms 9820 KB Output is correct
53 Correct 71 ms 9816 KB Output is correct
54 Correct 85 ms 9816 KB Output is correct
55 Incorrect 24 ms 13628 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9820 KB Output is correct
2 Correct 4 ms 9652 KB Output is correct
3 Correct 4 ms 9816 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 5 ms 9816 KB Output is correct
6 Correct 4 ms 9716 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 4 ms 9816 KB Output is correct
9 Correct 4 ms 9820 KB Output is correct
10 Correct 5 ms 9816 KB Output is correct
11 Correct 5 ms 9816 KB Output is correct
12 Correct 5 ms 9908 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 5 ms 9820 KB Output is correct
15 Correct 4 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 5 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 5 ms 9820 KB Output is correct
21 Correct 5 ms 9816 KB Output is correct
22 Correct 5 ms 9820 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 4 ms 9824 KB Output is correct
25 Correct 5 ms 9824 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 4 ms 9828 KB Output is correct
29 Correct 42 ms 9992 KB Output is correct
30 Correct 81 ms 9828 KB Output is correct
31 Correct 78 ms 9828 KB Output is correct
32 Correct 63 ms 9820 KB Output is correct
33 Correct 50 ms 9828 KB Output is correct
34 Correct 95 ms 9824 KB Output is correct
35 Correct 96 ms 9828 KB Output is correct
36 Correct 39 ms 9820 KB Output is correct
37 Correct 61 ms 10056 KB Output is correct
38 Correct 52 ms 9820 KB Output is correct
39 Correct 58 ms 9824 KB Output is correct
40 Correct 59 ms 9824 KB Output is correct
41 Correct 57 ms 9816 KB Output is correct
42 Correct 56 ms 9820 KB Output is correct
43 Correct 53 ms 9820 KB Output is correct
44 Correct 62 ms 9820 KB Output is correct
45 Correct 68 ms 9820 KB Output is correct
46 Correct 70 ms 10040 KB Output is correct
47 Correct 53 ms 10072 KB Output is correct
48 Correct 58 ms 9816 KB Output is correct
49 Correct 69 ms 9816 KB Output is correct
50 Correct 81 ms 9820 KB Output is correct
51 Correct 54 ms 10004 KB Output is correct
52 Correct 63 ms 9820 KB Output is correct
53 Correct 71 ms 9816 KB Output is correct
54 Correct 85 ms 9816 KB Output is correct
55 Correct 72 ms 21960 KB Output is correct
56 Correct 72 ms 22732 KB Output is correct
57 Correct 71 ms 23120 KB Output is correct
58 Correct 75 ms 21984 KB Output is correct
59 Correct 72 ms 21960 KB Output is correct
60 Correct 71 ms 20940 KB Output is correct
61 Correct 69 ms 21560 KB Output is correct
62 Correct 72 ms 22828 KB Output is correct
63 Correct 72 ms 21884 KB Output is correct
64 Correct 74 ms 22984 KB Output is correct
65 Correct 72 ms 20936 KB Output is correct
66 Correct 73 ms 21448 KB Output is correct
67 Correct 73 ms 22468 KB Output is correct
68 Correct 79 ms 23244 KB Output is correct
69 Correct 418 ms 22356 KB Output is correct
70 Correct 1016 ms 23240 KB Output is correct
71 Correct 949 ms 23632 KB Output is correct
72 Correct 116 ms 22416 KB Output is correct
73 Correct 125 ms 22464 KB Output is correct
74 Correct 357 ms 21928 KB Output is correct
75 Correct 573 ms 23376 KB Output is correct
76 Correct 613 ms 22100 KB Output is correct
77 Correct 508 ms 22868 KB Output is correct
78 Correct 469 ms 23636 KB Output is correct
79 Correct 411 ms 21224 KB Output is correct
80 Correct 341 ms 22036 KB Output is correct
81 Correct 475 ms 22952 KB Output is correct
82 Correct 567 ms 23520 KB Output is correct
83 Incorrect 24 ms 13628 KB Output isn't correct
84 Halted 0 ms 0 KB -