Submission #575939

#TimeUsernameProblemLanguageResultExecution timeMemory
575939stevancvBoxes with souvenirs (IOI15_boxes)C++14
20 / 100
1 ms308 KiB
#include <bits/stdc++.h> #include "boxes.h" #define ll long long #define ld long double #define sp ' ' #define en '\n' #define smin(a, b) a = min(a, b) #define smax(a, b) a = max(a, b) using namespace std; ll delivery(int N, int K, int D, int pos[]) { ll n = N; ll k = K; ll d = D; vector<ll> a, b; for (int i = 0; i < n; i++) { if (pos[i] <= d / 2) a.push_back(pos[i]); else b.push_back(pos[i]); } ll ans = 0; int A = a.size(); int B = b.size(); for (int i = k - 1; i < A; i += k) ans += 2 * a[i]; reverse(b.begin(), b.end()); for (int i = k - 1; i < B; i += k) ans += 2 * (d - b[i]); vector<ll> c; int p = A - (A % k); int q = B - (B % k); for (int i = p; i < A; i++) c.push_back(a[i]); for (int i = B - 1; i >= q; i--) c.push_back(b[i]); int x = c.size(); auto Get = [&] (ll mn, ll mx) { if (mx <= d / 2) return 2 * mx; if (d / 2 < mn) return 2 * (d - mn); return min(d, 2 * (a.back() + d - b.back())); }; if (x == 0) return ans; if (x <= k) return ans + Get(c[0], c.back()); ll best = 1e18; for (int i = 0; i < x; i++) { if (i + 1 > k || x - i - 1 > k) continue; ll o = Get(c[0], c[i]); if (i < x - 1) o += Get(c[i + 1], c.back()); smin(best, o); } return ans + best; }

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:18:19: warning: conversion from 'std::vector<long long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   18 |     int A = a.size();
      |             ~~~~~~^~
boxes.cpp:19:19: warning: conversion from 'std::vector<long long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   19 |     int B = b.size();
      |             ~~~~~~^~
boxes.cpp:20:20: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   20 |     for (int i = k - 1; i < A; i += k) ans += 2 * a[i];
      |                  ~~^~~
boxes.cpp:20:34: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   20 |     for (int i = k - 1; i < A; i += k) ans += 2 * a[i];
      |                                ~~^~~~
boxes.cpp:22:20: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   22 |     for (int i = k - 1; i < B; i += k) ans += 2 * (d - b[i]);
      |                  ~~^~~
boxes.cpp:22:34: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   22 |     for (int i = k - 1; i < B; i += k) ans += 2 * (d - b[i]);
      |                                ~~^~~~
boxes.cpp:24:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   24 |     int p = A - (A % k);
      |             ~~^~~~~~~~~
boxes.cpp:25:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   25 |     int q = B - (B % k);
      |             ~~^~~~~~~~~
boxes.cpp:28:19: warning: conversion from 'std::vector<long long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   28 |     int x = c.size();
      |             ~~~~~~^~
#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...