Submission #64919

#	Time	Username	Problem	Language	Result	Execution time	Memory
64919		mirbek01	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	3 ms	376 KiB

boxes

#include "boxes.h"

# include <bits/stdc++.h>

using namespace std;

long long delivery(int N, int K, int L, int p[]) {
      long long ans = 0;

      if(K == 1){
            for(int i = 0; i < N; i ++){
                  if((L - p[i]) > p[i])
                        ans += p[i] * 2;
                  else
                        ans += (L - p[i]) * 2;
            }
      } else {
            sort(p, p + N);
            ans = L;
            for(int i = 0; i < N - 1; i ++){
                  if(ans > ((p[i] * 2ll) + (L - p[i + 1]) * 2ll))
                        ans = (p[i] * 2ll) + (L - p[i + 1]) * 2ll;
            }
            if(ans > p[N - 1] * 2)
                  ans = p[N - 1] * 2;
            if(ans > (L - p[0]) * 2)
                  ans = (L - p[0]) * 2;
      }

      return ans;
}

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