oj.uz

Submission #105178

# Submission time Handle Problem Language Result Execution time Memory
105178 2019-04-10T22:25:43 Z ly20 Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 3 ms 512 KB 
#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,(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

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:31:26: warning: left operand of comma operator has no effect [-Wunused-value]
  resp=min(resp,(volta[n-1],ida[n-1]));
                 ~~~~~~~~~^
boxes.cpp:34:12: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   int v=n-i-2;
         ~~~^~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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