oj.uz

답안 #719406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719406 2023-04-05T21:38:32 Z Sam_a17 Joker (BOI20_joker) C++17
41 / 100
 1472 ms 44604 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 blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
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(long double t) {cerr << t;}
void print(unsigned long long 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, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } 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(deque <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;
int n, m, q, last[N];
int p[N], sz[N], add[N];
int bip;
 
stack<pair<pair<int, int>, pair<int, int>>> st;
 
 
// dsu
void init() {
  bip = 0;
  for(int i = 1; i <= n; i++) {
    p[i] = i, sz[i] = 1;
    add[i] = 0;
  }
}
 
int find(int a) {
  if(a != p[a]) {
    return find(p[a]);
  }
  return p[a];
}
 
int find_sum(int a) {
  if(a != p[a]) {
    return add[a] + find_sum(p[a]);
  }
  return add[a];
}
 
int same(int a, int b) {
  if(find(a) == find(b)) {
    return 1;
  }
  return 0;
}
 
int get_color(int node) {
  int sx = find_sum(node);
  int colx = 1;
  if(sx % 2) colx = 2;
  return colx;
}
 
int merge(int a, int b, int t) {
  if(a == -1) {
    return 0;
  }
 
  int x = a, y = b;
  a = find(a), b = find(b);
 
  if(same(a, b)) {
    int colx = get_color(x), coly = get_color(y);
    int last_bip = bip;
    if(colx == coly) {
      bip = 1;
    }
    // st.push({{0, last_bip}, {a, b}});
    return 0;
  }
  
  if(sz[b] > sz[a]) {
    swap(a, b);
  }
 
  int colx = get_color(x), coly = get_color(y);
  int okk = 0;
  if(colx == coly) {
    add[b]++;
    okk++;
  }
 
  add[b] -= add[a];
  p[b] = a, sz[a] += sz[b];
  // st.push({{okk, bip}, {a, b}});
  return 1;
}
 
void rollback() {
  if (!st.empty()) {
    auto u = st.top().second;
    int a = u.first, b = u.second;
    sz[a] -= sz[b], p[b] = b;
    add[b] += add[a];
    add[b] -= st.top().first.first;
    bip = st.top().first.second;
    st.pop();
  }
}
 
vector<int> lst;
vector<pair<int, int>> edges;
 
int timer = 0;

bool answ[305][N];

void rec(int l, int r, int L, int R) {
  if(l > r) {
    return;
  }
 
  int mid = (l + r) / 2;
 
  for(int i = l; i < mid; i++) {
    merge(edges[i].first, edges[i].second, timer++);
  }
 
  int opt = R + 1;
  for(int i = R; i >= L && i >= mid; i--) {
    merge(edges[i].first, edges[i].second, timer++);
    if(bip || i == mid) {
      opt = i;
      rollback();
      break;
    }
  }
 
  last[mid] = opt;
  opt = min(opt, R);
 
  for(int i = R; i > opt; i--) {
    rollback();
  }
 
  for(int i = l; i < mid; i++) {
    rollback();
  }
 
  for(int i = R; i > opt; i--) {
    merge(edges[i].first, edges[i].second, timer++);
  }
 
  rec(l, mid - 1, L, opt);
 
  for(int i = R; i > opt; i--) {
    rollback();
  }
 
  for(int i = l; i <= mid; i++) {
    merge(edges[i].first, edges[i].second, timer++);
  }
 
  rec(mid + 1, r, max(opt, mid + 1), R);
 
  for(int i = l; i <= mid; i++) {
    rollback();
  }
}
 
void solve_() {
  cin >> n >> m >> q;
 
  edges.emplace_back(-1, -1);
  for(int i = 1; i <= m; i++) {
    int a, b; cin >> a >> b;
    edges.emplace_back(a, b);
  }
  edges.emplace_back(-1, -1);
 
  // rec(1, m, 1, m);
  for(int j = 1; j <= min(m, 201); j++) {
    init();
    for(int i = 1; i < j; i++) {
      if(!bip) {
        merge(edges[i].first, edges[i].second, timer++);
      }
    }

    answ[j][m + 1] = bip;
    for(int i = m; i >= j; i--) {
      if(!bip) {
        merge(edges[i].first, edges[i].second, timer++);
      }
      answ[j][i] = bip;
    }
  }

  //
  for(int i = 1; i <= q; i++) {
    int l, r; cin >> l >> r;

    if(answ[l][r + 1]) {
      cout << "YES" << '\n';
    } else {
      cout << "NO" << '\n';
    }
  }
 
}
 
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

Joker.cpp: In function 'int merge(int, int, int)':
Joker.cpp:125:9: warning: unused variable 'last_bip' [-Wunused-variable]
  125 |     int last_bip = bip;
      |         ^~~~~~~~
Joker.cpp: In function 'void setIO(std::string)':
Joker.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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Joker.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
6.0 / 6.0

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

Subtask #2
0 / 8.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 605 ms 43240 KB Output is correct
4 Correct 1452 ms 44320 KB Output is correct
5 Correct 242 ms 44096 KB Output is correct
6 Correct 205 ms 43144 KB Output is correct
7 Correct 204 ms 43124 KB Output is correct
8 Correct 420 ms 42772 KB Output is correct
9 Correct 489 ms 43208 KB Output is correct
10 Correct 931 ms 44604 KB Output is correct
11 Correct 755 ms 43280 KB Output is correct
12 Correct 775 ms 44044 KB Output is correct
13 Correct 761 ms 42156 KB Output is correct
14 Correct 430 ms 42720 KB Output is correct
15 Correct 733 ms 43584 KB Output is correct
16 Correct 906 ms 44308 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 1 ms 1236 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 1 ms 1236 KB Output is correct
25 Correct 1 ms 1236 KB Output is correct
26 Correct 1 ms 1236 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 605 ms 43240 KB Output is correct
30 Correct 1452 ms 44320 KB Output is correct
31 Correct 242 ms 44096 KB Output is correct
32 Correct 205 ms 43144 KB Output is correct
33 Correct 204 ms 43124 KB Output is correct
34 Correct 420 ms 42772 KB Output is correct
35 Correct 489 ms 43208 KB Output is correct
36 Correct 931 ms 44604 KB Output is correct
37 Correct 755 ms 43280 KB Output is correct
38 Correct 775 ms 44044 KB Output is correct
39 Correct 761 ms 42156 KB Output is correct
40 Correct 430 ms 42720 KB Output is correct
41 Correct 733 ms 43584 KB Output is correct
42 Correct 906 ms 44308 KB Output is correct
43 Correct 626 ms 43100 KB Output is correct
44 Correct 1472 ms 44444 KB Output is correct
45 Correct 1381 ms 44324 KB Output is correct
46 Correct 199 ms 43192 KB Output is correct
47 Correct 184 ms 43116 KB Output is correct
48 Correct 587 ms 43400 KB Output is correct
49 Correct 904 ms 44480 KB Output is correct
50 Correct 868 ms 42828 KB Output is correct
51 Correct 781 ms 43628 KB Output is correct
52 Correct 738 ms 44244 KB Output is correct
53 Correct 544 ms 42172 KB Output is correct
54 Correct 532 ms 42980 KB Output is correct
55 Correct 715 ms 43656 KB Output is correct
56 Correct 901 ms 44224 KB Output is correct

Subtask #5
0 / 22.0

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

Subtask #6
0 / 29.0

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