oj.uz

Submission #45852

# Submission time Handle Problem Language Result Execution time Memory
45852 2018-04-16T09:26:43 Z Talant Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 192 ms 188924 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair
#define int long long

using namespace std;

typedef long long ll;

const long long inf = (long long)1e15 + 7;
const long long N = (long long)2e5 + 7;

long long n,a,b;
long long ar[N],p[N];
set<int> dp[2002][2002];
long long mn = inf;

long long calc (long long l,long long r) {
      return (p[r] - p[l - 1]);
}

main () {
      cin >> n >> a >> b;

      for (long long i = 1; i <= n; i ++) {
            cin >> ar[i];
            p[i] = p[i - 1] + ar[i];
            dp[i][1].insert(p[i]);
      }
      for (long long j = 2; j <= b; j ++) {
            for (long long i = j; i <= n; i ++) {
                  for (long long l = 1; l < i; l ++) {
                        int mnx = inf;
                        for (auto to : dp[l][j - 1]) {
                              mnx = min(mnx,to | calc(l + 1,i));
                        }
                        int o = ceil(log2(mnx));
                        for (auto to : dp[l][j - 1]) {
                              int o1 = ceil(log2(to | calc(l + 1,i)));
                              if (o == o1)
                                    dp[i][j].insert(to | calc(l + 1,i));
                        }
                        dp[i][j].insert(mnx);
                  }
            }
      }
      for (long long i = a; i <= b; i ++) {
            for (auto to : dp[n][i])
                  mn = min(mn,to);
      }

      cout << mn << endl;
}
/**
6 1 3
8 1 2 1 5 4
**/

Compilation message

sculpture.cpp:26:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 188596 KB Output is correct
2 Correct 153 ms 188648 KB Output is correct
3 Correct 149 ms 188700 KB Output is correct
4 Correct 161 ms 188868 KB Output is correct
5 Correct 159 ms 188868 KB Output is correct
6 Incorrect 192 ms 188868 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 188868 KB Output is correct
2 Correct 155 ms 188868 KB Output is correct
3 Correct 162 ms 188868 KB Output is correct
4 Correct 153 ms 188868 KB Output is correct
5 Correct 153 ms 188868 KB Output is correct
6 Incorrect 152 ms 188868 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 188868 KB Output is correct
2 Correct 155 ms 188868 KB Output is correct
3 Correct 151 ms 188868 KB Output is correct
4 Correct 153 ms 188868 KB Output is correct
5 Correct 155 ms 188868 KB Output is correct
6 Incorrect 151 ms 188900 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 188900 KB Output is correct
2 Correct 157 ms 188900 KB Output is correct
3 Correct 152 ms 188900 KB Output is correct
4 Correct 154 ms 188900 KB Output is correct
5 Correct 161 ms 188908 KB Output is correct
6 Incorrect 159 ms 188912 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 188912 KB Output is correct
2 Correct 156 ms 188924 KB Output is correct
3 Correct 152 ms 188924 KB Output is correct
4 Correct 155 ms 188924 KB Output is correct
5 Correct 156 ms 188924 KB Output is correct
6 Incorrect 154 ms 188924 KB Output isn't correct
7 Halted 0 ms 0 KB -