Submission #424828

#	Time	Username	Problem	Language	Result	Execution time	Memory
424828		ollel	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	3 ms	460 KiB

boxes

#include <bits/stdc++.h>
#include <iostream>
#include "boxes.h"
using namespace std;

#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
#define lso(x) x&(-x)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;

int n, k, l;
vi p;
vi pos;

ll min(ll a, int b) {return min(a, (ll)b);}

ll kone() {
  ll ans = 0;
  rep(i,0,n) {
    ans += 2*min(pos[i], l - pos[i]);
  }
  return ans;
}

ll kn() {
  ll ans = l;
  ans = min(ans, 2*(l - pos[0]));
  ans = min(ans, 2*pos[n - 1]);
  rep(i,0,n - 1) {
    ans = min(ans, 2*pos[i] + 2*(l - pos[i + 1]));
  }
  return ans;
}

ll solve(vi& ps) {
  int a = 0, b = min(n - 1, k - 1);
  ll ans = 0;
  int fhc = n / 2;
  int shc = n / 2 + (n & 1);

  while (ps[a] < n) {
    if (ps[b] <= fhc) ans += 2*ps[b];
    else if (ps[a] >= shc) ans += 2*(n - ps[a]);
    else {
      int low = a, high = b + 1, c;
      while (high - low > 1) {
        c = (high + low) / 2;
        if (ps[c] >= shc) high = c;
        else low = c;
      }
      ll cand1 = n, cand2 = 2*ps[c] + 2*(n - ps[c + 1]);
      ans += min(cand1, cand2);
    }
  }
  return ans;
}

ll get() {
  ll ans = solve(pos);
  vi ppp(n);
  rep(i,0,n) ppp[i] = pos[n - 1 - i];
  ans = min(ans, solve(ppp));
}

ll delivery(int N, int K, int L, int positions[]) {
  n = N; k = K; l = L;
  pos.resize(n); rep(i,0,n) pos[i] = positions[i];
  if (k == 1) return kone();
  else if (k == n) return kn();
  else return get();
}

Compilation message (stderr)

boxes.cpp: In function 'll get()':
boxes.cpp:66:1: warning: no return statement in function returning non-void [-Wreturn-type]
   66 | }
      | ^

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