제출 #320219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
320219		zaneyu	선물상자 (IOI15_boxes)	C++14	50 / 100	50 ms	18148 KiB

boxes

/*input
4
1000000 1000000
1 1000000
1000000 1000000
1000000 1000000
*/
//#include "potatoqueue.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=3e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=(1e9+7);
const ll MOD2=1000002173;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b,ll MOD){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
ll dp[maxn],dp2[maxn];
long long delivery(int n, int k, int l, int arr[]) {
    ll ans=INF64;
    REP(i,n){
        if(i>=k){
            dp[i]=dp[i-k]+2*arr[i];
        }
        else{
            dp[i]=2*arr[i];
        }
    }
    for(int i=n-1;i>=0;i--){
        if(i+k<n){
            dp2[i]=dp2[i+k]+(2*(l-arr[i]));
        }
        else{
            dp2[i]=2*(l-arr[i]);
        }
    }
    MNTO(ans,dp2[0]);
    REP(i,n){
        MNTO(ans,dp[i]+dp2[i+1]);
    }   
    MNTO(ans,dp2[k]+l);
    REP(i,n-k){
        MNTO(ans,dp[i]+dp2[i+k+1]+l);
    }
    return ans;
}

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

boxes.cpp: In function 'll mypow(ll, ll, ll)':
boxes.cpp:45:26: warning: declaration of 'MOD' shadows a global declaration [-Wshadow]
   45 | ll mypow(ll a,ll b,ll MOD){
      |                          ^
boxes.cpp:33:10: note: shadowed declaration is here
   33 | const ll MOD=(1e9+7);
      |          ^~~

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