Submission #951389

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
951389	2024-03-21 22:06:27	starchan	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	249 ms	159804 KiB

dango_maker

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 int long long
#define in pair<int, int>
#define f first
#define s second
#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 SMX = 3e3+5;
char grid[SMX][SMX];
int gud[SMX][SMX][2];//automatically set to zero anyway
int solve(int DIAG, int l, int r)
{
  int n = r-l+1;
  int dp[n+1][2];
  dp[0][0] = dp[0][1] = 0;
  dp[1][0] = gud[l][DIAG-l][0]; dp[1][1] = gud[l][DIAG-l][1];
  for(int i = 2; i <= n; i++)
  {
    dp[i][0] = gud[l-1+i][DIAG-l+1-i][0]+max(dp[i-1][0], max(dp[i-2][0], dp[i-2][1]));
    dp[i][1] = gud[l-1+i][DIAG-l+1-i][1]+max(dp[i-1][1], max(dp[i-2][0], dp[i-2][1]));
  }
  int ans = 0;
  for(int i = 0; i <= n; i++)
    ans = max(ans, max(dp[i][0], dp[i][1]));
  return ans;
}
signed main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 20 / 20
• Subtask 3: 67 / 67