| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 54042 | robert | 선물상자 (IOI15_boxes) | C++14 | 컴파일 에러 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <algorithm>
using namespace std;
int dtz(int a, int L){
return min(a, L-a);
}
int delivery(int N, int K, int L, int *p){
p[N] = 0;
sort(p, p+N);
p[N+1] = 0;
long long ans = 0;
for(int n=0; n<=N; n++){
ans = min(ans, p[n] + (L-p[n+1]));
}
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:16:35: error: no matching function for call to 'min(long long int&, int)'
ans = min(ans, p[n] + (L-p[n+1]));
^
In file included from /usr/include/c++/7/bits/char_traits.h:39:0,
from /usr/include/c++/7/ios:40,
from /usr/include/c++/7/ostream:38,
from /usr/include/c++/7/iostream:39,
from boxes.cpp:1:
/usr/include/c++/7/bits/stl_algobase.h:195:5: note: candidate: template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)
min(const _Tp& __a, const _Tp& __b)
^~~
/usr/include/c++/7/bits/stl_algobase.h:195:5: note: template argument deduction/substitution failed:
boxes.cpp:16:35: note: deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
ans = min(ans, p[n] + (L-p[n+1]));
^
In file included from /usr/include/c++/7/bits/char_traits.h:39:0,
from /usr/include/c++/7/ios:40,
from /usr/include/c++/7/ostream:38,
from /usr/include/c++/7/iostream:39,
from boxes.cpp:1:
/usr/include/c++/7/bits/stl_algobase.h:243:5: note: candidate: template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)
min(const _Tp& __a, const _Tp& __b, _Compare __comp)
^~~
/usr/include/c++/7/bits/stl_algobase.h:243:5: note: template argument deduction/substitution failed:
boxes.cpp:16:35: note: deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
ans = min(ans, p[n] + (L-p[n+1]));
^
In file included from /usr/include/c++/7/algorithm:62:0,
from boxes.cpp:2:
/usr/include/c++/7/bits/stl_algo.h:3450:5: note: candidate: template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)
min(initializer_list<_Tp> __l)
^~~
/usr/include/c++/7/bits/stl_algo.h:3450:5: note: template argument deduction/substitution failed:
boxes.cpp:16:35: note: mismatched types 'std::initializer_list<_Tp>' and 'long long int'
ans = min(ans, p[n] + (L-p[n+1]));
^
In file included from /usr/include/c++/7/algorithm:62:0,
from boxes.cpp:2:
/usr/include/c++/7/bits/stl_algo.h:3456:5: note: candidate: template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)
min(initializer_list<_Tp> __l, _Compare __comp)
^~~
/usr/include/c++/7/bits/stl_algo.h:3456:5: note: template argument deduction/substitution failed:
boxes.cpp:16:35: note: mismatched types 'std::initializer_list<_Tp>' and 'long long int'
ans = min(ans, p[n] + (L-p[n+1]));
^
boxes.cpp:18:9: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
return ans;
^~~
boxes.cpp:10:25: warning: unused parameter 'K' [-Wunused-parameter]
int delivery(int N, int K, int L, int *p){
^