oj.uz

Submission #137612

# Submission time Handle Problem Language Result Execution time Memory
137612 2019-07-28T07:32:44 Z miguel Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 2 ms 376 KB 
#include<bits/stdc++.h>
#include<boxes.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
//#define int ll
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, int>
#define vi vector <int>
const ll nmax=1e5+2;
const ll mod = 998244353;

ll delivery(int n, int k, int l, int pos[]){
    ll ans=1000000000000000000;
    int pcarne[n];
    ll dp1[n], dp2[n];
    for(int i=0; i<n; i++) pcarne[i]=pos[n-i-1];
    for(int i=0; i<n; i++){
        if(i<k) dp1[i]=pos[i]*2;
        else dp1[i]=dp1[i-k]+1LL*pos[i]*2;
    }
    for(int i=0; i<n; i++){
        if(i<k) dp2[i]=(l+1-pos[n-i-1])*2;
        else dp2[i]=dp2[i-k]+1LL*(l+1-pos[n-i-1])*2;
    }
    //for(int i=0; i<n; i++) cout<<dp1[i]<<" "; cout<<endl;for(int i=0; i<n; i++) cout<<dp2[i]<<" "; cout<<endl;
    for(int i=0; i<n-1; i++){
        ans=min(ans, dp1[i]+dp2[n-2-i]);
    }
    ans=min(ans, min(dp1[n], dp2[n]));
    //cout<<"ans: "<<ans<<endl;
    if(n<=k) ans=min(ans, 1LL*l);
    else{
        for(int i=0; i<=n-k-2; i++){
            ans=min(ans, dp1[i]+l+dp2[n-2-k-i]);
        }
        ans=min(ans, 1LL*l+min(dp1[n-k-1], dp2[n-k-1]));
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:20:9: warning: variable 'pcarne' set but not used [-Wunused-but-set-variable]
     int pcarne[n];
         ^~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 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 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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