제출 #102206

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

boxes

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e7 + 10;

//int n, k, l, vet[MAXN];

long long delivery(int N, int K, int L, int positions[MAXN]){

    long long x = N, sum=0;

    int ini=0, fim=N-1;

    for(int i=x; x>1; x-=2){
        if(ini+(K-1)<=N-1 and fim-(K-1)>=0 and (2*(positions[ini+(K-1)]))<(2*(L-positions[fim-(K-1)]))){
            sum+=(long long)2*(long long)(positions[ini+(K-1)]);
            ini+=K;
        }
        else{
            sum+=(long long)2*(long long)(L-positions[fim-(K-1)]);
            fim-=K;
        }
    }
    sum+=(long long)min(2*positions[ini], 2*(L-positions[fim]));

    return sum;
}
/*
int main(){



    cin >> n >> k >> l;

    for(int i=0; i<n; i++){
        cin >> vet[i];
    }

    cout <<  delivery(n, k, l, vet) << endl;
}
*/

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:15:15: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i=x; x>1; x-=2){
               ^
boxes.cpp:15:13: warning: unused variable 'i' [-Wunused-variable]
     for(int i=x; x>1; x-=2){
             ^

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