oj.uz

Submission #363602

# Submission time Handle Problem Language Result Execution time Memory
363602 2021-02-06T16:46:30 Z Sparky_09 Boxes with souvenirs (IOI15_boxes) C++17
0 / 100
 153 ms 235244 KB 
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;

void usaco(string s){
  freopen((s+".in").c_str(), "r", stdin);
  freopen((s+".out").c_str(), "w", stdout);
}

ll maxn = 1e7+1000, n1, k1, l1;
vector<ll> pre(maxn+2, 0), suf(maxn+2, 0), pos1(maxn+2);

int delivery(int n, int k, int l, int pos[]){
	n1=n;k1=k;l1=l;
	for(int i = 0; i < n; i++) pos1[i] = pos[i];
	for(int i = 0; i < n; i++){
	  pre[i] = (i>=k?pre[i-k]+min(l1,2*pos1[i]):min(l1,2*pos1[i]));
	}
	for(int i = n-1; i >= 0; i--){
	  suf[i] = (i<=n-1-k?suf[i+k]+min(l1,2*(l1-pos1[i])):min(l1,2*(l1-pos1[i])));
	}
	ll ans = min(pre[0],suf[0]);
	for(int i = 0; i < n; i++){
	  ans = min(ans,  pre[i] + suf[i+1]);
	}
	return ans;
}

Compilation message

boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:33:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   33 |  return ans;
      |         ^~~
boxes.cpp: In function 'void usaco(std::string)':
boxes.cpp:13:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   13 |   freopen((s+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:14:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   14 |   freopen((s+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 235116 KB Output is correct
2 Incorrect 133 ms 235244 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 235116 KB Output is correct
2 Incorrect 133 ms 235244 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 235116 KB Output is correct
2 Incorrect 133 ms 235244 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 235116 KB Output is correct
2 Incorrect 133 ms 235244 KB Output isn't correct
3 Halted 0 ms 0 KB -