Submission #1072790

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072790		Icelast	선물상자 (IOI15_boxes)	C++17	10 / 100	0 ms	440 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
ll solve(int n, int k, int B, int L, vector<int> a){
    vector<int> b(1, 0), c(1, 0);
    for(int i = 1; i <= n; i++){
        if(a[i] <= B){
            b.push_back(a[i]);
        }
    }
    for(int i = n; i >= 1; i--){
        if(a[i] > B){
            c.push_back(L-a[i]);
        }
    }
    vector<vector<ll>> sum(2, vector<ll>(k+1, 0)), pf(2, vector<ll>(k+1, 0));
    for(int i = 1; i < b.size(); i++){
        sum[0][i%k] += b[i]*2;
    }
    for(int i = 1; i < c.size(); i++){
        sum[1][i%k] += c[i]*2;
    }
    ll ans = INF;
    for(int i = 0; i < k; i++){
        int j = (b.size()-1 - i + 2*k-1)%k;
        ll hl = 0;
        if((b.size()-1-i+2*k)%k > 0) hl = L;
        ans = min(ans, sum[0][i] +  sum[1][j] + hl);
    }
    return ans;
}
long long delivery(int N, int K, int L, int p[]) {
    int n = N, k = K;
    vector<int> a(n+1);
    for(int i = 1; i <= n; i++){
        a[i] = p[i-1];
    }
    ll ans = INF;
    if(n%2==0){
        ans = min(ans, solve(n, k, L/2, L, a));
        ans = min(ans, solve(n, k, L/2-1, L, a));
    }else{
        ans = min(ans, solve(n, k, L/2, L, a));
    }
    return ans;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int solve(int, int, int, int, std::vector<int>)':
boxes.cpp:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 1; i < b.size(); i++){
      |                    ~~^~~~~~~~~~
boxes.cpp:22:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i = 1; i < c.size(); i++){
      |                    ~~^~~~~~~~~~
boxes.cpp:27:41: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   27 |         int j = (b.size()-1 - i + 2*k-1)%k;
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~^~

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