oj.uz

Submission #102203

# Submission time Handle Problem Language Result Execution time Memory
102203 2019-03-23T15:20:07 Z Leonardo_Paes Boxes with souvenirs (IOI15_boxes) C++11
0 / 100
 3 ms 640 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e7 + 10;

//int n, k, l, vet[MAXN];

int delivery(int N, int K, int L, int positions[MAXN]){

    int x = N, sum=0;

    int ini=0, fim=N-1;

    for(int i=x; x>1; x-=2){
        if(ini+(K-1)<=N-1 and fim-(K-1)>=0 and (2*(positions[ini+(K-1)]))<(2*(L-positions[fim-(K-1)]))){
            sum+=2*(positions[ini+(K-1)]);
            ini+=K;
        }
        else{
            sum+=2*(L-positions[fim-(K-1)]);
            fim-=K;
        }
    }
    sum+=min(2*positions[ini], 2*(L-positions[fim]));

    return sum;
}
/*
int main(){



    cin >> n >> k >> l;

    for(int i=0; i<n; i++){
        cin >> vet[i];
    }

    cout <<  delivery(n, k, l, vet) << endl;
}
*/

Compilation message

boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:15:13: warning: unused variable 'i' [-Wunused-variable]
     for(int i=x; x>1; x-=2){
             ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Incorrect 2 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 Runtime error 3 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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