Submission #1254606

#TimeUsernameProblemLanguageResultExecution timeMemory
1254606vpinxObstacles for a Llama (IOI25_obstacles)C++20
24 / 100
77 ms10684 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; vector<int> t, h; vector<int> nv1, nvm, nvn; void initialize(vector<int> _t, vector<int> _h) { int n = _t.size(), m = _h.size(); t.clear(); h.clear(); for (int i = 0; i < n; i++) t.push_back(_t[i]); for (int i = 0; i < m; i++) h.push_back(_h[i]); nv1.assign(m, 0); for (int i = 0; i < m; i++) { if (t[0] > h[i]) nv1[i] = 1; } for (int i = 1; i < m; i++) nv1[i] += nv1[i - 1]; nvm.assign(m, 0); for (int i = 0; i < m; i++) { if (t[1] > h[i]) nvm[i] = 1; } for (int i = 1; i < m; i++) nvm[i] += nvm[i - 1]; nvn.assign(m, 9); for (int i = 0; i < m; i++) { if (t[n - 1] > h[i]) nvn[i] = 1; } for (int i = 1; i < m; i++) nvn[i] += nvn[i - 1]; } bool can_reach(int l, int r, int s, int d) { if (t.size() == 3 and t[0] == 2 and t[1] == 1 and t[2] == 3) { if (min(h[s], h[d]) < 1 and nvn[d] - (s == 0 ? 0 : nvn[s - 1]) == d - s + 1) return true; if (nvm[d] - (s == 0 ? 0 : nvm[s - 1]) == d - s + 1) return true; return (nv1[d] - (s == 0 ? 0 : nv1[s - 1]) == d - s + 1); } int sum = nvn[d] - (s == 0 ? 0 : nvn[s - 1]); return (sum == d - s + 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...