#866355 (C++14) No.2292 Interval Union Find

• 問題: No.2292 Interval Union Find
• ユーザー: SSRS
• 提出日時: 2023-05-05 21:55:03
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,122 bytes
• コンパイル時間: 2,215 ms
• コンパイル使用メモリ: 179,656 KB
• 実行使用メモリ: 22,272 KB
• 最終ジャッジ日時: 2024-11-23 07:19:28
• 合計ジャッジ時間: 27,367 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 4
other	AC * 19 WA * 25

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, Q;
  cin >> N >> Q;
  map<int, int> mp;
  mp[0] = 0;
  mp[N] = 0;
  for (int i = 0; i < Q; i++){
    int t;
    cin >> t;
    if (t == 1){
      int L, R;
      cin >> L >> R;
      for (int j : {L, R}){
        if (mp.count(j) == 0){
          auto itr = prev(mp.lower_bound(j));
          int x = (*itr).second;
          mp[j] = x;
        }
      }
      while (true){
        auto itr = mp.lower_bound(L);
        int p1 = (*itr).first;
        if (p1 == R){
          break;
        }
        mp.erase(itr);
      }
      mp[L] = 1;
      for (int j : {L, R}){
        auto itr = mp.lower_bound(j);
        if ((*itr).second == (*prev(itr)).second){
          mp.erase(itr);
        }
      }
    }
    if (t == 2){
      int L, R;
      cin >> L >> R;
      for (int j : {L, R}){
        if (mp.count(j) == 0){
          auto itr = prev(mp.lower_bound(j));
          int x = (*itr).second;
          mp[j] = x;
        }
      }
      while (true){
        auto itr = mp.lower_bound(L);
        int p1 = (*itr).first;
        if (p1 == R){
          break;
        }
        mp.erase(itr);
      }
      mp[L] = 0;
      for (int j : {L, R}){
        auto itr = mp.lower_bound(j);
        if ((*itr).second == (*prev(itr)).second){
          mp.erase(itr);
        }
      }
    }
    if (t == 3){
      int u, v;
      cin >> u >> v;
      if (u == v){
        cout << 1 << endl;
      } else {
        if (u > v){
          swap(u, v);
        }
        v--;
        auto itr = prev(mp.upper_bound(u));
        if ((*itr).second == 1 && (*next(itr)).first >= v){
          cout << 1 << endl;
        } else {
          cout << 0 << endl;
        }
      }
    }
    if (t == 4){
      int v;
      cin >> v;
      auto itr = prev(mp.lower_bound(v));
      if ((*itr).second == 0){
        if ((*next(itr)).first == v){
          cout << (*next(itr, 2)).first - (*next(itr)).first + 1 << endl;
        } else {
          cout << 1 << endl;
        }
      } else {
        cout << (*next(itr)).first - (*itr).first + 1 << endl;
      }
    }
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX