Submission #163403

#TimeUsernameProblemLanguageResultExecution timeMemory
163403davitmargRail (IOI14_rail)C++17
Compilation error
0 ms0 KiB
/*DavitMarg*/ #include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #include <set> #include <queue> #include <iomanip> #include <bitset> #include <stack> #include <cassert> #include <iterator> #include <fstream> #define mod 1000000007ll #define LL long long #define LD long double #define MP make_pair #define PB push_back #define all(v) v.begin(), v.end() using namespace std; #ifndef death #include "rail.h" #endif #ifdef death int getDistance(int a, int b) { cout << a << " : " << b << endl; cin >> a; return a; } #endif void findLocation(int n, int POS, int location[], int stype[]) { location[0] = POS; stype[0] = 1; vector<pair<int, LL>> x; vector<pair<int, LL>> R, L; for (int i = 1; i < n; i++) { LL d = getDistance(0, i); x.PB(MP(i, d)); } sort(all(x), [](int a, int b) { return a.second < b.second; }); R.PB(x[0]); for (int i = 1; i < x.size(); i++) { LL d = getDistance(R[0].first, x[i].first); if (d == x[i].second + R[0].second) R.PB(x[i]); else if (x[i].second == R[0].second + d) L.PB(x[i]); else assert(0); } for (int i = 0; i < R.size(); i++) { location[R[i].first] = POS + R[i].second; stype[R[i].first] = 2; } for (int i = 0; i < L.size(); i++) { LL d = R[0].second; location[L[i].first] = POS - (L[i].second - d - d + 1) + 1; stype[L[i].first] = 1; } } #ifdef death int main() { int N, FR = 0, LOC[102], TYP[102]; cin >> N; findLocation(N, FR, LOC, TYP); for (int i = 0; i < N; i++) { cout << LOC[i] << " : " << TYP[i] << endl; } return 0; } #endif /* 4 3 4 8 7 6 */

Compilation message (stderr)

rail.cpp: In lambda function:
rail.cpp:51:18: error: request for member 'second' in 'a', which is of non-class type 'int'
         return a.second < b.second;
                  ^~~~~~
rail.cpp:51:29: error: request for member 'second' in 'b', which is of non-class type 'int'
         return a.second < b.second;
                             ^~~~~~
rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:54:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < x.size(); i++)
                     ~~^~~~~~~~~~
rail.cpp:64:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < R.size(); i++)
                     ~~^~~~~~~~~~
rail.cpp:70:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < L.size(); i++)
                     ~~^~~~~~~~~~
In file included from /usr/include/c++/7/bits/stl_algobase.h:71:0,
                 from /usr/include/c++/7/bits/char_traits.h:39,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/ostream:38,
                 from /usr/include/c++/7/iostream:39,
                 from rail.cpp:2:
/usr/include/c++/7/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<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = findLocation(int, int, int*, int*)::<lambda(int, int)>]':
/usr/include/c++/7/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<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1921:34:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1953:38:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1968:25:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:4868:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = findLocation(int, int, int*, int*)::<lambda(int, int)>]'
rail.cpp:52:6:   required from here
/usr/include/c++/7/bits/predefined_ops.h:143:18: error: no match for call to '(findLocation(int, int, int*, int*)::<lambda(int, int)>) (std::pair<int, long long int>&, std::pair<int, long long int>&)'
         { return bool(_M_comp(*__it1, *__it2)); }
                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/7/bits/predefined_ops.h:143:18: note: candidate: void (*)(int, int) <conversion>
/usr/include/c++/7/bits/predefined_ops.h:143:18: note:   candidate expects 3 arguments, 3 provided
rail.cpp:50:33: note: candidate: findLocation(int, int, int*, int*)::<lambda(int, int)>
     sort(all(x), [](int a, int b) {
                                 ^
rail.cpp:50:33: note:   no known conversion for argument 1 from 'std::pair<int, long long int>' to 'int'
In file included from /usr/include/c++/7/bits/stl_algobase.h:71:0,
                 from /usr/include/c++/7/bits/char_traits.h:39,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/ostream:38,
                 from /usr/include/c++/7/iostream:39,
                 from rail.cpp:2:
/usr/include/c++/7/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<int, long long int>; _Iterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = findLocation(int, int, int*, int*)::<lambda(int, int)>]':
/usr/include/c++/7/bits/stl_algo.h:1828:20:   required from 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1855:36:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1885:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1971:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:4868:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = findLocation(int, int, int*, int*)::<lambda(int, int)>]'
rail.cpp:52:6:   required from here
/usr/include/c++/7/bits/predefined_ops.h:215:11: error: no match for call to '(findLocation(int, int, int*, int*)::<lambda(int, int)>) (std::pair<int, long long int>&, std::pair<int, long long int>&)'
  { return bool(_M_comp(__val, *__it)); }
           ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/7/bits/predefined_ops.h:215:11: note: candidate: void (*)(int, int) <conversion>
/usr/include/c++/7/bits/predefined_ops.h:215:11: note:   candidate expects 3 arguments, 3 provided
rail.cpp:50:33: note: candidate: findLocation(int, int, int*, int*)::<lambda(int, int)>
     sort(all(x), [](int a, int b) {
                                 ^
rail.cpp:50:33: note:   no known conversion for argument 1 from 'std::pair<int, long long int>' to 'int'
In file included from /usr/include/c++/7/bits/stl_algobase.h:71:0,
                 from /usr/include/c++/7/bits/char_traits.h:39,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/ostream:38,
                 from /usr/include/c++/7/iostream:39,
                 from rail.cpp:2:
/usr/include/c++/7/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Value = std::pair<int, long long int>; _Compare = findLocation(int, int, int*, int*)::<lambda(int, int)>]':
/usr/include/c++/7/bits/stl_heap.h:133:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Distance = long int; _Tp = std::pair<int, long long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_heap.h:237:23:   required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Distance = long int; _Tp = std::pair<int, long long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_heap.h:342:22:   required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1672:23:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1933:25:   required from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1948:27:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:1968:25:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<findLocation(int, int, int*, int*)::<lambda(int, int)> >]'
/usr/include/c++/7/bits/stl_algo.h:4868:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, long long int>*, std::vector<std::pair<int, long long int> > >; _Compare = findLocation(int, int, int*, int*)::<lambda(int, int)>]'
rail.cpp:52:6:   required from here
/usr/include/c++/7/bits/predefined_ops.h:177:11: error: no match for call to '(findLocation(int, int, int*, int*)::<lambda(int, int)>) (std::pair<int, long long int>&, std::pair<int, long long int>&)'
  { return bool(_M_comp(*__it, __val)); }
           ^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/7/bits/predefined_ops.h:177:11: note: candidate: void (*)(int, int) <conversion>
/usr/include/c++/7/bits/predefined_ops.h:177:11: note:   candidate expects 3 arguments, 3 provided
rail.cpp:50:33: note: candidate: findLocation(int, int, int*, int*)::<lambda(int, int)>
     sort(all(x), [](int a, int b) {
                                 ^
rail.cpp:50:33: note:   no known conversion for argument 1 from 'std::pair<int, long long int>' to 'int'