oj.uz

Submission #259810

# Submission time Handle Problem Language Result Execution time Memory
259810 2020-08-08T15:30:24 Z Hehehe Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 1 ms 384 KB 
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<long double, long double>
#define sz(x) (int)((x).size())
//#define int long long
#include "boxes.h"


ll delivery(int n, int k, int L, int pos[]){

    ll dp1[n + 5], dp2[n + 5];

    vector<int>pos2;

    for(int i = 0; i < n; i++){
        pos2.push_back(pos[i]);
    }

    reverse(all(pos2));

    for(int i = 0; i < n; i++){
        dp1[i] = (i < k ? 2ll*pos[i] : dp1[i - k] + 2ll*pos[i]);
    }

    for(int i = n - 1; i >= 0; i--){
        dp2[i] = (i + k >= n ? 2ll*(L - pos[i]) : dp2[i + k] + 2ll*(L - pos[i]));
        //cout << i << ' ' << (L - pos[i]) << '\n';
    }

    ll ans = min(dp2[0], dp1[n - 1]);

    //cout << "pos" << '\n';
    //for(int i = 0; i < n; i++)cout << pos[i] << ' '; cout << '\n';
    //cout << "dp1" << '\n';
    //for(int i = 0; i < n; i++)cout << dp1[i] << ' '; cout << '\n';
    //cout << "dp2" << '\n';
    //for(int i = 0; i < n; i++)cout << dp2[i] << ' '; cout << '\n';

    for(int i = 0; i < n - 1; i++){
        ans = min(ans, dp1[i] + dp2[i + 1]);
    }

    for(int i = 0; i < n; i++){
        if(i + k + 1 >= n)continue;
        ans = min(ans, dp1[i] + L + dp2[i + k + 1]);
    }

    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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