제출 #996200

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
996200	2024-06-10 08:44:03	IBory	Abracadabra (CEOI22_abracadabra)	C++17	100 / 100	850 ms	65168 KiB

Main

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>
#define pii pair<int, int>
using namespace std;
const int SZ = 1 << 18;
int A[SZ], B[SZ], R[SZ], IB[SZ], ans[1000007];
struct Seg {
  int T[SZ << 1];
  void Update(int i, int v) {
    T[i += SZ - 1] = v;
    while (i >>= 1) T[i] = T[i * 2] + T[i * 2 + 1];
  }
  pii Query(int k) {
    int sL = 1, sR = SZ, n = 1;
    while (sL != sR) {
      int mid = (sL + sR) >> 1;
      if (k <= T[n * 2]) sR = mid, n = n * 2;
      else sL = mid + 1, k -= T[n * 2], n = n * 2 + 1;
    }
    return {sL, k};
  }
} T;
int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int N, Q;
  cin >> N >> Q;
  for (int i = 1; i <= N; ++i) cin >> A[i];
  map<int, vector<pii>> P;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 25 / 25
• Subtask 4: 25 / 25