제출 #1307295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1307295		opeleklanos	사탕 분배 (IOI21_candies)	C++20	컴파일 에러	0 ms	0 KiB

candies

#include <iostream>
#include <vector>
#include <algorithm>
#include "candies.h"
using namespace std;

#define ll long long

ll n;
vector<ll> segTree;
vector<ll> s;

void update(ll indx, ll l, ll r, ll a, ll b, ll x){
    if(a<=l && r<=b){
        segTree[indx] += (ll)x;
        return;
    }
    ll mid = (l+r)/2;
    if(a<=mid) update(indx*2+1, l, mid, a, min(mid, b), x);
    if(b>mid) update(indx*2+2, mid+1, r, max(mid+1, a), b, x);
}

void buildS(ll indx, ll l, ll r){
    if(l == r && l<n && l>=0){
        s[l] = segTree[indx];
        return;
    }
    ll mid = (l+r)/2;
    segTree[indx*2+1] += segTree[indx];
    segTree[indx*2+2] += segTree[indx];
    segTree[indx] = -1;
    buildS(indx*2+1, l, mid);
    buildS(indx*2+2, mid+1, r);
    return;
}

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
    s.assign(c.size(), 0);
    n = c.size();
    segTree.assign(n*3, 0);
    for(ll i = 0; i<l.size(); i++){
        update(0, 0, n-1, l[i], r[i], v[i]);
    }
    buildS(0, 0, n-1);
    vector<int> ans(n, 0);
    for(ll i = 0; i<n; i++) ans[i] = min(s[i], c[i]);
    return ans;
}

// ll main(void){
//     freopen("input.txt", "r", stdin);
//     ll ni, qu;
//     cin>>ni>>qu;
//     vector<ll> c1(ni), l1(qu), r1(qu), v1(qu);
//     for(ll i = 0; i<ni; i++) cin>>c1[i];
//     for(ll i = 0; i<qu; i++) cin>>l1[i]>>r1[i]>>v1[i];
//     // for(ll i = 0; i<qu; i++) cin>>r1[i];
//     // for(ll i = 0; i<qu; i++) cin>>v1[i];
//     vector<ll> ans = distribute_candies(c1, l1, r1, v1);
//     for(auto i : ans) cout<<i<<endl;
// }

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

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:46:41: 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&)'
   46 |     for(ll i = 0; i<n; i++) ans[i] = min(s[i], c[i]);
      |                                      ~~~^~~~~~~~~~~~
In file included from /usr/include/c++/13/string:51,
                 from /usr/include/c++/13/bits/locale_classes.h:40,
                 from /usr/include/c++/13/bits/ios_base.h:41,
                 from /usr/include/c++/13/ios:44,
                 from /usr/include/c++/13/ostream:40,
                 from /usr/include/c++/13/iostream:41,
                 from candies.cpp:1:
/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:
candies.cpp:46:41: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   46 |     for(ll i = 0; i<n; i++) ans[i] = min(s[i], c[i]);
      |                                      ~~~^~~~~~~~~~~~
/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:
candies.cpp:46:41: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   46 |     for(ll i = 0; i<n; i++) ans[i] = min(s[i], c[i]);
      |                                      ~~~^~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
                 from candies.cpp:3:
/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:
candies.cpp:46:41: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   46 |     for(ll i = 0; i<n; i++) ans[i] = min(s[i], c[i]);
      |                                      ~~~^~~~~~~~~~~~
/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:
candies.cpp:46:41: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   46 |     for(ll i = 0; i<n; i++) ans[i] = min(s[i], c[i]);
      |                                      ~~~^~~~~~~~~~~~