제출 #396945

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

boxes

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>

using namespace std;

#define pb push_back
#define INF INT32_MAX
#define vt vector


typedef vt<int> vi;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tiii;
typedef long long ll;





#define MOD  1000000007


ll delivery(int n, int k, int l, int arr[]){
    if(k==1){
        ll ans = 0;
        for(int i = 0; i < n; i++){
            ans+=2*min(arr[i],l-arr[i]);
        }
        return ans;
    }else if(k==n){
        if(arr[n-1]<=l/2){
            return arr[n-1]*2;
        }else if(arr[0]>l/2){
            return 2* (l-arr[0]);
        }else{
            return l;
        }
    }
    return 0;
}

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