답안 #319546

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
319546	2020-11-05T13:41:13 Z	tjdgus4384	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	364 KB

boxes

#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;

long long delivery(int N, int K, int L, int positions[]){
    int i, ans = 0;
    for(i = 0;i + K - 1 < N;i += K){
        if(positions[i] > L/2) ans += (L-positions[i])*2;
        else if(positions[i + K - 1] <= L/2) ans += (positions[i + K - 1])*2;
        else{
            for(int j = i+1;j <= i + K - 1;j++){
                if(positions[j]-positions[j-1] > L/2){
                    ans += (L-positions[j]+positions[j-1])*2;
                    goto next;
                }
            }
            ans += L;
        }
        next:;
    }
    if(i == N) return ans;
    if(positions[i] > L/2) ans += (L-positions[i])*2;
    else if(positions[N-1] <= L/2) ans += positions[N-1] * 2;
    else{
        for(int j = i+1;j <= N - 1;j++){
            if(positions[j]-positions[j-1] > L/2){
                ans += (L-positions[j]+positions[j-1])*2;
                goto next1;
            }
        }
        ans += L;
    }
    next1:;
    return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct

Subtask #3
0 / 15.0

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