Submission #216759

#	Time	Username	Problem	Language	Result	Execution time	Memory
216759		LittleFlowers__	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	5 ms	384 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);

#include "boxes.h"

const int N=10000010;

long long f[N],g[N];

long long delivery(int n,int k,int l,int p[]){
    long long ret=LLONG_MAX;
    forinc(i,1,n) f[i]=f[max(0,i-k)]+2*p[i-1];
    fordec(i,n,1) g[i]=g[min(n+1,i+k)]+2*(l-p[i-1]);
    forinc(i,0,n){
        ret=min(ret,f[i]+g[i+1]);
        ret=min(ret,f[i]+g[min(n+1,i+k+1)]+l);
    }
    cout<<ret;
}

Compilation message (stderr)

boxes.cpp: In function 'int rnd(int, int)':
boxes.cpp:5:30: warning: conversion to 'int' from 'std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::result_type {aka long unsigned int}' may alter its value [-Wconversion]
 int rnd(int l,int r){return l+rng()%(r-l+1);}
                             ~^~~~~~~~~~~~~~
boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:37:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30