Submission #105179

#TimeUsernameProblemLanguageResultExecution timeMemory
105179ly20Boxes with souvenirs (IOI15_boxes)C++14
100 / 100
697 ms333304 KiB
#include<bits/stdc++.h> using namespace std; #define debug(args...) //fprintf(stderr,args) const int MAXN=11234567; long long ida[MAXN],volta[MAXN]; int vlt[MAXN]; long long delivery(int n1,int k1,int l1,int id[]) { long long n=n1,k=k1,l=l1; long long resp=MAXN*1123456789LL; for(int i=n-1;i>=0;i--) { vlt[n-i-1]=id[i]; } for(int i=0;i<n;i++) { long long p=2*id[i]; if(p>l)p=l; if(i<k)ida[i]=p; else ida[i]=ida[i-k]+p; debug("ida[%d]=%lld\n",i,ida[i]); } for(int i=0;i<n;i++) { long long p=2*(l-vlt[i]); if(p>l)p=l; if(i<k)volta[i]=p; else volta[i]=volta[i-k]+p; debug("vlt[%d]=%lld\n",i,volta[i]); } resp=min(resp,min(volta[n-1],ida[n-1])); for(int i=0;i<n-1;i++) { int v=n-i-2; debug("ida=%d volta=%d\n",i,v); resp=min(resp,ida[i]+volta[v]); } return resp; } /*int ps[MAXN]; int main() { int n,k,l; scanf("%d %d %d",&n,&k,&l); for(int i=0;i<n;i++) { scanf("%d",&ps[i]); } printf("%lld\n",delivery(n,k,l,ps)); }*/

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:11:13: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  for(int i=n-1;i>=0;i--)
            ~^~
boxes.cpp:34:12: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   int v=n-i-2;
         ~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...