제출 #699189

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
699189		sunwukong123	선물상자 (IOI15_boxes)	C++14	10 / 100	3 ms	320 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 10000005;
int ans=oo;
int pref[MAXN]; // cost for the first i things to all be routed like 0->x->0
int suf[MAXN]; // cost for the last i things to all be routed like 0->y->0
int A[MAXN];


long long delivery(int32_t n, int32_t k, int32_t l, int32_t p[]) {
    FOR(i,1,n) {
        A[i] = p[i-1];
    }
    FOR(st,1,n-k+1) {
        int en=st+k-1; 

        int fi=st-1;
        int se=en+1;
        db2(fi,se);

        int sum = 0;
        for(int idx=fi;idx>0;idx-=k) {
            sum+=A[idx]*2;
            if(idx-k<=0 && idx>1) {
                sum+=2*A[idx-1];
            }
        }

        for(int idx=se;idx<=n;idx+=k) {
            sum+=(l-A[idx])*2;
            if(idx+k>n && idx<n) {
                sum+=2*(l-A[idx+1]);
            }
        }
        db2(st,sum);
        sum+=l;

        
        chmin(ans, sum);
    }
    db(ans);
    FOR(st,1,n+1) {
        int en=st;

        int fi=st-1;
        int se=st;

        int sum = 0;
        for(int idx=fi;idx>0;idx-=k) {
            sum+=A[idx]*2;
            if(idx-k<=0 && idx>1) {
                sum+=2*A[idx-1];
            }
        }
        for(int idx=se;idx<=n;idx+=k) {
            db2(idx,2*(l-A[idx]));
            sum+=(l-A[idx])*2;
            if(idx+k>n && idx<n) {
                sum+=(l-A[idx+1])*2;
            }
        }
        db2(st,sum);

        chmin(ans, sum);
    }
   

    return ans;
}

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

boxes.cpp: In function 'long long int delivery(int32_t, int32_t, int32_t, int32_t*)':
boxes.cpp:83:13: warning: unused variable 'en' [-Wunused-variable]
   83 |         int en=st;
      |             ^~

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