Submission #198882

#	Time	Username	Problem	Language	Result	Execution time	Memory
198882		arnold518	Linear Garden (IOI08_linear_garden)	C++14	0 / 100	60 ms	65540 KiB

linear_garden

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e6;

int N, M, dp[MAXN+1][3][3][5];

int solve(int pos, int a, int b, int c)
{
	if(pos==N+1) return 1;
	int &ret=dp[pos][-a][b][c+2];
	if(ret!=-1) return ret;

	ret=0;
	if(max(b, c+1)-a<=2) ret+=solve(pos+1, a, max(b, c+1), c+1);
	if(b-min(a, c-1)<=2) ret+=solve(pos+1, min(a, c-1), b, c-1);
	ret%=M;
	return ret;
}

int main()
{
	int i, j;

	scanf("%d%d", &N, &M);
	memset(dp, -1, sizeof(dp));
	printf("%d", solve(1, 0, 0, 0));
}

Compilation message (stderr)

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:27:6: warning: unused variable 'i' [-Wunused-variable]
  int i, j;
      ^
linear_garden.cpp:27:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
linear_garden.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 2
• Subtask 2: 0 / 2
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 4
• Subtask 7: 0 / 4
• Subtask 8: 0 / 4
• Subtask 9: 0 / 4
• Subtask 10: 0 / 4
• Subtask 11: 0 / 4
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5