제출 #1060842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060842		pcc	던전 (IOI21_dungeons)	C++17	컴파일 에러	0 ms	0 KiB

dungeons

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

#define ll long long
#define pii pair<int,int>
#define fs first
#define sc second
#define pll pair<ll,ll>

const int B = 25;
const int mxn = 5e4+10;
const int inf = 1e9;

int N;
int str[mxn],win[mxn],lose[mxn],cost[mxn];

struct JELLY{
	int par[mxn][B];
	ll sum[mxn][B];
	ll mn[mxn][B];
	JELLY(){
		memset(par,-1,sizeof(par));
		memset(sum,0,sizeof(sum));
	}
	void build(){
		for(int i = 1;i<B;i++){
			for(int j = 0;j<N;j++){
				int pre = par[j][i-1];
				if(pre == -1)continue;
				par[j][i] = par[par[j][i-1]][i-1];
				sum[j][i] = sum[j][i-1]+sum[pre][i-1];
				sum[j][i] = min(sum[j][i],inf);
				mn[j][i] = min(mn[pre][i-1],mn[j][i-1]+sum[pre][i-1]);
				mn[j][i] = min(mn[j][i],inf);
			}
		}
		return;
	}
};

JELLY jel[B];

void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	N = n;
	for(int i = 0;i<N;i++){
		str[i] = s[i];
		cost[i] = p[i];
		win[i] = w[i];
		lose[i] = l[i];
	}
	win[N] = lose[N] = N;
	for(int i = 0;i<N;i++){
		int b = __lg(str[i])+1;
		for(int j = 0;j<B;j++){
			if(j>=b)jel[j].par[i][0] = win[i],jel[j].sum[i][0] = str[i],jel[j].mn[i][0] = inf;
			else jel[j].par[i][0] = lose[i],jel[j].sum[i][0] = cost[i],jel[j].mn[i][0] = str[i];
		}
	}
	for(auto &i:jel)i.build();
	/*
	cerr<<"JEL MN: "<<endl;for(int i = 0;i<N;i++){
		for(int j = 0;j<B;j++)cerr<<jel[3].mn[i][j]<<' ';cerr<<endl;
	}
	cerr<<"JEL SUM: "<<endl;for(int i = 0;i<N;i++){
		for(int j = 0;j<B;j++)cerr<<jel[3].sum[i][j]<<' ';cerr<<endl;
	}
	*/
	return;
}

long long simulate(int x, int z) {
	int now = x;
	ll val = z;
	for(int i = 0;i<B;i++){
		//cerr<<"IN: "<<i<<":"<<now<<','<<val<<endl;
		for(int j = B-1;j>=0;j--){
			int pre = jel[i].par[now][j];
			if(pre == -1)continue;
			if(val+jel[i].sum[now][j]<jel[i].mn[now][j]){
				val += jel[i].sum[now][j];
				now = jel[i].par[now][j];
				//cerr<<"JUMP: "<<i<<' '<<j<<' '<<now<<' '<<val<<endl;
			}
		}
		if(now == N)break;
		if(val>=str[now]){
			val += str[now];
			now = win[now];
		}
		else{
			val += cost[now];
			now = lose[now];
		}
		if(now == N)break;
	}
	assert(now == N);
	return val;
}

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

dungeons.cpp: In member function 'void JELLY::build()':
dungeons.cpp:34:34: error: no matching function for call to 'min(long long int&, const int&)'
   34 |     sum[j][i] = min(sum[j][i],inf);
      |                                  ^
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:34:34: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   34 |     sum[j][i] = min(sum[j][i],inf);
      |                                  ^
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:34:34: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   34 |     sum[j][i] = min(sum[j][i],inf);
      |                                  ^
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:3:
/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:34:34: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   34 |     sum[j][i] = min(sum[j][i],inf);
      |                                  ^
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:3:
/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:34:34: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   34 |     sum[j][i] = min(sum[j][i],inf);
      |                                  ^
dungeons.cpp:36:32: error: no matching function for call to 'min(long long int&, const int&)'
   36 |     mn[j][i] = min(mn[j][i],inf);
      |                                ^
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:36:32: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   36 |     mn[j][i] = min(mn[j][i],inf);
      |                                ^
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:36:32: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   36 |     mn[j][i] = min(mn[j][i],inf);
      |                                ^
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:3:
/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:36:32: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   36 |     mn[j][i] = min(mn[j][i],inf);
      |                                ^
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:3:
/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:36:32: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   36 |     mn[j][i] = min(mn[j][i],inf);
      |                                ^