| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 348064 | blue | 카니발 티켓 (IOI20_tickets) | C++17 | 컴파일 에러 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "tickets.h"
#include <vector>
#include <algorithm>
using namespace std;
int n, m;
vector< vector<int> > X;
long long find_maximum(int k, vector< vector<int> > x)
{
n = x.size();
m = x[0].size();
X = x;
vector<int> ind(n);
for(int i = 0; i < n; i++) ind[i] = i;
sort(ind.begin(), ind.end(), [] (int p, int q)
{
return (x[p][0] + x[p][m-1]) < (y[p][0] + y[p][m-1]);
});
long long res = 0;
vector< vector<int> > s(n, vector<int>(m, -1));
for(int i = 0; i < n/2; i++)
{
s[ind[i]][0] = 0;
res -= x[ind[i]][0];
}
for(int i = n/2; i < n; i++)
{
s[ind[i]][m-1] = 0;
res += x[ind[i]][m-1];
}
allocate_tickets(s);
return res;
}
컴파일 시 표준 에러 (stderr) 메시지
tickets.cpp: In lambda function:
tickets.cpp:19:17: error: 'x' is not captured
19 | return (x[p][0] + x[p][m-1]) < (y[p][0] + y[p][m-1]);
| ^
tickets.cpp:17:35: note: the lambda has no capture-default
17 | sort(ind.begin(), ind.end(), [] (int p, int q)
| ^
tickets.cpp:9:53: note: 'std::vector<std::vector<int> > x' declared here
9 | long long find_maximum(int k, vector< vector<int> > x)
| ~~~~~~~~~~~~~~~~~~~~~~^
tickets.cpp:19:27: error: 'x' is not captured
19 | return (x[p][0] + x[p][m-1]) < (y[p][0] + y[p][m-1]);
| ^
tickets.cpp:17:35: note: the lambda has no capture-default
17 | sort(ind.begin(), ind.end(), [] (int p, int q)
| ^
tickets.cpp:9:53: note: 'std::vector<std::vector<int> > x' declared here
9 | long long find_maximum(int k, vector< vector<int> > x)
| ~~~~~~~~~~~~~~~~~~~~~~^
tickets.cpp:19:41: error: 'y' was not declared in this scope
19 | return (x[p][0] + x[p][m-1]) < (y[p][0] + y[p][m-1]);
| ^
In file included from /usr/include/c++/9/bits/stl_algobase.h:71,
from /usr/include/c++/9/vector:60,
from tickets.h:1,
from tickets.cpp:1:
/usr/include/c++/9/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Iterator2 = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)>]':
/usr/include/c++/9/bits/stl_algo.h:81:17: required from 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1920:34: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1952:38: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1967:25: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:4899:18: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)>]'
tickets.cpp:20:6: required from here
/usr/include/c++/9/bits/predefined_ops.h:143:18: error: void value not ignored as it ought to be
143 | { return bool(_M_comp(*__it1, *__it2)); }
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = int; _Iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)>]':
/usr/include/c++/9/bits/stl_algo.h:1827:20: required from 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1854:36: required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1884:25: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1970:31: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:4899:18: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)>]'
tickets.cpp:20:6: required from here
/usr/include/c++/9/bits/predefined_ops.h:215:11: error: void value not ignored as it ought to be
215 | { return bool(_M_comp(__val, *__it)); }
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Value = int; _Compare = find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)>]':
/usr/include/c++/9/bits/stl_heap.h:133:48: required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_val<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_heap.h:237:23: required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_heap.h:342:22: required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1671:23: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1932:25: required from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1947:27: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:1967:25: required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)> >]'
/usr/include/c++/9/bits/stl_algo.h:4899:18: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = find_maximum(int, std::vector<std::vector<int> >)::<lambda(int, int)>]'
tickets.cpp:20:6: required from here
/usr/include/c++/9/bits/predefined_ops.h:177:11: error: void value not ignored as it ought to be
177 | { return bool(_M_comp(*__it, __val)); }
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~