Submission #425351

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

boxes

#include <bits/stdc++.h>
#include "boxes.h"
#define PB push_back
#define F first
#define S second
using namespace std;
pair<long long, long long>teams[10000002];
int kt,  lt, n;
int dp(int poscur, int ksobrante){
    return 0;
}
long long delivery(int N, int K, int L, int p[]) {
    int ant = p[0], rep = 1, pointer = 0;
    kt=K, n = N, lt = L;
    for(int i = 1 ; i < N ; i++){
        if(p[i]!=ant){
            teams[pointer++]={ant, rep};
            rep=1;
        }else rep++;
        ant=p[i];
    }
    int mx=L/2, temp=INT_MAX;
    long long sm = 0;
    for(int i = 0 ; i < pointer  ; i++){
        if(teams[i].F>mx){
            temp=i;
            break;
        }
        sm+=teams[i].S*2*teams[i].F;
    }
    for(int i = pointer-1 ; i >= temp ; i--){
        sm+=teams[i].S*2*(L-teams[i].F);
    }
    
    return sm;
}

Compilation message (stderr)

boxes.cpp: In function 'int dp(int, int)':
boxes.cpp:9:12: warning: unused parameter 'poscur' [-Wunused-parameter]
    9 | int dp(int poscur, int ksobrante){
      |        ~~~~^~~~~~
boxes.cpp:9:24: warning: unused parameter 'ksobrante' [-Wunused-parameter]
    9 | int dp(int poscur, int ksobrante){
      |                    ~~~~^~~~~~~~~

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