oj.uz

Submission #580208

# Submission time Handle Problem Language Result Execution time Memory
580208 2022-06-20T17:52:44 Z Sam_a17 Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 1640 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#pragma GCC optimize("Ofast")
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
// #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
long long dx[8] = {-1,0,1,0,1,-1,1,-1};
long long dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
 
// Random
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
 
// Indexed Set
// template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e3 + 10, LOG = 8 * sizeof(long long) - 1;
int n, a, b;
long long arr[N];

bool check(long long curr, long long bi) {
  vector<vector<int>> dp(n + 1, vector<int> (n + 1, -1));
  dp[0][0] = 1;
  for(int i = 1; i <= n; i++) {
    long long s = 0;
    for(int j = i; j >= 1; j--) {
      s += arr[j];
      for(int k = 0; k < n; k++) {
        if(dp[j - 1][k] == -1) continue;
        int is_on = ((((s >> bi) << bi) | curr) == curr ? 1 : 0);
          
        if(dp[i][k + 1] == -1) {
          if(!is_on || !dp[j - 1][k]) {
            dp[i][k + 1] = 0;
          } else {
            dp[i][k + 1] = 1;
          }
        } else {
          if(dp[i][k + 1] == 1) {
            continue;
          }

          if(!is_on || !dp[j - 1][k]) {
            dp[i][k + 1] = 0;
          } else {
            dp[i][k + 1] = 1;
          }
        }
      }
    }
  }

  for(int i = a; i <= b; i++) {
    if(dp[n][i] == 1) {
      return true;
    }
  }

  return false;
}

void solve_() {
  cin >> n >> a >> b;

  for(int i = 1; i <= n; i++) {
    cin >> arr[i];
  }

  long long answ = 0;
  for(int i = LOG; i >= 0; i--) {
    if(!check(answ, i)) {
      answ |= (1ll << i);
    }
  }

  printf("%lld\n", answ);
}
 
int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
  int test_cases = 1;
  solve(test_cases);
 
  return 0;
}

Compilation message

sculpture.cpp: In function 'void setIO(std::string)':
sculpture.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 224 KB Output is correct
25 Correct 2 ms 324 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 2 ms 212 KB Output is correct
28 Correct 2 ms 212 KB Output is correct
29 Correct 5 ms 336 KB Output is correct
30 Correct 4 ms 212 KB Output is correct
31 Correct 6 ms 328 KB Output is correct
32 Correct 7 ms 340 KB Output is correct
33 Correct 7 ms 340 KB Output is correct
34 Correct 7 ms 340 KB Output is correct
35 Correct 7 ms 328 KB Output is correct
36 Correct 8 ms 336 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 10 ms 340 KB Output is correct
20 Correct 8 ms 336 KB Output is correct
21 Correct 7 ms 212 KB Output is correct
22 Correct 8 ms 340 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 9 ms 340 KB Output is correct
25 Correct 14 ms 344 KB Output is correct
26 Correct 22 ms 356 KB Output is correct
27 Correct 34 ms 340 KB Output is correct
28 Correct 47 ms 340 KB Output is correct
29 Correct 47 ms 352 KB Output is correct
30 Correct 46 ms 340 KB Output is correct
31 Correct 45 ms 276 KB Output is correct
32 Correct 46 ms 348 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 276 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 2 ms 280 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 2 ms 212 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 5 ms 212 KB Output is correct
41 Correct 7 ms 212 KB Output is correct
42 Correct 7 ms 340 KB Output is correct
43 Correct 7 ms 212 KB Output is correct
44 Correct 10 ms 212 KB Output is correct
45 Correct 7 ms 212 KB Output is correct
46 Correct 7 ms 332 KB Output is correct
47 Correct 8 ms 336 KB Output is correct
48 Correct 15 ms 344 KB Output is correct
49 Correct 37 ms 340 KB Output is correct
50 Correct 52 ms 340 KB Output is correct
51 Correct 47 ms 348 KB Output is correct
52 Correct 70 ms 348 KB Output is correct
53 Correct 54 ms 348 KB Output is correct
54 Correct 74 ms 340 KB Output is correct
55 Correct 51 ms 352 KB Output is correct
56 Correct 9 ms 212 KB Output is correct
57 Correct 38 ms 340 KB Output is correct
58 Correct 45 ms 340 KB Output is correct
59 Correct 69 ms 340 KB Output is correct
60 Correct 58 ms 348 KB Output is correct
61 Correct 79 ms 348 KB Output is correct
62 Correct 74 ms 348 KB Output is correct
63 Correct 59 ms 352 KB Output is correct
64 Correct 55 ms 340 KB Output is correct
65 Correct 9 ms 332 KB Output is correct
66 Correct 19 ms 348 KB Output is correct
67 Correct 31 ms 340 KB Output is correct
68 Correct 46 ms 340 KB Output is correct
69 Correct 70 ms 348 KB Output is correct
70 Correct 58 ms 340 KB Output is correct
71 Correct 81 ms 344 KB Output is correct
72 Correct 66 ms 348 KB Output is correct
73 Correct 58 ms 348 KB Output is correct
74 Correct 60 ms 340 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 328 KB Output is correct
11 Correct 2 ms 324 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 3 ms 212 KB Output is correct
26 Correct 6 ms 212 KB Output is correct
27 Correct 5 ms 212 KB Output is correct
28 Correct 7 ms 212 KB Output is correct
29 Correct 11 ms 340 KB Output is correct
30 Correct 7 ms 340 KB Output is correct
31 Correct 7 ms 340 KB Output is correct
32 Correct 9 ms 212 KB Output is correct
33 Correct 7 ms 336 KB Output is correct
34 Correct 8 ms 340 KB Output is correct
35 Correct 15 ms 340 KB Output is correct
36 Correct 36 ms 340 KB Output is correct
37 Correct 35 ms 360 KB Output is correct
38 Correct 45 ms 348 KB Output is correct
39 Correct 49 ms 340 KB Output is correct
40 Correct 46 ms 356 KB Output is correct
41 Correct 45 ms 352 KB Output is correct
42 Correct 48 ms 348 KB Output is correct
43 Correct 9 ms 212 KB Output is correct
44 Correct 27 ms 340 KB Output is correct
45 Correct 42 ms 340 KB Output is correct
46 Correct 57 ms 352 KB Output is correct
47 Correct 55 ms 344 KB Output is correct
48 Correct 56 ms 352 KB Output is correct
49 Correct 66 ms 340 KB Output is correct
50 Correct 56 ms 340 KB Output is correct
51 Correct 57 ms 348 KB Output is correct
52 Execution timed out 1087 ms 1640 KB Time limit exceeded
53 Halted 0 ms 0 KB -