제출 #893077

#제출 시각아이디문제언어결과실행 시간메모리
8930778pete8Boxes with souvenirs (IOI15_boxes)C++17
컴파일 에러
0 ms0 KiB
#include "boxes.h" #include<iostream> #include<stack> #include<map> #include<vector> #include<string> #include<unordered_map> #include <queue> #include<cstring> #include<float.h> #include<limits.h> #include <cassert> #include<cmath> #include<set> #include<algorithm> #include <iomanip> #include<numeric> //gcd(a,b) #include<bitset> using namespace std; #define ll long long #define f first #define endl "\n" #define s second #define pii pair<int,int> #define ppii pair<pii,int> #define vi vector<int> #define pb push_back #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define F(n) for(int i=0;i<n;i++) #define lb lower_bound #define ub upper_bound #define fastio ios::sync_with_stdio(false);cin.tie(NULL); #pragma GCC optimize ("03,unroll-loops") //#define int long long using namespace std; //const int mod=998244353,mxn=2e5+5,lg=30,inf=1e9,minf=-1e9,Mxn=100000; long long delivery(int N, int K, int L, int p[]) { vector<ll>l,r; vector<ll>ps(N+1,0),sf(N+1,0); vector<ll>cnt(0); for(int i=0;i<N;i++){ if(p[i]==0)continue; l.pb(p[i]); r.pb(L-p[i]); } N=l.size(); for(int i=0;i<N;i++){ if(i-K<0)ps[i]=l[i]*2; else ps[i]=ps[i-K]+l[i]*2; } for(int i=N-1;i>=0;i--){ if(i+K>=N)sf[i]=r[i]*2; else sf[i]=sf[i+K]+r[i]*2; } ll ans=(ceil(N*1.0/K)*L); ans=min(ans,ps[N-1]); ans=min(ans,sf[0]); for(int i=0;i<N;i++){ for(int j=N-1;j>i;j--){ ll a=(ceil((j-i-1)*1.0/K))*L; ans=min(ans,a+ps[i]+sf[j]); } } return ans; } int32_t main(){ int n,k,l;cin>>n>>k>>l; int v[n]; for(int i=0;i<n;i++)cin>>v[i]; cout<<delivery(n,k,l,v); }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:47:13: warning: conversion from 'std::vector<long long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   47 |     N=l.size();
      |       ~~~~~~^~
boxes.cpp:56:26: warning: conversion from 'double' to 'long long int' may change value [-Wfloat-conversion]
   56 |     ll ans=(ceil(N*1.0/K)*L);
      |            ~~~~~~~~~~~~~~^~~
boxes.cpp:61:39: warning: conversion from 'double' to 'long long int' may change value [-Wfloat-conversion]
   61 |             ll a=(ceil((j-i-1)*1.0/K))*L;
      |                  ~~~~~~~~~~~~~~~~~~~~~^~
/usr/bin/ld: /tmp/ccU6auys.o: in function `main':
grader.c:(.text.startup+0x0): multiple definition of `main'; /tmp/ccHwYp0t.o:boxes.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status