Submission #444514

#	Time	Username	Problem	Language	Result	Execution time	Memory
444514		osmanallazov	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	204 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define ll long long
long long delivery(int N, int K, int L, int p[]) {
    ll res=0;
    if(K==1){
        for(int i=0;i<N;i++){
            if(p[i]==0){
            res+=0;
            }
            else if(p[i]<=L/2){
                res+=(p[i]*2);
            }
            else{
                res+=((L-p[i])*2);
            }
        }
    }
    else if(K==N){
            ll mini=1000000001;
            ll maks=-1;
        for(int i=0;i<N;i++){
                if(p[i]!=0){
            if(mini>p[i]){
                mini=p[i];
            }
            if(maks<p[i]){
                maks=p[i];
            }
            }
        }
        if(mini<=L/2 && maks<=L/2){
            res=maks*2;
        }
        else if(mini>L/2 && maks>L/2){
            res=(L-mini)*2;
        }
        else{
            res=L;
        }
    }
    return res;
}

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