Submission #1049091

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1049091	2024-08-08T13:18:18 Z	parsadox2	Dungeons Game (IOI21_dungeons)	C++17	Compilation error	0 ms	0 KB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;

const int N = 4e5 + 10 , Lg = 27;
const long long inf = 1e15 + 10;

int n;

vector <int> s , p , w , l;

long long f(long long x)
{
	if(x <= 0)
		return inf;
	return x;
}

struct item{
	long long mn;
	long long val;
	int id;
};

item a[2 * N][Lg];

item Get(item now , int len)
{
	if(len == 0)
		return now;
	long long id = now.id , mn = now.mn , val = now.val , dif = val - (val >= s[id]) * s[id];

	for(int i = Lg - 1 ; i >= 0 ; i--)  if((1 << i) <= len && a[id * 2 + (val >= s[id])][i].mn > dif)
	{
		item tmp = a[id * 2 + (val >= s[id])][i];
		return Get({min(mn , tmp.mn - dif) , tmp.val + dif , tmp.id} , len - (1 << i));
	}
	if(val >= s[id])
		return Get({min(mn , f(s[w[id]] - val - s[id])) , val + s[id] , w[id]} , len - 1);
	else
		return Get({min(mn , f(s[l[id]] - val - p[id])) , val + p[id] , l[id]} , len - 1);
}

void init(int nn, vector<int> ss, vector<int> pp, vector<int> ww, vector<int> ll) {
	n = nn;
	s = ss;
	p = pp;
	w = ww;
	l = ll;
	s.push_back(0);
	p.push_back(0);
	w.push_back(n);
	l.push_back(n);
	for(int i = 0 ; i <= n ; i++)
	{
		a[i << 1][0] = {min(s[i] , f(s[l[i]] - p[i])) , p[i] , l[i]};
		a[(i << 1) + 1][0] = {f(s[w[i]] - 2 * s[i]) , 2 * s[i] , w[i]};
	}
	for(int j = 1 ; j < Lg ; j++)  for(int i = 0 ; i <= 2 * n + 1 ; i++)
	{
		a[i][j] = Get(a[i][j - 1] , (1 << (j - 1)));
	}
}

long long simulate(int x, int z) {
	item tmp = Get({inf , z , x} , 2e7);
	return tmp.val;
}

Compilation message

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:58:47: error: no matching function for call to 'min(__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type&, long long int)'
   58 |   a[i << 1][0] = {min(s[i] , f(s[l[i]] - p[i])) , p[i] , l[i]};
      |                                               ^
In file included from /usr/include/c++/10/vector:60,
                 from dungeons.h:1,
                 from dungeons.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
dungeons.cpp:58:47: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   58 |   a[i << 1][0] = {min(s[i] , f(s[l[i]] - p[i])) , p[i] , l[i]};
      |                                               ^
In file included from /usr/include/c++/10/vector:60,
                 from dungeons.h:1,
                 from dungeons.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  278 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:278:5: note:   template argument deduction/substitution failed:
dungeons.cpp:58:47: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   58 |   a[i << 1][0] = {min(s[i] , f(s[l[i]] - p[i])) , p[i] , l[i]};
      |                                               ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from dungeons.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3468:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3468 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
dungeons.cpp:58:47: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   58 |   a[i << 1][0] = {min(s[i] , f(s[l[i]] - p[i])) , p[i] , l[i]};
      |                                               ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from dungeons.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3474 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3474:5: note:   template argument deduction/substitution failed:
dungeons.cpp:58:47: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   58 |   a[i << 1][0] = {min(s[i] , f(s[l[i]] - p[i])) , p[i] , l[i]};
      |                                               ^
dungeons.cpp:58:62: error: no match for 'operator=' (operand types are 'item' and '<brace-enclosed initializer list>')
   58 |   a[i << 1][0] = {min(s[i] , f(s[l[i]] - p[i])) , p[i] , l[i]};
      |                                                              ^
dungeons.cpp:21:8: note: candidate: 'constexpr item& item::operator=(const item&)'
   21 | struct item{
      |        ^~~~
dungeons.cpp:21:8: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const item&'
dungeons.cpp:21:8: note: candidate: 'constexpr item& item::operator=(item&&)'
dungeons.cpp:21:8: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'item&&'