Submission #578741

#	Time	Username	Problem	Language	Result	Execution time	Memory
578741		Sam_a17	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	212 KiB

boxes

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#pragma GCC optimize("Ofast")
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
// #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
long long dx[8] = {-1,0,1,0,1,-1,1,-1};
long long dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
 
// Random
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
 
// Indexed Set
// template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/*const int N = 2e5 + 10;
long long n, k, l, p[N];

void solve_() {
  cin >> n >> k >> l;
  for(int i = 0; i < n; i++) {
    cin >> p[i];
  }

  vector<long long> pref(n + 1), suf(n + 2);

  for(int i = 1; i <= n; i++) {
    pref[i] = pref[i - 1] + min(2ll * p[i - 1], (long long)l);
    if(i >= k) {
      pref[i] = min(pref[i], pref[i - k]) + min(2ll * p[i - 1], (long long)l);
    }
  }

  for(int i = n; i >= 1; i--) {
    suf[i] = suf[i + 1] + min((long long)l, (l - p[i - 1]) * 2ll);
    if(i <= n - k + 1) {
      suf[i] = min(suf[i], suf[i + k] + min(2ll * (l - p[i - 1]), (long long)l));
    }
  }

  dbg(pref)
  dbg(suf)
  long long answ = 1e18;
  for(int i = 0; i <= n; i++) {
    answ = min(answ, pref[i] + suf[i + 1]);
  }


  printf("%lld\n", answ);
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
  int test_cases = 1;
  solve(test_cases);
 
  return 0;
}
*/
#include "boxes.h"

/*
  1 2 5
  p[i] -> hasela i (prefix)

  i <= k
    p[i + k] = dp[i] + a[i + k] 

  s[i] -> hasela i

  dp[1] = 1;
  dp[2] = 2;

  dp[3] = 2 + 5 

*/


long long delivery(int n, int k, int l, int p[]) {
  vector<long long> pref(n + 1), suf(n + 2);

  for(int i = 1; i <= n; i++) {
    pref[i] = pref[i - 1] + min(2ll * p[i - 1], (long long)l);
    if(i >= k) {
      pref[i] = min(pref[i], pref[i - k]) + min(2ll * p[i - 1], (long long)l);
    }
  }

  for(int i = n; i >= 1; i--) {
    suf[i] = suf[i + 1] + min((long long)l, (l - p[i - 1]) * 2ll);
    if(i <= n - k) {
      suf[i] = min(suf[i], suf[i + k] + min(2ll * (l - p[i - 1]), (long long)l));
    }
  }

  long long answ = 1e18;
  for(int i = 0; i <= n; i++) {
    answ = min(answ, pref[i] + suf[i + 1]);
  }

  return answ;
}

Compilation message (stderr)

boxes.cpp: In function 'void setIO(std::string)':
boxes.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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