oj.uz

Submission #587650

# Submission time Handle Problem Language Result Execution time Memory
587650 2022-07-02T07:41:50 Z MilosMilutinovic The Potion of Great Power (CEOI20_potion) C++14
56 / 100
 3000 ms 146860 KB 
/**
 *    author:  wxhtzdy
 *    created: 01.07.2022 22:14:54
**/
#include <bits/stdc++.h>

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}
string to_string(const char* s) {
  return to_string((string) s);
}
string to_string(bool b) {
  return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int MAX = 200005;
const int MAGIC = 30;
               
int a[MAX], p[MAX], q[MAX];
int order[MAX], id[MAX];        
vector<int> qs[MAX];
vector<set<int>> my[MAX];

void init(int n, int d, int h[]) {
  for (int i = 0; i < n; i++) {
    a[i] = h[i];
    order[i] = i;
  }             
  sort(order, order + n, [&](int i, int j) {
    return a[i] < a[j];
  });
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    id[order[i]] = i;
  }
}

void curseChanges(int u, int a[], int b[]) {
  for (int i = 0; i < u; i++) {
    a[i] = id[a[i]];
    b[i] = id[b[i]];
    qs[a[i]].push_back(i);
    qs[b[i]].push_back(i);
    p[i] = a[i];
    q[i] = b[i];
  }                   
  for (int i = 0; i < MAX; i++) {
    if (qs[i].empty()) {
      continue;
    }
    set<int> st;                      
    for (int j = 0; j < (int) qs[i].size(); j++) {
      int he = (i ^ p[qs[i][j]] ^ q[qs[i][j]]);
      if (st.find(he) != st.end()) {
        st.erase(st.find(he));
      } else {
        st.insert(he);
      }
      if (j % MAGIC == 0) {
        my[i].push_back(st);
      }
    }
  }
}

int question(int x, int y, int v) {
  --v;
  x = id[x];
  y = id[y];
  vector<int> xs;
  vector<int> ys;                     
  {
    int i = lower_bound(qs[x].begin(), qs[x].end(), v + 1) - qs[x].begin();
    --i;           
    if (i >= 0) {
      set<int> st = my[x][i / MAGIC];
      for (int j = (i / MAGIC) * MAGIC + 1; j <= i; j++) {
        int he = (x ^ p[qs[x][j]] ^ q[qs[x][j]]);
        if (st.find(he) != st.end()) {
          st.erase(st.find(he));
        } else {
          st.insert(he);
        }
      }
      for (int j : st) {
        xs.push_back(a[j]);
      }
    }
  }
  {
    int i = lower_bound(qs[y].begin(), qs[y].end(), v + 1) - qs[y].begin();
    --i;     
    if (i >= 0) {
      set<int> st = my[y][i / MAGIC];
      for (int j = (i / MAGIC) * MAGIC + 1; j <= i; j++) {
        int he = (y ^ p[qs[y][j]] ^ q[qs[y][j]]);
        if (st.find(he) != st.end()) {
          st.erase(st.find(he));
        } else {
          st.insert(he);
        }
      }
      for (int j : st) {
        ys.push_back(a[j]);
      }
    }
  }
  assert((int) xs.size() <= 500);
  assert((int) ys.size() <= 500);
  int ptr = 0;
  int ans = 1e9;
  for (int i = 0; i < (int) xs.size(); i++) {
    while (ptr + 1 < (int) ys.size() && xs[i] > ys[ptr]) {
      ptr += 1;
    }   
    if (ptr < (int) ys.size()) {
      ans = min(ans, abs(xs[i] - ys[ptr]));
    }
    if (ptr > 0) {
      ans = min(ans, abs(xs[i] - ys[ptr - 1]));
    }
  }
  return ans;  
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9680 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9808 KB Output is correct
2 Correct 7 ms 9808 KB Output is correct
3 Correct 7 ms 9808 KB Output is correct
4 Correct 39 ms 11548 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 264 ms 29340 KB Output is correct
2 Correct 258 ms 29272 KB Output is correct
3 Correct 303 ms 23108 KB Output is correct
4 Correct 1562 ms 94428 KB Output is correct
5 Correct 579 ms 30692 KB Output is correct
6 Execution timed out 3057 ms 140128 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 29348 KB Output is correct
2 Correct 2529 ms 146860 KB Output is correct
3 Correct 1310 ms 83752 KB Output is correct
4 Correct 2685 ms 139444 KB Output is correct
5 Correct 399 ms 35848 KB Output is correct
6 Correct 2484 ms 139664 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 11220 KB Output is correct
2 Correct 171 ms 10396 KB Output is correct
3 Correct 272 ms 10456 KB Output is correct
4 Correct 888 ms 13088 KB Output is correct
5 Correct 926 ms 12692 KB Output is correct
6 Correct 189 ms 10064 KB Output is correct
7 Correct 754 ms 12112 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 7 ms 9808 KB Output is correct
3 Correct 7 ms 9808 KB Output is correct
4 Correct 7 ms 9808 KB Output is correct
5 Correct 39 ms 11548 KB Output is correct
6 Correct 264 ms 29340 KB Output is correct
7 Correct 258 ms 29272 KB Output is correct
8 Correct 303 ms 23108 KB Output is correct
9 Correct 1562 ms 94428 KB Output is correct
10 Correct 579 ms 30692 KB Output is correct
11 Execution timed out 3057 ms 140128 KB Time limit exceeded
12 Halted 0 ms 0 KB -