Submission #1195684

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195684		nikulid	선물상자 (IOI15_boxes)	C++20	0 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <vector>
#include <math.h>

using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    
    vector<int> ns;
    for(int i=0; i<N; i++){
        ns.push_back(p[i]);
    }
    
    int ldist=N; 
    for(int i=0; i<N; i++){
        if(p[i] != 0){
            ldist = ns[i];
            break;
        }
    }

    int rdist=ns[N-1];
    return L - max(ldist,rdist);
}

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