oj.uz

Submission #65266

# Submission time Handle Problem Language Result Execution time Memory
65266 2018-08-07T09:04:58 Z KHUSRAV Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 2 ms 380 KB 
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std ;
pair<long long , long long> dppred[10000001] , dpfirst[10000001];
long long delivery(int N, int K, int L, int p[]) {
    deque<int> dq ;


    if(p[0] <= L / 2){
        dppred[0] = {p[0] * 2 , K - 1};
        dpfirst[0] = {p[0] * 2 , K - 1};
    }
    else{
        dppred[0] = {(L - p[0]) * 2 , K - 1};
        dpfirst[0] = {(L - p[0]) * 2 , K - 1};
    }

    for(int i = 1 ; i < N ; i++){
        if(p[i] <= L / 2){
            dppred[i] = {p[i] * 2 + dppred[i - 1].first, K - 1};
            dpfirst[i] = {p[i] * 2 + dppred[i - 1].first, K - 1};
        }
        else{
            dppred[i] = {(L - p[i]) * 2 + dppred[i - 1].first, K - 1};
            dpfirst[i] = {(L - p[i]) * 2 + dppred[i - 1].first, K - 1};
        }
        if(dppred[i - 1].second > 0){
            int k = dppred[i - 1].second;
            int l = p[i - 1];
            int s = dppred[i - 1].first , g;
            if(l <= L / 2)
                g = l;
            else g = L - l ;

            if(p[i] <= L / 2){
                if(dppred[i].first > s - g + (p[i] - p[i - 1]) + p[i]){
                    dppred[i].first = s - g + (p[i] - p[i - 1]) + p[i];
                    dppred[i].second = dppred[i - 1].second - 1 ;
                }
            }
            else{
                if(dppred[i].first > s - g + (p[i] - p[i - 1]) + L - p[i]){
                    dppred[i].first = s - g + (p[i] - p[i - 1]) + L - p[i];
                    dppred[i].second = dppred[i - 1].second - 1 ;
                }
            }
        }
        if(dpfirst[i - 1].second > 0){
            int k = dpfirst[i - 1].second;
            int l = p[i - 1];
            int s = dpfirst[i - 1].first , g;
            if(l <= L / 2)
                g = l;
            else g = L - l ;

            if(p[i] <= L / 2){
                if(dppred[i].first > s - g + (p[i] - p[i - 1]) + p[i]){
                    dppred[i].first = s - g + (p[i] - p[i - 1]) + p[i];
                    dppred[i].second = dpfirst[i - 1].second - 1 ;
                }
            }
            else{
                if(dpfirst[i].first > s - g + (p[i] - p[i - 1]) + L - p[i]){
                    dppred[i].first = s - g + (p[i] - p[i - 1]) + L - p[i];
                    dppred[i].second = dpfirst[i - 1].second - 1 ;
                }
            }
        }
    }
    return dppred[N - 1].first ;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:28:35: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
             int k = dppred[i - 1].second;
                     ~~~~~~~~~~~~~~^~~~~~
boxes.cpp:30:35: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
             int s = dppred[i - 1].first , g;
                     ~~~~~~~~~~~~~~^~~~~
boxes.cpp:28:17: warning: unused variable 'k' [-Wunused-variable]
             int k = dppred[i - 1].second;
                 ^
boxes.cpp:49:36: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
             int k = dpfirst[i - 1].second;
                     ~~~~~~~~~~~~~~~^~~~~~
boxes.cpp:51:36: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
             int s = dpfirst[i - 1].first , g;
                     ~~~~~~~~~~~~~~~^~~~~
boxes.cpp:49:17: warning: unused variable 'k' [-Wunused-variable]
             int k = dpfirst[i - 1].second;
                 ^

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Halted 0 ms 0 KB -