Submission #558426

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
558426	2022-05-07 09:50:21	andreast12	Kangaroo (CEOI16_kangaroo)	C++17	0 / 100	1 ms	340 KiB

kangaroo

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;
#define ll long long
#define fi first
#define se second
#define pb push_back
const int mod=1e9+7, maxn=1e4+5;
int n, s, e;
ll res, memo[100][10][2];
ll dp(int mask, int node, int arah) {
  if(__builtin_popcount(mask)==n-1) {
    for(int i=0; i<n; i++) {
      if(((1<<i)&mask)==0) {
        if(i+1==e) return 1;
        else return 0;
      }
    }
  }
  if(memo[mask][node][arah]!=-1) return memo[mask][node][arah];
  ll ans=0;
  if(arah) {
    for(int i=node+1; i<=n; i++) {
      if(((1<<(i-1))&mask)==0) ans=(dp(mask|(1<<(i-1)), i, 1-arah)+ans)%mod;
    }
  } else {
    for(int i=node-1; i>0; i--) {
      if(((1<<(i-1))&mask)==0) ans=(dp(mask|(1<<(i-1)), i, 1-arah)+ans)%mod;
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 6
• Subtask 2: 0 / 30
• Subtask 3: 0 / 15
• Subtask 4: 0 / 49