Submission #1203106

#TimeUsernameProblemLanguageResultExecution timeMemory
1203106countlessRainforest Jumps (APIO21_jumps)C++20
23 / 100
497 ms50520 KiB
#include "jumps.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; const ll MOD = 998244353; const ll INF = 1e18; const ld EPS = 1e-12; #define endl "\n" #define sp <<" "<< #define REP(i, a, b) for(ll i = a; i < b; i++) #define dbg(x) cout << #x << " = " << x << endl #define mp make_pair #define pb push_back #define fi first #define se second #define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) ((ll)(x).size()) struct custom_hash { static uint64_t splitmix64(uint64_t x) { // http://xorshift.di.unimi.it/splitmix64.c x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; template <typename Key, typename Value> using hash_map = unordered_map<Key, Value, custom_hash>; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // uniform_int_distribution<int>(a, b)(rng); // shuffle(all(a), rng); int n, logn = 20; vector<int> h; vector<vector<int>> l, r, b; void init(int N, vector<int> H) { n = N; h = H; h.insert(h.begin(), INT_MAX); h.insert(h.end(), INT_MAX); n += 2; l = r = b = vector<vector<int>>(logn, vector<int>(n)); stack<int> st; REP(i, 0, n) { while (!st.empty() and h[st.top()] <= h[i]) { st.pop(); } l[0][i] = st.empty() ? i : st.top(); st.push(i); } stack<int>().swap(st); for (int i = n-1; i >= 0; i--) { while (!st.empty() and h[st.top()] <= h[i]) { st.pop(); } r[0][i] = st.empty() ? i : st.top(); st.push(i); } REP(i, 0, n) { b[0][i] = h[l[0][i]] > h[r[0][i]] ? l[0][i] : r[0][i]; } REP(i, 1, logn) { REP(j, 0, n) { l[i][j] = l[i-1][ l[i-1][j] ]; r[i][j] = r[i-1][ r[i-1][j] ]; b[i][j] = b[i-1][ b[i-1][j] ]; } } } int minimum_jumps(int A, int B, int C, int D) { assert(A == B and C == D); ++A, ++B, ++C, ++D; int jumps = 0; for (int i = logn-1; i >= 0; i--) { if (h[b[i][B]] <= h[C]) { B = b[i][B]; jumps += (1 << i); } } if (h[l[0][B]] > h[C]) { for (int i = logn-1; i >= 0; i--) { if (h[r[i][B]] <= h[C]) { B = r[i][B]; jumps += (1 << i); } } } else { for (int i = logn-1; i >= 0; i--) { if (h[l[i][B]] <= h[C]) { B = l[i][B]; jumps += (1 << i); } } } return B == C ? jumps : -1; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...