제출 #757228

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
757228		Sam_a17	The Potion of Great Power (CEOI20_potion)	C++17	38 / 100	1922 ms	262144 KiB

potion

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <atcoder/all>
#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 pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
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(unsigned long long t) {cerr << t;}
void print(long double 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> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} 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 random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// 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};
 
long long ka() {
	long long x = 0;
	bool z = false;
	while (1)
	{
		char y = getchar();
		if (y == '-')
			z = true;
		else if ('0' <= y && y <= '9')
			x = x * 10 + y - '0';
		else
		{
			if (z)
				x *= -1;
			return x;
		}
	}
}
 
// 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);
  // }else {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "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 inf = 1e9;
const int N = 3e5 + 10;
int n, d, h[N];
int u, a[N], b[N];

int t[5 * N], sz;
map<int, vector<int>> mp[5 * 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 upd(int l, int r, int xi, int yi, int x, int lx, int rx) {
  if(lx >= r || rx <= l) {
    return;
  }
  
  if(lx >= l && rx <= r) {
    mp[x][xi].push_back(yi);
    mp[x][yi].push_back(xi);
    return;
  }

  int mid = (lx + rx) / 2;
  upd(l, r, xi, yi, 2 * x + 1, lx, mid);
  upd(l, r, xi, yi, 2 * x + 2, mid, rx);
}


set<int> stt[N];

void qry(int u, int xi, int x, int lx, int rx) {
  if(mp[x].find(xi) != mp[x].end()) {
    for(auto i: mp[x][xi]) {
      stt[xi].insert(h[i]);
    }
  }

  if(rx - lx == 1) {
    return;
  }

  int mid = (lx + rx) / 2;
  if(u < mid) {
    qry(u, xi, 2 * x + 1, lx, mid);
  } else {
    qry(u, xi, 2 * x + 2, mid, rx);
  }
}

void iniit(int s) {
  sz = 1;
  while(sz < s) {
    sz *= 2;
  }
}

void curseChanges(int U, int A[], int B[]) {
  u = U;
  iniit(u);

  map<pair<int, int>, int> open;
  for(int i = 0; i < u; i++) {
    a[i] = A[i], b[i] = B[i];
    if(a[i] > b[i]) swap(a[i], b[i]);

    if(open.find({a[i], b[i]}) != open.end()) {
      upd(open[{a[i], b[i]}], i, a[i], b[i], 0, 0, sz);
      open.erase({a[i], b[i]});
    } else {
      open[{a[i], b[i]}] = i;
    }
  }

  for(auto i: open) {
    upd(i.second, u, i.first.first, i.first.second, 0, 0, sz);
  }
}
 
int question(int x, int y, int v) {
  qry(v - 1, x, 0, 0, sz);
  qry(v - 1, y, 0, 0, sz);

  if(stt[x].empty() || stt[y].empty()) {
    stt[x].clear();
    stt[y].clear();
    return inf;
  } 

  int ans = inf;
  auto it = stt[y].begin();
  int lst = *stt[y].rbegin();
  
  for(auto i: stt[x]) {
    while(it != stt[y].end() && *it <= i) {
      ans = min(ans, abs(*it - i));
      it = next(it);
    }

    if(it != stt[y].end()) {
      ans = min(ans, abs(*it - i));
    }

    if(it != stt[y].begin()) {
      ans = min(ans, abs(*prev(it) - i));
    }

    ans = min(ans, abs(i - lst));
  }

  stt[x].clear();
  stt[y].clear();
  return ans;
}

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