제출 #1360275

#제출 시각아이디문제언어결과실행 시간메모리
1360275phungmanager0모임들 (IOI18_meetings)C++20
컴파일 에러
0 ms0 KiB
#include "meetings.h"
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define FORE(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define IS_INF(x)   (std::isinf(x))
#define IS_NAN(x)   (std::isnan(x))
#define fi   first
#define se   second
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define div   ___div
#define prev   ___prev
#define next   ___next
#define left   ___leftc
#define right   ___right
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define __builtin_popcount __builtin_popcountll
using namespace std;
const int MAXN = 2e5 + 5;
const long long INF = 1e18;
int n, q;
vector<long long> solve_subtask1(const vector<int>& H, const vector<int>& L, const vector<int>& R) {
    vector<long long> answer; REP(i, q) {
        int l = L[i], r = R[i]; long long ans = INF; FOR(j, l, r) {
            long long res = H[j], mx = H[j]; FORD(k, j - 1, l) { mx = max(mx, H[k]); res += mx; }
            mx = H[j]; FOR(k, j + 1, r) { mx = max(mx, H[k]); res += mx; }
            ans = min(ans, res);
        }
        answer.push_back(ans);
    }
    return answer;
}
vector<long long> minimum_cost(vector<int> H, vector<int> L, vector<int> R) {
    n = (int)H.size(); q = (int)L.size();
    if(n <= 3000 && q<= 10) return solve_subtask1(H, L, R);
    return {};
}
/*void read_fake_input() {
    int n, q; vector<int> H, L, R; cin >> n >> q; REP(i, n) {
        int x; cin >> x; H.push_back(x);
    } REP(i, q) { int x; cin >> x; L.push_back(x); } REP(i, q) {
        int x; cin >> x; R.push_back(x);
    }
    vector<int> res = minimum_cost(H, L, R); FORE(it, res) cout << (*it) << "\n";
}
__Im_sogood__{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    read_fake_input();
    cerr << "Time elapsed: " << TIME << " s.\n";
    return 0;
}*/

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

meetings.cpp: In function 'std::vector<long long int> solve_subtask1(const std::vector<int>&, const std::vector<int>&, const std::vector<int>&)':
meetings.cpp:28:74: error: no matching function for call to 'max(long long int&, const __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type&)'
   28 |             long long res = H[j], mx = H[j]; FORD(k, j - 1, l) { mx = max(mx, H[k]); res += mx; }
      |                                                                       ~~~^~~~~~~~~~
In file included from /usr/include/c++/13/vector:62,
                 from meetings.h:3,
                 from meetings.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
meetings.cpp:28:74: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   28 |             long long res = H[j], mx = H[j]; FORD(k, j - 1, l) { mx = max(mx, H[k]); res += mx; }
      |                                                                       ~~~^~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
meetings.cpp:28:74: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   28 |             long long res = H[j], mx = H[j]; FORD(k, j - 1, l) { mx = max(mx, H[k]); res += mx; }
      |                                                                       ~~~^~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from meetings.cpp:2:
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
meetings.cpp:28:74: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   28 |             long long res = H[j], mx = H[j]; FORD(k, j - 1, l) { mx = max(mx, H[k]); res += mx; }
      |                                                                       ~~~^~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
meetings.cpp:28:74: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   28 |             long long res = H[j], mx = H[j]; FORD(k, j - 1, l) { mx = max(mx, H[k]); res += mx; }
      |                                                                       ~~~^~~~~~~~~~
meetings.cpp:29:51: error: no matching function for call to 'max(long long int&, const __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type&)'
   29 |             mx = H[j]; FOR(k, j + 1, r) { mx = max(mx, H[k]); res += mx; }
      |                                                ~~~^~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
meetings.cpp:29:51: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   29 |             mx = H[j]; FOR(k, j + 1, r) { mx = max(mx, H[k]); res += mx; }
      |                                                ~~~^~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
meetings.cpp:29:51: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   29 |             mx = H[j]; FOR(k, j + 1, r) { mx = max(mx, H[k]); res += mx; }
      |                                                ~~~^~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
meetings.cpp:29:51: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   29 |             mx = H[j]; FOR(k, j + 1, r) { mx = max(mx, H[k]); res += mx; }
      |                                                ~~~^~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
meetings.cpp:29:51: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   29 |             mx = H[j]; FOR(k, j + 1, r) { mx = max(mx, H[k]); res += mx; }
      |                                                ~~~^~~~~~~~~~