제출 #790579

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
790579	2023-07-22 21:32:44	hugo_pm	Worst Reporter 4 (JOI21_worst_reporter4)	C++17	14 / 100	2051 ms	27512 KiB

worst_reporter2

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
#include <bits/stdc++.h>
// Begin treap.h
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Croix {
  ll key, val;
  bool operator<(const Croix& oth) const {
    if (key != oth.key)
      return key < oth.key;
    return val < oth.val; // ├á v├®rifier + INF ou -INF dans merge ?
  }
};
string to_string(Croix c) {
  return "(" + to_string(c.key) + ", " + to_string(c.val) + ")";
}
struct Treap { // bourrin
  set<Croix> s;
  size_t size() { return s.size(); }
  void swap(Treap &oth) { return s.swap(oth.s); }
  void clear() { s.clear(); }
  struct iterator {
    using iterator_category = std::bidirectional_iterator_tag;
    using difference_type   = set<Croix>::iterator::difference_type; // ptrdiff_t?
    using value_type        = const Croix;
    using pointer           = set<Croix>::iterator;
    using reference         = const Croix&;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 0 / 65
• Subtask 3: 0 / 21