Submission #216761

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
216761	2020-03-28T03:28:06 Z	mohamedsobhi777	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	6 ms	384 KB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std ; 
const int M_N = 1e5 + 7 ; 

long long delivery(int N, int K, int L, int p[]) {
    int ret = 0 , pivot = 0 ; 
    sort(p , p + N) ; 
    for(int i =0 ; i < N ; i++){
        if(p[i] <=L /2 )
            pivot = i ;
    }
    int cur = 0 , swp = 0 ; 
    for(int i = 0 ; i <=pivot ; i++){
        cur++;
        if(cur==K){
            ret+=2*p[i] ; 
            cur = 0 ; 
            swp = i ; 
        } 
    }
    for(int i = 0 ; i <=swp ; i++)p[i] = 0;
    cur = 0 , swp = N ; 
    for(int i = N-1 ; i>pivot ; i--){
        cur++ ; 
        if(cur==K){
            ret+=2*(L - p[i]) ; 
            cur = 0 ; 
            swp = i ; 
        }
    }
    for(int i = swp ; i <N ; i++)p[i] = 0 ; 

    int road1 = 0 ; 
    int road2 = 0 ; 
    
    for(int i = 0 ; i < N;i++){
        if(i<=pivot){
            road1 = 2 * p[i] ; 
        }else if(!road2 && p[i]){
            road2 = 2*(L - p[i]) ; 
        }
    }
    ret+=min(L , road1 + road2) ; 
    return 1ll * ret;
}

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Incorrect	5 ms	384 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Incorrect	5 ms	384 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #3
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Incorrect	6 ms	256 KB	Output isn't correct
5	Halted	0 ms	0 KB	-