Submission #216784

#	Time	Username	Problem	Language	Result	Execution time	Memory
216784		mohamedsobhi777	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	5 ms	384 KiB

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[]) {
    long long ret = 0 , pivot = -1 ; 
    sort(p , p + N) ; 
    for(int i =0 ; i < N ; i++){
        if(p[i] <=L /2 )
            pivot = i ;
    }
    long long cur = 0 , swp = -1 ; 
    for(int i = 0 ; i <=pivot ; i++){
        cur++;
        if(cur==K){
            ret+=2ll*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+=2ll*(L - p[i]) ; 
            cur = 0 ; 
            swp = i ; 
        }
    }
    for(int i = swp ; i <N ; i++)p[i] = 0 ; 
    long long road1 = 0 , road2 = 0, road3 = 0, cnt1 = 0 , cnt2 = 0; 
    for(int i = 0 ; i < N;i++){
        if(i<=pivot){
            road1 = 2ll * p[i] ; 
        }else if(!road2 && p[i]){
            road2 = 2ll*(L - p[i]) ; 
        }
    }
    for(int i =0 ; i < N; i++){
        if(p[i]){
            cnt1++; 
        }
        if(cnt1>K){
           // cnt1 = p[i]; 
            break;
        }
    }
    for(int i = N-1 ; i >= 0 ; i--){
        if(p[i]){
            cnt2++ ; 
        }
        if(cnt2>K){
            //cnt2 = p[i] ; 
            break;
        }
    }   
    cnt1 = cnt2 = 0 ; 
    if(road1 || road2){
        road3 = L + 2ll*min( min( cnt1 , L - cnt1 ) , min(cnt2 , L-cnt2) );
    }
    ret+=min(road3 , road1 + road2) ; 
    return 1ll * ret;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:32:17: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i = swp ; i <N ; i++)p[i] = 0 ; 
                 ^~~

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