Submission #297806

#TimeUsernameProblemLanguageResultExecution timeMemory
297806ToMmyDongBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms384 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<int, ll> pil; typedef pair<ll, int> pli; typedef pair<double, double> pdd; #define SQ(i) ((i)*(i)) #define MEM(a, b) memset(a, (b), sizeof(a)) #define SZ(i) static_cast<int>(i.size()) #define FOR(i, j, k, in) for (int i=j; i < (k) ; i+=in) #define RFOR(i, j, k, in) for (int i=j; i >= (k) ; i-=in) #define REP(i, j) FOR(i, 0, j, 1) #define REP1(i, j) FOR(i, 1, j+1, 1) #define RREP(i, j) RFOR(i, j, 0, 1) #define ALL(_a) _a.begin(), _a.end() #define mp make_pair #define pb push_back #define eb emplace_back #define X first #define Y second template<typename T, typename S> istream &operator >> (istream &is, pair<T, S> &p) { return is >> p.X >> p.Y; } #ifdef tmd #define TIME(i) Timer i(#i) #define debug(...) do {\ fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\ _do(__VA_ARGS__);\ }while(0) template<typename T> void _do(T &&_x) {cerr<<_x<<endl;} template<typename T,typename ...S> void _do(T &&_x, S &&..._t) {cerr <<_x <<" ,"; _do(_t...);} template<typename _a,typename _b> ostream& operator << (ostream &_s, const pair<_a, _b> &_p) {return _s << "(" << _p.X << "," << _p.Y << ")";} template<typename It> ostream& _OUTC(ostream &_s, It _ita, It _itb) { _s << "{"; for (It _it=_ita; _it != _itb; _it++) { _s <<(_it == _ita?"":",")<< *_it; } _s << "}"; return _s; } template<typename _a> ostream &operator << (ostream &_s, const vector<_a> &_c) {return _OUTC(_s,ALL(_c));} template<typename _a> ostream &operator << (ostream &_s, const array<_a,2> &_c) {return _OUTC(_s, ALL(_c));} template<typename _a> ostream &operator << (ostream &_s, const array<_a,3> &_c) {return _OUTC(_s, ALL(_c));} template<typename _a> ostream &operator << (ostream &_s, const array<_a,4> &_c) {return _OUTC(_s, ALL(_c));} template<typename _a> ostream &operator << (ostream &_s, const array<_a,5> &_c) {return _OUTC(_s, ALL(_c));} template<typename _a> ostream &operator << (ostream &_s, const set<_a> &_c) {return _OUTC(_s, ALL(_c));} template<typename _a> ostream &operator << (ostream &_s, const deque<_a> &_c) {return _OUTC(_s, ALL(_c));} template<typename _a,typename _b> ostream &operator << (ostream &_s, const map<_a,_b> &_c) {return _OUTC(_s,ALL(_c));} template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;} #define IOS() class Timer { private: string scope_name; chrono::high_resolution_clock::time_point start_time; public: Timer (string name) : scope_name(name) { start_time = chrono::high_resolution_clock::now(); } ~Timer () { auto stop_time = chrono::high_resolution_clock::now(); auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count(); double mlength = double(length) * 0.001; debug(scope_name, mlength); } }; #else #define TIME(i) #define debug(...) #define pary(...) #define endl '\n' #define IOS() ios_base::sync_with_stdio(0);cin.tie(0) #endif #include "boxes.h" vector<ll> pre, suf; long long delivery(int N, int K, int L, int p[]) { pre.resize(N+2), suf.resize(N+2); for (int i=1; i<=N; i++) { pre[i] = min(p[i-1]*2, L) + pre[max(0, i-K)]; } for (int i=N; i>=1; i--) { suf[i] = min((L-p[i-1])%L*2, L) + suf[min(N+1, i+K)]; } ll ans = min(pre[N], suf[1]); for (int i=1; i<=N; i++) { ans = min(pre[i]+suf[i+1], ans); } debug(pre); debug(suf); 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...