답안 #624392

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
624392	2022-08-08T06:15:00 Z	John3_141592	사탕 분배 (IOI21_candies)	C++17	컴파일 오류	0 ms	0 KB

candies

#include "candies.h"

#include <bits/stdc++.h>
#define ll long long

using namespace std;

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,std::vector<int> r, std::vector<int> v) {
    int n=c.size(),q=l.size();
    vector <ll> vec;
    for(int i=0;i<=n;i++) vec.push_back(0);
    for(int i=0;i<q;i++) vec[l[i]]+=v[i],vec[r[i]+1]-=v[i];
    vector <ll> solve;
    solve.push_back(vec[0]);
    for(int i=1;i<n;i++) solve.push_back(vec[i]+solve[i-1]);
    for(int i=0;i<n;i++) solve[i]=min(solve[i],c[i]);
    vector <int> solvedevdd;
    for(int i=0;i<n;i++) solvedevdd.push_back(solve[i]);
    return solvedevdd;
}

Compilation message

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:16:52: error: no matching function for call to 'min(__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type&, __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type&)'
   16 |     for(int i=0;i<n;i++) solve[i]=min(solve[i],c[i]);
      |                                                    ^
In file included from /usr/include/c++/10/vector:60,
                 from candies.h:1,
                 from candies.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
candies.cpp:16:52: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   16 |     for(int i=0;i<n;i++) solve[i]=min(solve[i],c[i]);
      |                                                    ^
In file included from /usr/include/c++/10/vector:60,
                 from candies.h:1,
                 from candies.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  278 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:278:5: note:   template argument deduction/substitution failed:
candies.cpp:16:52: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   16 |     for(int i=0;i<n;i++) solve[i]=min(solve[i],c[i]);
      |                                                    ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from candies.cpp:3:
/usr/include/c++/10/bits/stl_algo.h:3468:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3468 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
candies.cpp:16:52: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   16 |     for(int i=0;i<n;i++) solve[i]=min(solve[i],c[i]);
      |                                                    ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from candies.cpp:3:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3474 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3474:5: note:   template argument deduction/substitution failed:
candies.cpp:16:52: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   16 |     for(int i=0;i<n;i++) solve[i]=min(solve[i],c[i]);
      |                                                    ^