oj.uz

Submission #319533

# Submission time Handle Problem Language Result Execution time Memory
319533 2020-11-05T13:32:28 Z tjdgus4384 Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 1 ms 364 KB 
#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;

long long delivery(int N, int K, int L, int positions[]){
    int i, ans = 0;
    for(i = 0;i + K - 1 < N;i += K){
        if(positions[i] > L/2) ans += (L-positions[i])*2;
        else if(positions[i + K - 1] < L/2) ans += (positions[i + K - 1])*2;
        else{
            for(int j = i+1;j <= i + K - 1;j++){
                if(positions[j+1]-positions[j] > L/2){
                    ans += (L-positions[j+1]+positions[j])*2;
                    goto next;
                }
            }
            ans += L;
        }
        next:;
    }
    return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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