제출 #363581

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
363581		Sparky_09	선물상자 (IOI15_boxes)	C++17	0 / 100	1 ms	768 KiB

boxes

#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);
}

int delivery(int n, int k, int l, int pos[]){
	vector<ll> pre(n+2, 0), suf(n+2, 0);
	for(int i = 1; i <= n; i++){
	  pre[i] = pre[i-k>=0?i-k:0] + 2 * pos[i-1];
	  suf[i] = suf[i-k>=0?i-k:0] + 2 * (l - pos[n-i]);
	}
	ll ans = 1e18;
	for(int i = 0; i <= n; i++){
	  ans = min(ans, min({pre[i] + suf[n-i-k>0?n-i-k:0] + l, pre[i] + suf[n-i]}));
	}
	reverse(pos, pos + n + 1);
	vector<ll> pre1(n+2, 0), suf1(n+2, 0);
	for(int i = 1; i <= n; i++){
	  pre1[i] = pre1[i-k>=0?i-k:0] + 2 * pos[i-1];
	  suf1[i] = suf1[i-k>=0?i-k:0] + 2 * (l - pos[n-i]);
	}
	for(int i = 0; i <= n; i++){
	  ans = min(ans, min({pre1[i] + suf1[n-i-k>0?n-i-k:0] + l, pre1[i] + suf1[n-i]}));
	}
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:36:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   36 |  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
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30