Submission #655971

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
655971	2022-11-06 08:00:04	lunchbox1	The Potion of Great Power (CEOI20_potion)	C++17	100 / 100	2134 ms	29392 KiB

potion

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>
using namespace std;
 
const int N = 100000, B = 300;
 
int n, d, u, q, h[N];
vector<vector<tuple<int, int, int>>> ev[N];
vector<int> tt[N];
 
void init(int n_, int d_, int h_[]) {
 n = n_, d = d_;
 for (int i = 0; i < n; i++)
  h[i] = h_[i];
}
void curseChanges(int u_, int i_[], int j_[]) {
 u = u_;
 for (int k = 1; k <= u; k++) {
  int i = i_[k - 1], j = j_[k - 1];
  if (ev[i].size() == 0 || (int) ev[i].back().size() == B) {
   if (ev[i].size() == 0)
    ev[i].push_back({});
   else {
    sort(ev[i].back().begin(), ev[i].back().end());
    vector<pair<int, int>> v;
    for (auto [w, x, t] : ev[i].back())
     if (v.size() == 0 || v.back() != make_pair(w, x))
      v.push_back({w, x});
     else
      v.pop_back();
    ev[i].push_back({});
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 0
• Subtask 2: 17 / 17
• Subtask 3: 14 / 14
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 30 / 30