제출 #1078435

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

#define ll int
#define sz(x) (ll)x.size()
#define F first
#define S second
#define pb push_back

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
    for (ll i =0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}
ll n, k, l;
vi v;

long long delivery(int N, int K, int L, int p[]) {
    n = N, k = K, l = L;
    v.resize(n);
    for (ll i= 0; i<n; i++) v[i] = p[i];

    ll ans = 0;
    for (ll i =0; i<n; i++){
        ans += min(v[i], (l-v[i])) * 2;
    }
    return ans;
}

/*


*/

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