QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#770211	#9528. New Energy Vehicle	zhisheng	Compile Error	/	/	C++23	1.7kb	2024-11-21 21:08:46	2024-11-21 21:08:47

Judging History

This is the latest submission verdict.

[2024-11-21 21:08:47]
Judged

Verdict: Compile Error
Time: 0ms
Memory: 0kb

Show

[2024-11-21 21:08:46]
Submitted

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    ios::sync_with_stdio(false),cout.tie(nullptr),cin.tie(nullptr);
    auto solve=[&]() {
        int n,m;
        cin >> n >> m;
        vector <int> a(n +m+1),now(n + m + 1),pos(n + m + 1);
        vector <int> xi(n + m + 1),lst(m + n + 1),nxt(n+m + 1),fir(n+m + 1);
        for(int i=1;i<=n;i++) cin >> a[i],now[i] = a[i];
        for(int i=1;i<=m;i++) cin >> pos[i] >> xi[i];
        for(int i=1;i<=n;i++) fir[i] = m + 1,lst[i] = 0;
        for(int i=1;i<=m;i++) {
            if( fir[xi[i]] > m ) fir[xi[i]] = i;
            if(lst[xi[i]]) nxt[lst[xi[i]]] = i;
        }
        for(int i=1;i<=n;i++) {
            if(lst[i]) nxt[lst[i]] = m + 1;
        }
        set <pair<int,int>> s;
        for(int i=1;i<=n;i++) {
            s.insert({fir[i],i});
        }
        int sum = 0;
        for(int i=1;i<=m;i++) {
            int r = pos[i] - pos[i-1];
            while(!s.empty() && now[s.begin()->second] <=r) {
                int k = s.begin()->second;
                sum += now[k];
                r -= now[k];
                now[k] = 0;
                s.erase(s.begin());
            }
            if(s.empty() && r > 0) {
                cout << sum << "\n";
                return;
            }
            now[s.begin()->second] -= r;
            sum += r;
            now[xi[i]] = a[xi[i]];
            if(s.find({i,xi[i]})!=s.end()) {
                s.erase({i,xi[i]});
            }
            s.insert(nxt[i],i);
        }
        for(int i=1;i<=n;i++) sum += now[i];
        cout << sum << "\n";

    };
    int t = 1;
    cin>>t;
    while(t--) {
       solve();
    }
    return 0;
}

源文件, 语言: C++23

详细

In file included from /usr/include/c++/13/set:63,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:158,
                 from answer.code:1:
/usr/include/c++/13/bits/stl_set.h: In instantiation of ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = long long int; _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]’:
answer.code:45:21:   required from here
/usr/include/c++/13/bits/stl_set.h:569:38: error: no matching function for call to ‘std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_insert_range_unique(long long int&, long long int&)’
  569 |         { _M_t._M_insert_range_unique(__first, __last); }
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/map:62,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:152:
/usr/include/c++/13/bits/stl_tree.h:1100:9: note: candidate: ‘template<class _InputIterator> std::__enable_if_t<std::is_same<_Val, typename std::iterator_traits<_InputIterator>::value_type>::value> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_range_unique(_InputIterator, _InputIterator) [with _Key = std::pair<long long int, long long int>; _Val = std::pair<long long int, long long int>; _KeyOfValue = std::_Identity<std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]’
 1100 |         _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
      |         ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h:1100:9: note:   template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_tree.h: In substitution of ‘template<class _InputIterator> std::__enable_if_t<std::is_same<std::pair<long long int, long long int>, typename std::iterator_traits< <template-parameter-1-1> >::value_type>::value, void> std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_insert_range_unique(_InputIterator, _InputIterator) [with _InputIterator = long long int]’:
/usr/include/c++/13/bits/stl_set.h:569:31:   required from ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = long long int; _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]’
answer.code:45:21:   required from here
/usr/include/c++/13/bits/stl_tree.h:1100:9: error: no type named ‘value_type’ in ‘struct std::iterator_traits<long long int>’
/usr/include/c++/13/bits/stl_set.h: In instantiation of ‘void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = long long int; _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]’:
answer.code:45:21:   required from here
/usr/include/c++/13/bits/stl_tree.h:1109:9: note: candidate: ‘template<class _InputIterator> std::__enable_if_t<(! std::is_same<_Val, typename std::iterator_traits<_InputIterator>::value_type>::value)> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_range_unique(_InputIterator, _InputIterator) [with _Key = std::pair<long long int, long long int>; _Val = std::pair<long long int, long long int>; _KeyOfValue = std::_Identity<std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]’
 1109 |         _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
      |         ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_tree.h:1109:9: note:   template argument deduction/substitution failed:
/usr/include/c++/13/bits/stl_tree.h: In substitution of ‘template<class _InputIterator> std::__enable_if_t<(! std::is_same<std::pair<long long int, long long int>, typename std::iterator_traits< <template-parameter-1-1> >::value_type>::value), void> std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_insert_range_unique(_InputIterator, _InputI...