oj.uz

Submission #45719

# Submission time Handle Problem Language Result Execution time Memory
45719 2018-04-16T04:34:12 Z Just_Solve_The_Problem Bali Sculptures (APIO15_sculpture) C++11
0 / 100
 1000 ms 760 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");

const int N = (int)2e3 + 7;
const int inf = (int)1e9 + 7;

int n, a, b;
int ar[N];
ll dp[N][N];
ll pref[N];

ll get(int l, int r) {
  return pref[r] - pref[l - 1];
}

main() {
  scanf("%d %d %d", &n, &a, &b);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &ar[i]);
    pref[i] = pref[i - 1] + ar[i];
  }
  ll mn = 1e18;
  for (int mask = 0; mask < (1 << n); mask++) {
    int ones = (int)__builtin_popcount(mask) + 1;
    if (a <= ones && ones <= b) {
      vector < int > v;
      for (int j = 0; j < n; j++) {
        if ((mask >> j) & 1) {
          v.pb(j + 1);
        }
      }
      ll ans = 0;
      if (v.empty()) {
        ans = pref[n];
      } else {
        for (int j = 1; j < sz(v); j++) {
          ans |= (get(v[j - 1] + 1, v[j]));
        }
        ans |= get(1, v[0]);
        ans |= get(v.back() + 1, n);
      }
      mn = min(mn, ans);
    }
  }
  cout << mn;
}

Compilation message

sculpture.cpp:30:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:31:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &n, &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &ar[i]);
     ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 12 ms 656 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 8 ms 656 KB Output is correct
9 Correct 7 ms 748 KB Output is correct
10 Correct 7 ms 748 KB Output is correct
11 Correct 8 ms 748 KB Output is correct
12 Correct 9 ms 748 KB Output is correct
13 Correct 338 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Incorrect 2 ms 748 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 2 ms 748 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 2 ms 748 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 12 ms 748 KB Output is correct
7 Correct 4 ms 748 KB Output is correct
8 Correct 9 ms 748 KB Output is correct
9 Correct 8 ms 748 KB Output is correct
10 Correct 7 ms 748 KB Output is correct
11 Correct 7 ms 748 KB Output is correct
12 Correct 7 ms 748 KB Output is correct
13 Correct 356 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Incorrect 2 ms 748 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 11 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 7 ms 760 KB Output is correct
9 Correct 8 ms 760 KB Output is correct
10 Correct 7 ms 760 KB Output is correct
11 Correct 11 ms 760 KB Output is correct
12 Correct 9 ms 760 KB Output is correct
13 Correct 336 ms 760 KB Output is correct
14 Correct 729 ms 760 KB Output is correct
15 Execution timed out 1093 ms 760 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 760 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 11 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 7 ms 760 KB Output is correct
9 Correct 8 ms 760 KB Output is correct
10 Correct 9 ms 760 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 7 ms 760 KB Output is correct
13 Correct 359 ms 760 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Incorrect 2 ms 760 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 760 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 11 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 7 ms 760 KB Output is correct
9 Correct 7 ms 760 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 7 ms 760 KB Output is correct
13 Correct 371 ms 760 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 5 ms 760 KB Output is correct
17 Correct 4 ms 760 KB Output is correct
18 Correct 32 ms 760 KB Output is correct
19 Correct 8 ms 760 KB Output is correct
20 Correct 308 ms 760 KB Output is correct
21 Correct 452 ms 760 KB Output is correct
22 Correct 12 ms 760 KB Output is correct
23 Correct 377 ms 760 KB Output is correct
24 Correct 839 ms 760 KB Output is correct
25 Execution timed out 1084 ms 760 KB Time limit exceeded
26 Halted 0 ms 0 KB -