Submission #766511

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
766511	2023-06-25 17:59:43	1ne	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	1068 ms	67224 KiB

sculpture

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; 
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n,a,b;cin>>n>>a>>b;
  vector<long long>arr(n);
  for (long long i = 0;i<n;++i){
    cin>>arr[i];
  }
  vector<long long>pref(n + 1,0);
  for (int i = 0;i<n;++i){
    pref[i + 1] = pref[i] + arr[i];
  }
  auto query = [&](int u,int v){
    return pref[v + 1] - pref[u];
  };
  long long cur = 0;
  auto check = [&](long long v){
    vector<vector<int>>dp(n + 1);
    dp[0].push_back(0);
    for (int i = 0;i<n;++i){
      sort(dp[i].begin(),dp[i].end());
      dp[i].erase(unique(dp[i].begin(),dp[i].end()),dp[i].end());
      for (int x = i;x<n;++x){
        if (query(i,x) & v){
          continue;
        }
        for (auto y:dp[i]){
          if (y + 1 <= b)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 0 / 29