제출 #587335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
587335		xynex	선물상자 (IOI15_boxes)	C++17	25 / 100	1 ms	340 KiB

boxes

#include <bits/stdc++.h>

#include "boxes.h"
using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 8e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

long long delivery(int N, int K, int L, int p[]) {
    vt<int> l, r;
    for(int i = 0; i < N; ++i) {
      if(p[i] <= (L / 2 - 1)) l.pb(p[i]);
      else r.pb(p[i]);
    }
    reverse(all(r));
    for(int i = 0; i < sz(r); ++i) {
      r[i] = L - r[i];
    }
    vt<ll> needToDeleteL(K), needToDeleteR(K);
    for(int i = 0; i < sz(l); ++i) {
      needToDeleteL[i % K] += l[i];
    }
    for(int i = 0; i < sz(r); ++i) {
      needToDeleteR[i % K] += r[i];
    }
    if(sz(r) == 0) {
      return needToDeleteL[(sz(l) - 1) % K] * 2;
    }
    if(sz(l) == 0) {
      return needToDeleteR[(sz(r) - 1) % K] * 2;
    }
    ll ans = needToDeleteL[(sz(l) - 1) % K] * 2 + needToDeleteR[(sz(r) - 1) % K] * 2;
    //print(ans);
    vt<ll> AlreadyDeletedL(K), AlreadyDeletedR(K);
    int Lpos = sz(l) - 1, Rpos = sz(r) - 1;
    int cnt = 0;
    ll sum = 0;
    for(int i = 0; i < N; ++i) {
      if(Lpos == -1) {
        cnt++;
        if(cnt % K == 1) {
          sum += L;
        }
        AlreadyDeletedR[Rpos % K] += r[Rpos];
        Rpos--;
      }
      else if(Rpos == -1) {
        cnt++;
        if(cnt % K == 1) {
          sum += L;
        }
        AlreadyDeletedL[Lpos % K] += l[Lpos];
        Lpos--;
      }
      else {
        cnt++;
        if(cnt % K == 1) {
          sum += L;
        }
        if(l[Lpos] < r[Rpos]) {
          AlreadyDeletedR[Rpos % K] += r[Rpos];
          Rpos--;
        }
        else {
          AlreadyDeletedL[Lpos % K] += l[Lpos];
          Lpos--;
        }
      }
      ll cur = sum;
      //print(cur, Lpos, Rpos);
      if(Lpos != -1) {
        cur += (needToDeleteL[Lpos % K] - AlreadyDeletedL[Lpos % K]) * 2;
      }
      if(Rpos != -1) {
        cur += (needToDeleteR[Rpos % K] - AlreadyDeletedR[Rpos % K]) * 2;
      }
      //print(cur);
      ans = min(ans, cur);
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:71:24: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   71 | long long delivery(int N, int K, int L, int p[]) {
      |                    ~~~~^
boxes.cpp:60:11: note: shadowed declaration is here
   60 | const int N = 8e6 + 5;
      |           ^
boxes.cpp: In function 'void freop(std::string)':
boxes.cpp:55:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:56:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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