Submission #60724

#	Time	Username	Problem	Language	Result	Execution time	Memory
60724		Flugan42	Boxes with souvenirs (IOI15_boxes)	C++14	50 / 100	2039 ms	12708 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef long double lld;
#define rep(i,a,b) for(ll i = a; i < b; i++)
#define per(i,a,b) for(ll i = a; i >= b; i--)
#define all(x) x.begin(),x.end()
#define sz(x) (ll)(x).size()
#define trav(a,x) for(auto a : x)
#define inf 1000000000000000000
 
long long delivery(int N, int K, int L, int p[]) {
  ll best = inf,n = N,cur,res;
  vi a;
  rep(i,0,N) {
    if (p[i] == 0) n--;
    else a.push_back(p[i]);
  }
 
  rep(h,0,n+1) rep(v,0,n+1){
    if (h+v > n) break;
    ll l = n-h-v;
    res = ((l+K-1)/K)*L;
    cur = h-1;
    while(cur >= 0){
      res += a[cur]*2;
      cur -= K;
    }
    cur = n-v;
    while (cur < n){
      res += (L-a[cur])*2;
      cur += K;
    }
    best = min(best,res);
  }
 
  return best;
}
 

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30