제출 #511441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
511441		Tizariox	악어의 지하 도시 (IOI11_crocodile)	C++14	컴파일 에러	0 ms	0 KiB

이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.

crocodile

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, ll>;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define F0R1(i, a) for (int i = 1; i <= (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define F0Rd1(i, a) for (int i = a; i > 0; i--)
#define SORT(vec) sort(vec.begin(), vec.end())
#define S0RT(arr, n) sort(arr, arr + n)

#define pA first
#define pB second
#define MOD 1000000007
#define nl "\n"
#define pb push_back

int n, m, k;
vector<int> exits;

class cmp {
  public:
	bool operator()(vector<int> a, vector<int> b) { return a[1] > b[1]; }
};

pair<ll, ll> dist[100000]; // 2 smallest distances to each node
vector<pii> adj[100000];
bool shortestVis[100000]; // whether the shortest path for each node has already been taken

void dijkstra() { // traceback
	for (int i = 0; i < n; i++) {
		dist[i] = {1e18, 1e18};
		shortestVis[i] = false;
	}
	priority_queue<vector<ll>, vector<vector<ll>>, cmp> nodes;
	for (int root : exits) {
		dist[root] = {0, 0};
		nodes.push({root, 0, -1});
		shortestVis[root] = true;
	}
	while (!nodes.empty()) {
		int node = nodes.top()[0];
		ll minDist = nodes.top()[1];
		int parent = nodes.top()[2];
		nodes.pop();
		if (!shortestVis[node]) {
			shortestVis[node] = true;
			continue;
		} else if (minDist > dist[node].pB) {
			continue;
		}
		for (pii i : adj[node]) {
			int neighbor = i.pA;
			int length = i.pB;
			if (minDist + length < dist[neighbor].pA) {
				dist[neighbor].pB = dist[neighbor].pA;
				dist[neighbor].pA = minDist + length;
				nodes.push({neighbor, dist[neighbor].pA, node});
			} else if (minDist + length < dist[neighbor].pB) {
				dist[neighbor].pB = minDist + length;
				nodes.push({neighbor, dist[neighbor].pB, node});
			}
		}
	}
}

ll travel_plan(int n1, int m1, int (*r1) [2], int* L, int k1, int* P) {
	n = n1;
	m = m1;
	k = k1;
	for (int i = 0; i < m; i++) {
		int a, b, c;
		a = r1[i][0];
		b = r1[i][1];
		c = L[i];
		adj[a].pb(pii(b, c));
		adj[b].pb(pii(a, c));
	}
	FOR(i, 0, k) { 
		exits.pb(P[i]);
	}
	dijkstra();
	return dist[0].pB;
}

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

crocodile.cpp: In function 'void dijkstra()':
crocodile.cpp:48:7: warning: unused variable 'parent' [-Wunused-variable]
   48 |   int parent = nodes.top()[2];
      |       ^~~~~~
In file included from /usr/include/c++/10/bits/stl_algobase.h:71,
                 from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from crocodile.cpp:1:
/usr/include/c++/10/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::vector<long long int>*, std::vector<std::vector<long long int> > >; _Value = std::vector<long long int>; _Compare = cmp]':
/usr/include/c++/10/bits/stl_heap.h:139:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<long long int>*, std::vector<std::vector<long long int> > >; _Distance = long int; _Tp = std::vector<long long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<cmp>]'
/usr/include/c++/10/bits/stl_heap.h:215:23:   required from 'void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::vector<long long int>*, std::vector<std::vector<long long int> > >; _Compare = cmp]'
/usr/include/c++/10/bits/stl_queue.h:651:16:   required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::vector<long long int>; _Sequence = std::vector<std::vector<long long int> >; _Compare = cmp; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::vector<long long int>]'
crocodile.cpp:42:27:   required from here
/usr/include/c++/10/bits/predefined_ops.h:194:23: error: no match for call to '(cmp) (std::vector<long long int>&, std::vector<long long int>&)'
  194 |  { return bool(_M_comp(*__it, __val)); }
      |                ~~~~~~~^~~~~~~~~~~~~~
crocodile.cpp:27:7: note: candidate: 'bool cmp::operator()(std::vector<int>, std::vector<int>)'
   27 |  bool operator()(vector<int> a, vector<int> b) { return a[1] > b[1]; }
      |       ^~~~~~~~
crocodile.cpp:27:30: note:   no known conversion for argument 1 from 'vector<long long int>' to 'vector<int>'
   27 |  bool operator()(vector<int> a, vector<int> b) { return a[1] > b[1]; }
      |                  ~~~~~~~~~~~~^
In file included from /usr/include/c++/10/bits/stl_algobase.h:71,
                 from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from crocodile.cpp:1:
/usr/include/c++/10/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::vector<long long int>*, std::vector<std::vector<long long int> > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::vector<long long int>*, std::vector<std::vector<long long int> > >; _Compare = cmp]':
/usr/include/c++/10/bits/stl_heap.h:231:14:   required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<long long int>*, std::vector<std::vector<long long int> > >; _Distance = long int; _Tp = std::vector<long long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<cmp>]'
/usr/include/c++/10/bits/stl_heap.h:263:25:   required from 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<long long int>*, std::vector<std::vector<long long int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<cmp>]'
/usr/include/c++/10/bits/stl_heap.h:332:19:   required from 'void std::pop_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::vector<long long int>*, std::vector<std::vector<long long int> > >; _Compare = cmp]'
/usr/include/c++/10/bits/stl_queue.h:678:15:   required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::pop() [with _Tp = std::vector<long long int>; _Sequence = std::vector<std::vector<long long int> >; _Compare = cmp]'
crocodile.cpp:49:13:   required from here
/usr/include/c++/10/bits/predefined_ops.h:156:30: error: no match for call to '(cmp) (std::vector<long long int>&, std::vector<long long int>&)'
  156 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
crocodile.cpp:27:7: note: candidate: 'bool cmp::operator()(std::vector<int>, std::vector<int>)'
   27 |  bool operator()(vector<int> a, vector<int> b) { return a[1] > b[1]; }
      |       ^~~~~~~~
crocodile.cpp:27:30: note:   no known conversion for argument 1 from 'vector<long long int>' to 'vector<int>'
   27 |  bool operator()(vector<int> a, vector<int> b) { return a[1] > b[1]; }
      |                  ~~~~~~~~~~~~^