Submission #422442

#TimeUsernameProblemLanguageResultExecution timeMemory
422442MarcoMeijerBoxes with souvenirs (IOI15_boxes)C++14
20 / 100
1 ms332 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()); // output template<class T1, class T2> void OUT(const pair<T1,T2>& x); template<class T> void OUT(const vector<T>& x); template<class T> void OUT(const T& x) {cout << x;} template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); } template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);} template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);} template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); } template<class H> void OUTLS(const H& h) {OUTL(h); } template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); } ll delivery(int N, int K, int L, int p[]) { ll i=0; ll n=N, k=K, l=L; ll ans = 1e18; vll a, b; a.resize(n+1,0), b.resize(n+1,0); ll res = 0; RE(i,n) { if((i%k) != 0) { res -= min<ll>(p[i-1], l - p[i-1]); } res += min<ll>(p[i], l - p[i]); if((i%k) == 0) { res += min<ll>(p[i], l - p[i]); } else { ll delta = abs(p[i] - p[i-1]); res += min<ll>(delta, l - delta); } a[i+1] = res; } reverse(p,p+n); res = 0; RE(i,n) { if((i%k) != 0) { res -= min<ll>(p[i-1], l - p[i-1]); } res += min<ll>(p[i], l - p[i]); if((i%k) == 0) { res += min<ll>(p[i], l - p[i]); } else { ll delta = abs(p[i] - p[i-1]); res += min<ll>(delta, l - delta); } b[i+1] = res; } reverse(p,p+n); RE(i,n+1) ans = min(ans, a[i] + b[n-i]); RE(i,n+1-k) ans = min(ans, a[i] + b[n-i-k] + l); return ans; }

Compilation message (stderr)

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:51:8: warning: declaration of 'i' shadows a previous local [-Wshadow]
   51 |     RE(i,n) {
      |        ^
boxes.cpp:16:28: note: in definition of macro 'REP'
   16 | #define REP(a,b,c) for(int a=int(b); a<int(c); a++)
      |                            ^
boxes.cpp:51:5: note: in expansion of macro 'RE'
   51 |     RE(i,n) {
      |     ^~
boxes.cpp:44:8: note: shadowed declaration is here
   44 |     ll i=0;
      |        ^
boxes.cpp:67:8: warning: declaration of 'i' shadows a previous local [-Wshadow]
   67 |     RE(i,n) {
      |        ^
boxes.cpp:16:28: note: in definition of macro 'REP'
   16 | #define REP(a,b,c) for(int a=int(b); a<int(c); a++)
      |                            ^
boxes.cpp:67:5: note: in expansion of macro 'RE'
   67 |     RE(i,n) {
      |     ^~
boxes.cpp:44:8: note: shadowed declaration is here
   44 |     ll i=0;
      |        ^
boxes.cpp:82:8: warning: declaration of 'i' shadows a previous local [-Wshadow]
   82 |     RE(i,n+1)
      |        ^
boxes.cpp:16:28: note: in definition of macro 'REP'
   16 | #define REP(a,b,c) for(int a=int(b); a<int(c); a++)
      |                            ^
boxes.cpp:82:5: note: in expansion of macro 'RE'
   82 |     RE(i,n+1)
      |     ^~
boxes.cpp:44:8: note: shadowed declaration is here
   44 |     ll i=0;
      |        ^
boxes.cpp:84:8: warning: declaration of 'i' shadows a previous local [-Wshadow]
   84 |     RE(i,n+1-k)
      |        ^
boxes.cpp:16:28: note: in definition of macro 'REP'
   16 | #define REP(a,b,c) for(int a=int(b); a<int(c); a++)
      |                            ^
boxes.cpp:84:5: note: in expansion of macro 'RE'
   84 |     RE(i,n+1-k)
      |     ^~
boxes.cpp:44:8: note: shadowed declaration is here
   44 |     ll i=0;
      |        ^
boxes.cpp:44:8: warning: unused variable 'i' [-Wunused-variable]
#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...