oj.uz

Submission #118949

# Submission time Handle Problem Language Result Execution time Memory
118949 2019-06-20T05:55:02 Z oolimry Boxes with souvenirs (IOI15_boxes) C++14
25 / 100
 3 ms 384 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

static long long leftl[10000005];
static long long rightr[10000005];
static long long pp[10000005];
long long delivery(int N, int K, int L, int p[]) {
    long long n, k, l;
    n = N, k = K, l = L;

    for(int i = 0;i < n;i++){
        pp[i] = p[i];
    }
    for(int i = 0;i < n;i++){
        if(i < k) leftl[i] = 2ll * pp[i];
        else leftl[i] = 2ll * pp[i] + leftl[i-k];
    }

    for(int i = n-1;i >= 0;i--){
        if(i + k >= n) rightr[i] = 2ll * l - 2ll * pp[i];
        else rightr[i] = 2ll * l - 2ll * pp[i] + rightr[i+k];
    }

    //for(int i = 0;i < n;i++){
    //    cout << leftl[i] << " " << rightr[i] << "\n";
    //}

    long long circles = n;
    long long ans = min(leftl[n-1], rightr[0]);
    for(int i = 0;i < n;i++){
        long long value = 0;
        if(i != -1) value += leftl[i];

        while(true){
            if(circles == 0) break;

            int pnt2 = i + 1 + k * (circles - 1);
            if(pnt2 >= n){
                circles--;
            }
            else if(L >= 2 * L - 2 * pp[pnt2]){
                circles--;
            }
            else{
                break;
            }
        }

        value += circles * l;
        int endpnt = i + 1 + k * circles;
        if(endpnt < n) value += rightr[endpnt];
        //cout << i << " " << circles << "\n";
        ans = min(ans,value);
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:20:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for(int i = n-1;i >= 0;i--){
                 ~^~
boxes.cpp:38:30: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
             int pnt2 = i + 1 + k * (circles - 1);
                        ~~~~~~^~~~~~~~~~~~~~~~~~~
boxes.cpp:51:28: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
         int endpnt = i + 1 + k * circles;
                      ~~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Incorrect 3 ms 384 KB Output isn't correct
12 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 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Incorrect 3 ms 384 KB Output isn't correct
12 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 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Incorrect 3 ms 384 KB Output isn't correct
12 Halted 0 ms 0 KB -