oj.uz

답안 #1094135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094135 2024-09-28T15:10:14 Z Wjsc Joker (BOI20_joker) C++14
41 / 100
 1010 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;
        return;
      }
      if(col[v] == -1) dfs(v, c ^ 1);
    }
  }

  void solve() {
    while(q--) {
      int l, r; cin >> l >> r;

      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);
          if(ok) break;
        }

      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:129: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]
  129 |       for(int i = 1; i < queries[l].size(); ++i) {
      |                      ~~^~~~~~~~~~~~~~~~~~~
Joker.cpp: In function 'int main()':
Joker.cpp:153:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  153 |     freopen("task.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:154:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  154 |     freopen("task.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9868 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9700 KB Output is correct
7 Correct 5 ms 10072 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 5 ms 9820 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 4 ms 9828 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9908 KB Output is correct
15 Correct 4 ms 9744 KB Output is correct
16 Correct 4 ms 9816 KB Output is correct
17 Correct 4 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 5 ms 9816 KB Output is correct
21 Correct 4 ms 9672 KB Output is correct
22 Correct 5 ms 9764 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 5 ms 9696 KB Output is correct
25 Correct 4 ms 9792 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 5 ms 9828 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9868 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9700 KB Output is correct
7 Correct 5 ms 10072 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 5 ms 9820 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 4 ms 9828 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9908 KB Output is correct
15 Correct 4 ms 9744 KB Output is correct
16 Correct 4 ms 9816 KB Output is correct
17 Correct 4 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 5 ms 9816 KB Output is correct
21 Correct 4 ms 9672 KB Output is correct
22 Correct 5 ms 9764 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 5 ms 9696 KB Output is correct
25 Correct 4 ms 9792 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 5 ms 9828 KB Output is correct
29 Runtime error 14 ms 23248 KB Execution killed with signal 11
30 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 67 ms 21992 KB Output is correct
4 Correct 75 ms 22740 KB Output is correct
5 Correct 72 ms 23212 KB Output is correct
6 Correct 72 ms 21912 KB Output is correct
7 Correct 70 ms 22000 KB Output is correct
8 Correct 71 ms 20940 KB Output is correct
9 Correct 68 ms 21540 KB Output is correct
10 Correct 73 ms 22688 KB Output is correct
11 Correct 73 ms 21928 KB Output is correct
12 Correct 71 ms 22988 KB Output is correct
13 Correct 69 ms 20936 KB Output is correct
14 Correct 70 ms 21456 KB Output is correct
15 Correct 72 ms 22432 KB Output is correct
16 Correct 71 ms 23240 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9868 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9700 KB Output is correct
7 Correct 5 ms 10072 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 5 ms 9820 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 4 ms 9828 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9908 KB Output is correct
15 Correct 4 ms 9744 KB Output is correct
16 Correct 4 ms 9816 KB Output is correct
17 Correct 4 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 5 ms 9816 KB Output is correct
21 Correct 4 ms 9672 KB Output is correct
22 Correct 5 ms 9764 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 5 ms 9696 KB Output is correct
25 Correct 4 ms 9792 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 5 ms 9828 KB Output is correct
29 Correct 67 ms 21992 KB Output is correct
30 Correct 75 ms 22740 KB Output is correct
31 Correct 72 ms 23212 KB Output is correct
32 Correct 72 ms 21912 KB Output is correct
33 Correct 70 ms 22000 KB Output is correct
34 Correct 71 ms 20940 KB Output is correct
35 Correct 68 ms 21540 KB Output is correct
36 Correct 73 ms 22688 KB Output is correct
37 Correct 73 ms 21928 KB Output is correct
38 Correct 71 ms 22988 KB Output is correct
39 Correct 69 ms 20936 KB Output is correct
40 Correct 70 ms 21456 KB Output is correct
41 Correct 72 ms 22432 KB Output is correct
42 Correct 71 ms 23240 KB Output is correct
43 Correct 403 ms 22296 KB Output is correct
44 Correct 1010 ms 23116 KB Output is correct
45 Correct 943 ms 23632 KB Output is correct
46 Correct 116 ms 22420 KB Output is correct
47 Correct 125 ms 22356 KB Output is correct
48 Correct 347 ms 22100 KB Output is correct
49 Correct 557 ms 23380 KB Output is correct
50 Correct 607 ms 22024 KB Output is correct
51 Correct 524 ms 22880 KB Output is correct
52 Correct 458 ms 23636 KB Output is correct
53 Correct 418 ms 21328 KB Output is correct
54 Correct 341 ms 22096 KB Output is correct
55 Correct 468 ms 22868 KB Output is correct
56 Correct 564 ms 23580 KB Output is correct

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9868 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9700 KB Output is correct
7 Correct 5 ms 10072 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 5 ms 9820 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 4 ms 9828 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9908 KB Output is correct
15 Correct 4 ms 9744 KB Output is correct
16 Correct 4 ms 9816 KB Output is correct
17 Correct 4 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 5 ms 9816 KB Output is correct
21 Correct 4 ms 9672 KB Output is correct
22 Correct 5 ms 9764 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 5 ms 9696 KB Output is correct
25 Correct 4 ms 9792 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 5 ms 9828 KB Output is correct
29 Runtime error 14 ms 23248 KB Execution killed with signal 11
30 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 4 ms 9820 KB Output is correct
3 Correct 4 ms 9868 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 4 ms 9820 KB Output is correct
6 Correct 5 ms 9700 KB Output is correct
7 Correct 5 ms 10072 KB Output is correct
8 Correct 4 ms 9820 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 5 ms 9820 KB Output is correct
11 Correct 4 ms 9820 KB Output is correct
12 Correct 4 ms 9828 KB Output is correct
13 Correct 5 ms 9820 KB Output is correct
14 Correct 4 ms 9908 KB Output is correct
15 Correct 4 ms 9744 KB Output is correct
16 Correct 4 ms 9816 KB Output is correct
17 Correct 4 ms 9820 KB Output is correct
18 Correct 5 ms 9824 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 5 ms 9816 KB Output is correct
21 Correct 4 ms 9672 KB Output is correct
22 Correct 5 ms 9764 KB Output is correct
23 Correct 4 ms 9820 KB Output is correct
24 Correct 5 ms 9696 KB Output is correct
25 Correct 4 ms 9792 KB Output is correct
26 Correct 4 ms 9824 KB Output is correct
27 Correct 4 ms 9820 KB Output is correct
28 Correct 5 ms 9828 KB Output is correct
29 Runtime error 14 ms 23248 KB Execution killed with signal 11
30 Halted 0 ms 0 KB -