Submission #1254600

#TimeUsernameProblemLanguageResultExecution timeMemory
1254600vpinxObstacles for a Llama (IOI25_obstacles)C++20
24 / 100
77 ms9916 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; vector<int> t, h; vector<int> nv1, 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]; 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) { return ((h[s] == h[d] and h[s] == 0) or nv1[d - 1] - nv1[s] == 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...