답안 #970375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970375	2024-04-26T12:50:39 Z	starchan	Linear Garden (IOI08_linear_garden)	C++17	컴파일 오류	0 ms	0 KB

linear_garden

#include<bits/stdc++.h>
using namespace std;
#define in array<int, 2>
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)

const int MX = 1e6+3;

int mod;

int dp[3][3][3][MX];

int solve(int m, int M, int cur, int K)
{
	if((M > 2) || (cur > M) || (cur < 0) || (m < 0))
		return 0;
	if(dp[m][M][cur][K] != -1)
		return dp[m][M][cur][K];
	if(K == 0)
		return dp[m][M][cur][K] = 1;
	
	int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
	int M2 = max(M, cur+1); int opt2 = solve(m, M2, cur+1, K-1);

	return dp[m][M][cur][K] = (opt1+opt2)%mod;
}

int whatifL(int m, int M, int cur, int K)
{
	if((M > 2) || (cur > M) || (cur < 0) || (m < 0))
		return 0;
	if(K == 0)
		return 0;
	int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
	return opt1;
}

signed main()
{
	fast();
	int n;
	cin >> n >> mod;
	for(int i = 0; i < 3; i++)
	{
		for(int j = 0; j < 3; j++)
		{
			for(int k = 0; k < 3; k++)
			{
				for(int ell = 0; ell < n; ell++)
					dp[i][j][k][ell] = -1;
			}
		}
	}
	vector<int> a(n+1);
	a[0] = 2;
	int m, M, cur, K;
	int ans = 0;
	m = M = cur = 2; K = n;
	for(int i = 1; i <= n; i++)
	{
		char c; cin >> c;
		a[i] = a[i-1] + ((c == 'P') ?: -1);
		if(c == 'P')
			ans+=whatifL(m, M-m, cur-m, K);
		K--; cur = a[i];
		m = min(m, a[i]); M = max(M, a[i]);
		ans%=mod;
	}
	ans++; ans%=mod;
	cout << ans << "\n";
	return 0;
}	

Compilation message

linear_garden.cpp: In function 'int solve(int, int, int, int)':
linear_garden.cpp:24:27: error: no matching function for call to 'min(long long int, int)'
   24 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from linear_garden.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:
linear_garden.cpp:24:27: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   24 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from linear_garden.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:
linear_garden.cpp:24:27: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   24 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from linear_garden.cpp:1:
/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:
linear_garden.cpp:24:27: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   24 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from linear_garden.cpp:1:
/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:
linear_garden.cpp:24:27: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   24 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
linear_garden.cpp: In function 'int whatifL(int, int, int, int)':
linear_garden.cpp:36:27: error: no matching function for call to 'min(long long int, int)'
   36 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from linear_garden.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:
linear_garden.cpp:36:27: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   36 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from linear_garden.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:
linear_garden.cpp:36:27: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   36 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from linear_garden.cpp:1:
/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:
linear_garden.cpp:36:27: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   36 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from linear_garden.cpp:1:
/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:
linear_garden.cpp:36:27: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   36 |  int m1 = m+min(0ll, cur-1); int opt1 = solve(m1, M+m-m1, cur+m-m1-1, K-1);
      |                           ^
linear_garden.cpp: In function 'int main()':
linear_garden.cpp:64:32: warning: the omitted middle operand in '?:' will always be 'true', suggest explicit middle operand [-Wparentheses]
   64 |   a[i] = a[i-1] + ((c == 'P') ?: -1);
      |                                ^