oj.uz

답안 #310155

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
310155 2020-10-06T01:02:41 Z aZvezda 선물상자 (IOI15_boxes) C++14
0 / 100
 1 ms 384 KB 
#include "boxes.h"

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const int MAX_N = 1e7 + 10;
ll dp[MAX_N];
ll sufMin[MAX_N];

long long delivery(int N, int K, int L, int p[]) {
    bool gotMid = false;
    int lastSmaller = -1;
    int n = N, k = K;
    for(int i = 0; i < n; i ++) {
        if(p[i] == L / 2 && L % 2 == 0) {
            gotMid = true;
        }
        if(p[i] <= (L - 1) / 2) {
            lastSmaller = i;
        }
    }
    for(int i = 0; i < n; i ++) {
        if(i >= k - 1) {
            ll cost = mod * mod;
            if(i - k + 1 <= lastSmaller && lastSmaller < i) {
                cost = 2 * p[lastSmaller] + 2 * L - 2 * p[lastSmaller + 1];
            } else if(i - k + 1 <= lastSmaller && lastSmaller <= i) {
                cost = 2 * p[lastSmaller];
            } else if(i <= lastSmaller) {
                cost = 2 * p[i];
            } else {
                cost = 2 * L - 2 * p[i - k + 1];
            }
            dp[i] = dp[i - k + 1] + cost;
        }
        //cout << dp[i] << " ";
    }
    for(int i = n - 1; i > 0; i --) {
        if(i == n - 1) {
            sufMin[i] = dp[i];
        } else {
            sufMin[i] = min(dp[i] + 2 * L - 2 * p[i + 1], sufMin[i + 1]);
        }
    }
    ll ret = mod * mod;
    for(int i = 1; i <= k; i ++) {
        chkmin(ret, p[i - 1] * 2 + sufMin[n - i]);
    }
    return ret;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:21:10: warning: variable 'gotMid' set but not used [-Wunused-but-set-variable]
   21 |     bool gotMid = false;
      |          ^~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -