제출 #101335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101335		ansol4328	선물상자 (IOI15_boxes)	C++11	20 / 100	3 ms	384 KiB

boxes

#include<stdio.h>
#include<vector>
#include<algorithm>

using namespace std;

long long delivery(int N, int K, int L, int *positions)
{
    long long res=0;
    vector<int> lst1, lst2;
    for(int i=0 ; i<N ; i++)
    {
        if(positions[i]>L/2) break;
        lst1.push_back(positions[i]);
        positions[i]=-1;
    }
    for(int i=N-1 ; i>=0 ; i--)
    {
        if(positions[i]==-1) break;
        lst2.push_back(positions[i]);
        positions[i]=-1;
    }
    int idx1=-1, idx2=-1;
    for(int i=K-1 ; i<lst1.size() ; idx1=i, i+=K) res+=2*lst1[i];
    for(int i=K-1 ; i<lst2.size() ; idx2=i, i+=K) res+=2*(L-lst2[i]);
    int rm1=lst1.size()-idx1-1, rm2=lst2.size()-idx2-1;
    int v1=0, v2=L, v3=L;
    if(rm1) v1+=2*lst1[lst1.size()-1];
    if(rm2) v1+=2*(L-lst2[lst2.size()-1]);
    if(rm1+rm2>=K)
    {
        int x=rm1+rm2-K;
        if(x)
        {
            v2+=2*(L-lst2[idx2+x]);
            v3+=2*lst1[idx1+x];
        }
    }
    res+=min(v1,min(v2,v3));
    return res;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:24:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=K-1 ; i<lst1.size() ; idx1=i, i+=K) res+=2*lst1[i];
                     ~^~~~~~~~~~~~
boxes.cpp:25:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=K-1 ; i<lst2.size() ; idx2=i, i+=K) res+=2*(L-lst2[i]);
                     ~^~~~~~~~~~~~
boxes.cpp:26:29: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
     int rm1=lst1.size()-idx1-1, rm2=lst2.size()-idx2-1;
             ~~~~~~~~~~~~~~~~^~
boxes.cpp:26:53: warning: conversion to 'int' from 'std::vector<int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
     int rm1=lst1.size()-idx1-1, rm2=lst2.size()-idx2-1;
                                     ~~~~~~~~~~~~~~~~^~

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