Submission #1200671

#TimeUsernameProblemLanguageResultExecution timeMemory
1200671AMel0nFinding Routers (IOI20_routers)C++20
100 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define FOR(i,N) for(ll i = 0; i < N; i++) #define all(x) (x).begin(), (x).end() #define F first #define S second #include "routers.h" vector<int> andy; void solve(int l, int r, int il, int ir) { // cout << l << ' ' << r << ' ' << il << ' ' << ir << endl; if (il >= ir) return; if (l == r-2) { andy[il] = l; // cout << il << ' ' << l << endl; return ; } int m = (l+r)/2; int im = use_detector(m); solve(l, m + 1, il, im); solve(m, r, im, ir); } vector<int> find_routers(int l, int n, int q) { andy.resize(n); solve(0, l+1, 0, n-1); vector<int> res(n); for(int i = 1; i < n; i++) res[i] = (andy[i-1]*2 - res[i-1]); return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...