Submission #587425

#TimeUsernameProblemLanguageResultExecution timeMemory
587425MilosMilutinovicThe Potion of Great Power (CEOI20_potion)C++14
38 / 100
885 ms262144 KiB
/** * 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 = 300; int a[MAX], p[MAX], q[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]; } } void curseChanges(int u, int a[], int b[]) { for (int i = 0; i < u; 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 ((int) qs[i].size() <= MAGIC) { continue; } set<int> st; for (int j : qs[i]) { int he = (i ^ p[j] ^ q[j]); if (st.find(he) != st.end()) { st.erase(st.find(he)); } else { st.insert(he); } my[i].push_back(st); } } } int question(int x, int y, int v) { --v; vector<int> xs; vector<int> ys; if ((int) qs[x].size() <= MAGIC) { set<int> st; for (int i = 0; i < (int) qs[x].size(); i++) { if (qs[x][i] > v) { break; } int he = (x ^ p[qs[x][i]] ^ q[qs[x][i]]); if (st.find(he) != st.end()) { st.erase(st.find(he)); } else { st.insert(he); } } debug(st); for (int i : st) { xs.push_back(a[i]); } sort(xs.begin(), xs.end()); } else { int i = lower_bound(qs[x].begin(), qs[x].end(), v + 1) - qs[x].begin(); --i; if (i >= 0 && i < (int) my[x].size()) { for (int vv : my[x][i]) { xs.push_back(a[vv]); } } sort(xs.begin(), xs.end()); } if ((int) qs[y].size() <= MAGIC) { set<int> st; for (int i = 0; i < (int) qs[y].size(); i++) { if (qs[y][i] > v) { break; } int he = (y ^ p[qs[y][i]] ^ q[qs[y][i]]); if (st.find(he) != st.end()) { st.erase(st.find(he)); } else { st.insert(he); } } for (int i : st) { ys.push_back(a[i]); } sort(ys.begin(), ys.end()); } else { int i = lower_bound(qs[y].begin(), qs[y].end(), v + 1) - qs[y].begin(); --i; if (i >= 0 && i < (int) my[y].size()) { for (int vv : my[y][i]) { ys.push_back(a[vv]); } } sort(ys.begin(), ys.end()); } debug(xs); debug(ys); 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; } for (int j = -1; j <= 1; j++) { int idx = ptr + j; if (idx >= 0 && idx < (int) ys.size()) { ans = min(ans, abs(xs[i] - ys[idx])); } } } return ans; }

Compilation message (stderr)

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:45:20: warning: statement has no effect [-Wunused-value]
   45 | #define debug(...) 42
      |                    ^~
potion.cpp:102:5: note: in expansion of macro 'debug'
  102 |     debug(st);
      |     ^~~~~
potion.cpp:45:20: warning: statement has no effect [-Wunused-value]
   45 | #define debug(...) 42
      |                    ^~
potion.cpp:144:3: note: in expansion of macro 'debug'
  144 |   debug(xs);
      |   ^~~~~
potion.cpp:45:20: warning: statement has no effect [-Wunused-value]
   45 | #define debug(...) 42
      |                    ^~
potion.cpp:145:3: note: in expansion of macro 'debug'
  145 |   debug(ys);
      |   ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...