제출 #1285260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285260		AndriaBeridze	Boxes with souvenirs (IOI15_boxes)	C++20	컴파일 에러	0 ms	0 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    vector<pair<int, int>> v;
    for (int i = 0; i < N; i++) {
        if (p[i] > L / 2) {
            v.push_back({ L - p[i], 1 });
        } else {
            v.push_back({ p[i], 0 });
        }
    }
    
    sort(v.rbegin(), v.rend());

    vector<int> l, r;
    for (int i = 0; i < N; i++) (v[i].second ? r : l).push_back(v[i].first);
    
    vector<long long> dpl((int) l.size() + 1, 0), dpr((int) r.size() + 1, 0);
    for (int i = (int) l.size() - 1; i >= 0; i--) {
        dpl[i] = l[i] * 2;
        if (i + K < size(l)) dpl[i] += dpl[i + K];
    }

    for (int i = (int) r.size() - 1; i >= 0; i--) {
        dpr[i] = r[i] * 2;
        if (i + K < size(r)) dpr[i] += dpr[i + K]; 
    }

    // for (int x : dpr) cout << x << ' ';
    // cout << endl;

    long long ans = (long long) 1e18;
    int cl, cr; cl = cr = 0;
    for (int i = 0; i < N; i++) {
        if (i % K == 0) {
            ans = min(ans, i / K * L + dpl[cl] + dpr[cr]);
            // cout << i << ' ' << i / K << ' ' << dpl[cl] << ' ' << dpr[cr] << endl;
        }

        if (v[i].second) cr++;
        else cl++;
    }
    
    if (K >= N) ans = min(ans, L);
    return ans;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:46:26: error: no matching function for call to 'min(long long int&, int&)'
   46 |     if (K >= N) ans = min(ans, L);
      |                       ~~~^~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from boxes.cpp:2:
/usr/include/c++/13/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
boxes.cpp:46:26: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   46 |     if (K >= N) ans = min(ans, L);
      |                       ~~~^~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note:   template argument deduction/substitution failed:
boxes.cpp:46:26: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   46 |     if (K >= N) ans = min(ans, L);
      |                       ~~~^~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5775:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5775 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5775:5: note:   template argument deduction/substitution failed:
boxes.cpp:46:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   46 |     if (K >= N) ans = min(ans, L);
      |                       ~~~^~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5785 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5785:5: note:   template argument deduction/substitution failed:
boxes.cpp:46:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   46 |     if (K >= N) ans = min(ans, L);
      |                       ~~~^~~~~~~~