Submission #422132

#TimeUsernameProblemLanguageResultExecution timeMemory
422132MarcoMeijerBoxes with souvenirs (IOI15_boxes)C++14
50 / 100
2076 ms13752 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; // macros typedef long long ll; typedef long double ld; typedef pair<int, int> ii; typedef pair<ll, ll> lll; typedef tuple<int, int, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<iii> viii; typedef vector<ll> vll; typedef vector<lll> vlll; #define REP(a,b,c) for(int a=int(b); a<int(c); a++) #define RE(a,c) REP(a,0,c) #define RE1(a,c) REP(a,1,c+1) #define REI(a,b,c) REP(a,b,c+1) #define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--) #define FOR(a,b) for(auto& a : b) #define all(a) a.begin(), a.end() #define INF 1e9 #define EPS 1e-9 #define pb push_back #define popb pop_back #define fi first #define se second #define sz size() mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); ll delivery(int n, int k, int l, int p[]) { ll i=0; ll ans = 0; if(k == 1 || k == n) { while(i < n) { ll cur = 0; RE(j,k) { if(i == n) break; ll delta = abs(cur - p[i]); ans += min(delta, l-delta); cur = p[i++]; } ans += min(cur, l-cur); } } else { ans = 1e18; RE(x,k) { ll cAns = 0; i = 0; while(i < n) { ll cur = 0; RE(j,k) { if(i == n) break; ll delta = abs(cur - p[(i+x)%n]); cAns += min(delta, l-delta); cur = p[(i+x)%n]; i++; } cAns += min(cur, l-cur); } ans = min(ans, cAns); } } return ans; }
#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...