제출 #1073019

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define ll 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<ll> 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 = (c.size()-1-(b.size()-1 - i + 2*k)%k)%k;
        ans = min(ans, sum[0][i] +  sum[1][j] + L);
    }
    int bb = (b.size()-1)%k, cc = (c.size()-1)%k;
    ans = min(ans, sum[0][bb]+sum[1][cc]);
    if(b.size()-1 < k){
        int j = (c.size()-1-(k-(b.size()-1)-1+k)%k)%k;
        ans = min(ans, L+sum[1][j]);
    }
    if(c.size()-1 < k){
        int j = (b.size()-1-(k-(c.size()-1)-1+k)%k)%k;
        ans = min(ans, L+sum[0][j]);
    }
    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;
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function '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<long 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<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i = 1; i < c.size(); i++){
      |                    ~~^~~~~~~~~~
boxes.cpp:27:54: warning: conversion from 'std::vector<long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   27 |         int j = (c.size()-1-(b.size()-1 - i + 2*k)%k)%k;
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
boxes.cpp:30:26: warning: conversion from 'std::vector<long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   30 |     int bb = (b.size()-1)%k, cc = (c.size()-1)%k;
      |              ~~~~~~~~~~~~^~
boxes.cpp:30:47: warning: conversion from 'std::vector<long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   30 |     int bb = (b.size()-1)%k, cc = (c.size()-1)%k;
      |                                   ~~~~~~~~~~~~^~
boxes.cpp:32:19: warning: comparison of integer expressions of different signedness: 'std::vector<long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   32 |     if(b.size()-1 < k){
      |        ~~~~~~~~~~~^~~
boxes.cpp:33:52: warning: conversion from 'std::vector<long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   33 |         int j = (c.size()-1-(k-(b.size()-1)-1+k)%k)%k;
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
boxes.cpp:36:19: warning: comparison of integer expressions of different signedness: 'std::vector<long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(c.size()-1 < k){
      |        ~~~~~~~~~~~^~~
boxes.cpp:37:52: warning: conversion from 'std::vector<long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   37 |         int j = (b.size()-1-(k-(c.size()-1)-1+k)%k)%k;
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~

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