Submission #701336

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
701336	2023-02-21 01:21:32	angelo_torres	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	10 ms	1364 KiB

vault

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 = 63750;
const int inf = 1e9;
int m,l,a[300],dp[N*2+10];
int main(){
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  cin >> m >> l;
  for(int i = -m; i <= m; ++i) cin >> a[i+50];
  for(int i = -N; i <= N; ++i) dp[i+N] = -inf;
  dp[0+N] = 0;
  set<int> s;
  s.insert(0);
  for(int i = -m; i <= m; ++i){
    for(int j = 0; j < a[i+50]; ++j){
      if(i > 0) for(int k = N; k >= -N; k--){
        if(k-i < -N || k-i > N) continue;
        dp[k+N] = max(dp[k+N],dp[k-i+N]+1);
      }
      else for(int k = -N; k <= N; ++k){
        if(k-i < -N || k-i > N) continue;
        dp[k+N] = max(dp[k+N],dp[k-i+N]+1);
      }
      // for(int k = -5; k <= 5; ++k) cout << dp[N+k] << " ";
      // cout << "\n";
    }
  }
  if(dp[l+N] < 0){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10