제출 #1069773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069773		Halym2007	사이버랜드 (APIO23_cyberland)	C++17	컴파일 에러	0 ms	0 KiB

cyberland

#include <bits/stdc++.h>
//#include "cyberland.h"
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <double, ll>
const int N = 2e5 + 5;
const int git = 35;
vector <pii> v[N];
double dis[git][N];
set <pii> q[N];
ll n, m, k, h, vis[N];
double jogap = 1e16;
int jj = 0;

void dfs (ll x) {
	vis[x] = 1;
	for (pii i : v[x]) {
		if (vis[i.ff]) continue;
		dfs(i.ff);
	}
}


double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> a) {
	n = N;m = M;k = K;h = H;
	jj++;
	for (int i = 0; i < m; ++i) {
		v[x[i]].pb ({y[i], c[i]});
		v[y[i]].pb ({x[i], c[i]});
	}
	jogap = 1e16;
	vis[h] = 1;
	dfs (0);
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < git; ++j) {
			dis[j][i] = 1e16;
		}
	}
	q[0].insert ({0, 0});
	dis[0][0] = 0;
	for (int i = 0; i < n; ++i) {
		if (!a[i] and vis[i]) {
			q[0].insert ({0, i});
			dis[0][i] = 0;
		}
	}
	for (int i = 0; i <= k; ++i) {
		while (!q[i].empty()) {
			int x = (*q[i].begin()).ss;
			q[i].erase(q[i].begin());
			if (x == h) continue;
			for (auto j : v[x]) {
				double val = dis[i][x] + j.ss;
				if (val < dis[i][j.ff]) {
					dis[i][j.ff] = val;
					q[i].insert ({val, dis[i][j.ff]});
				}
				if (a[j.ff] == 2) {
					val /= 2;
					if (dis[i + 1][j.ff] > val) {
						dis[i + 1][j.ff] = val;
						q[i + 1].insert ({val, j.ff});
					}
				}
			} 
		}
		jogap = min (jogap, dis[i][h]);
	}
	
	for (int i = 0; i < n; ++i) {
		v[i].clear();
		vis[i] = 0;
	}
	for (int i = 0; i < git; ++i) {
		q[i].clear();
	}
	if (jogap == (double)1e16) jogap = -1;
	return jogap;
}
 
 
//int main() {
//	freopen ("input.txt", "r", stdin);
//  int T;
//  assert(1 == scanf("%d", &T));
//  while (T--){
//    int N,M,K,H;
//    assert(4 == scanf("%d %d %d\n%d", &N, &M, &K, &H));
//    std::vector<int> x(M);
//    std::vector<int> y(M);
//    std::vector<int> c(M);
//    std::vector<int> arr(N);
//    for (int i=0;i<N;i++)
//      assert(1 == scanf("%d", &arr[i]));
//    for (int i=0;i<M;i++)
//      assert(3 == scanf("%d %d %d", &x[i], &y[i], &c[i]));
//    printf("%.12lf\n", solve(N, M, K, H, x, y, c, arr));
//  }
//}
 
 
/*
1
3 2 30 2
1 2 1
1 2 12
2 0 4
answer : 4.00000000000
 
1
4 4 30
3
1 0 2 1
0 1 5
0 2 4
1 3 2
2 3 4
answer : 2.00000000000
*/

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

cyberland.cpp: In function 'void dfs(long long int)':
cyberland.cpp:22:10: error: invalid types 'long long int [200005][double]' for array subscript
   22 |   if (vis[i.ff]) continue;
      |          ^
cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:58:21: error: invalid types 'double [200005][double]' for array subscript
   58 |     if (val < dis[i][j.ff]) {
      |                     ^
cyberland.cpp:59:12: error: invalid types 'double [200005][double]' for array subscript
   59 |      dis[i][j.ff] = val;
      |            ^
cyberland.cpp:60:31: error: invalid types 'double [200005][double]' for array subscript
   60 |      q[i].insert ({val, dis[i][j.ff]});
      |                               ^
cyberland.cpp:60:38: error: no matching function for call to 'std::set<std::pair<double, long long int> >::insert(<brace-enclosed initializer list>)'
   60 |      q[i].insert ({val, dis[i][j.ff]});
      |                                      ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from cyberland.cpp:1:
/usr/include/c++/10/bits/stl_set.h:509:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<double, long long int>]'
  509 |       insert(const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:509:32: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type&' {aka 'const std::pair<double, long long int>&'}
  509 |       insert(const value_type& __x)
      |              ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:518:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<double, long long int>]'
  518 |       insert(value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:518:27: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<std::pair<double, long long int> >::value_type&&' {aka 'std::pair<double, long long int>&&'}
  518 |       insert(value_type&& __x)
      |              ~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:546:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, const value_type&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<double, long long int>]'
  546 |       insert(const_iterator __position, const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:546:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:551:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<double, long long int>]'
  551 |       insert(const_iterator __position, value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:551:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:566:2: note: candidate: 'template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >]'
  566 |  insert(_InputIterator __first, _InputIterator __last)
      |  ^~~~~~
/usr/include/c++/10/bits/stl_set.h:566:2: note:   template argument deduction/substitution failed:
cyberland.cpp:60:38: note:   candidate expects 2 arguments, 1 provided
   60 |      q[i].insert ({val, dis[i][j.ff]});
      |                                      ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from cyberland.cpp:1:
/usr/include/c++/10/bits/stl_set.h:578:7: note: candidate: 'void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >]'
  578 |       insert(initializer_list<value_type> __l)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:578:43: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::initializer_list<std::pair<double, long long int> >'
  578 |       insert(initializer_list<value_type> __l)
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:598:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::insert_return_type std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; std::set<_Key, _Compare, _Alloc>::insert_return_type = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::insert_return_type; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::node_type]'
  598 |       insert(node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:598:26: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<std::pair<double, long long int> >::node_type&&' {aka 'std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::node_type&&'}
  598 |       insert(node_type&& __nh)
      |              ~~~~~~~~~~~~^~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = std::pair<double, long long int>; _Compare = std::less<std::pair<double, long long int> >; _Alloc = std::allocator<std::pair<double, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::const_iterator; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<std::pair<double, long long int>, std::pair<double, long long int>, std::_Identity<std::pair<double, long long int> >, std::less<std::pair<double, long long int> >, std::allocator<std::pair<double, long long int> > >::node_type]'
  603 |       insert(const_iterator __hint, node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note:   candidate expects 2 arguments, 1 provided
cyberland.cpp:64:20: error: invalid types 'double [200005][double]' for array subscript
   64 |      if (dis[i + 1][j.ff] > val) {
      |                    ^
cyberland.cpp:65:17: error: invalid types 'double [200005][double]' for array subscript
   65 |       dis[i + 1][j.ff] = val;
      |                 ^