Submission #69543

# Submission time Handle Problem Language Result Execution time Memory
69543 2018-08-21T08:30:13 Z yusufake Boxes with souvenirs (IOI15_boxes) C++
0 / 100
2 ms 404 KB
#include<bits/stdc++.h>
using namespace std;
#include "boxes.h"

#define lint long long
#define mx 10000007
#define mp make_pair
#define st first
#define nd second
pair<lint,int> Q[mx],QQ[mx];
lint i,dp,t,l,r,ll,rr;
lint delivery(int n, int k, int L, int *p){
    Q[r++] = mp(0,-1);
    QQ[rr++] = mp(L+L,-1);
    for(i=0;i<n;i++){
        if(Q[l].nd == i-k-1) l++;
        if(QQ[ll].nd == i-k-1) ll++;
        dp = Q[l].st + min(p[i]*2 , L);
        dp = min(dp , QQ[ll].st);
        for(; Q[r-1].st > dp ;) r--;
        t = dp + min(L , 2*(L-p[i]));
        for(; QQ[rr-1].st > t ;) rr--;
        Q[r++] = mp(dp,i);
        QQ[rr++] = mp(t,i);
    }
    return dp;
}
# 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 -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Incorrect 2 ms 404 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -
# 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 -
# 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 -
# 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 -