Submission #1200323

#TimeUsernameProblemLanguageResultExecution timeMemory
1200323MinaRagy06Finding Routers (IOI20_routers)C++20
100 / 100
1 ms328 KiB
#include <bits/stdc++.h> #ifdef MINA #include "grader.cpp" #endif #include "routers.h" using namespace std; #define ll long long #define SZ(x) (int) x.size() vector<int> a; void rec(int l, int r, int s, int e) { if (s > e) return; if (l == r) { a[s] = l; return; } int md = ((l + r) >> 1); int vmd = use_detector(md + 1); rec(l, md, s, vmd - 1); rec(md + 1, r, vmd, e); } vector<int> find_routers(int len, int n, int q) { a.resize(n); rec(1, len - 1, 0, n - 2); a[n - 1] = len; vector<int> p(n); p[0] = 0; for (int i = 1; i < n; i++) { p[i] = a[i - 1] + (a[i - 1] - p[i - 1]); } return p; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...