제출 #998992

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
998992	2024-06-15 03:28:54	huutuan	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	47 ms	36524 KiB

linear_garden

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int n, m;
int f[N][3][3];
int dp(int i, int minpf, int maxpf){
   if (minpf<-2 || maxpf>2) return 0;
   if (i==n+1) return 1;
   if (f[i][-minpf][maxpf]!=-1) return f[i][-minpf][maxpf];
   int res=0;
   res=(res+dp(i+1, min({0, minpf-1, -1}), max({0, maxpf-1, -1})))%m;
   res=(res+dp(i+1, min({0, minpf+1, +1}), max({0, maxpf+1, +1})))%m;
   return f[i][-minpf][maxpf]=res;
}
int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> m;
   for (int i=0; i<=2; ++i) for (int j=0; j<=2; ++j) f[n+1][i][j]=1;
   for (int i=n; i>=1; --i){
      for (int j=0; j<=2; ++j){
         for (int k=0; k<=2; ++k){
            int minpf=-j, maxpf=k;
            f[i][j][k]=0;
            if (j!=2) f[i][j][k]=(f[i][j][k]+f[i+1][-min({0, minpf-1, -1})][max({0, maxpf-1, -1})])%m;
            if (k!=2) f[i][j][k]=(f[i][j][k]+f[i+1][-min({0, minpf+1, +1})][max({0, maxpf+1, +1})])%m;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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