제출 #1037396

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

boxes

#include "boxes.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <limits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

int L;
vi arr(1e7+10,0);

int dis(int a,int b){
    return min(abs(b-a),L-abs(b-a));
}

long long delivery(int N, int K, int l, int p[]) {
    L = l;
    FOR(i,0,N){
        arr[i] = dis(p[i],0);
    }

    ll ans = LLONG_MAX;

    FOR(j,0,(N%K)+2){
        ll temp = 0;
        int last = 0;

        if(j != 0){
            // cout << "A " << arr[0] << " " << arr[j-1] << " " << dis(p[0],p[j-1]) << endl;
            temp += arr[0] + arr[j-1] + dis(p[0],p[j-1]);
        }

        for(int i=j;i<N;i+=K){
            if(i+K-1 > N-1)break;
            last = i+K;
            // cout << "B " << arr[i] << " " << arr[i+K-1] << " " << dis(p[i],p[i+K-1]) << endl;
            temp += arr[i] + arr[i+K-1] + dis(p[i],p[i+K-1]);
        }

        if(last <= N-1){
            // cout << "C " << arr[N-1] << " " << arr[last] << " " << dis(p[last],p[N-1]) << endl;
            temp += arr[N-1] + arr[last] + dis(p[last],p[N-1]);
        }

        // cout << j << " " << temp << endl;
        ans = min(ans,temp);
    }

    return ans;
}

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