Submission #412652

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

boxes

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e3+2;

int n,k,l;
int pos[N];

ll kje1(){
    ll sol = 0;
    for(int i = 0; i < n; i++){
        ll dod = 2*min(pos[i],(int)l-pos[i]);
        sol += dod;
    }
    return sol;
}

ll kjen(){
    int sol = l;
    sol = min(sol,2*(l-pos[0]));
    for(int i = 0; i < n-1; i++){
        int sta = 2*pos[i]+2*(l-pos[i+1]);
        sol = min(sol,sta);
    }
    sol = min(sol,2*pos[n-1]);
    return sol;
}

ll delivery(int br1,int br2,int br3,int *positions){
    n = br1;
    k = br2;
    l = br3;
    for(int i = 0; i < n; i++) pos[i] = positions[i];

    int sta = 0;
    while(sta < n && pos[sta] == 0) sta++;
    if(sta == n) return 0;
    for(int i = 0; i < n-sta; i++) pos[i] = pos[i+sta];
    n -= sta;

    if(k == 1) return kje1();

    if(k == n) return kjen();
}

Compilation message (stderr)

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
   44 | }
      | ^

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