oj.uz

Submission #916290

# Submission time Handle Problem Language Result Execution time Memory
916290 2024-01-25T15:29:51 Z hariaakas646 Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, l, r) for(int i=l; i<r; i++)
#define frange(i, l) forr(i, 0, l)
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()

typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef long long lli;
typedef vector<vi> vvi;
typedef vector<lli> vll;
typedef vector<bool> vb;
typedef set<int> seti;
typedef multiset<int> mseti;

void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
}

// int dp[101][2049] = {int(1e9)};

int main() {
    // usaco();
    int n, a, b;
    scd(n);
    scd(a);
    scd(b);

    vll vec(n+1);
    forr(i, 1, n+1) sclld(vec[i]);

    // forr(i, 0, n+1) {
    //     forr(j, 0, 2049) dp[i][j] = 1e9;
    // }

    vector<map<lli, int>> dp(n+1);
    dp[0][0] = 0;
    
    forr(j, 0, n) {
        for(auto k : dp[j]) {
            lli v = 0;
            forr(l, j+1, n+1) {
                v += vec[l];
                dp[l][k.f | v] = min(dp[l][k.f | v], k.s + 1); 
            }
            
        }
    }
    

    lli mi = 1e18;

    // forr(i, a, b+1) {
    //     frange(k, 513) {
    //         if(dp[i][n][k]) mi = min(mi, k);
    //     }
    // }

    // frange(k, 2049) {
    //     if(dp[n][k] <= b) mi = min(mi, k);
    // }
    for(auto k : dp[n]) {
        if(k.s <= b) mi = min(mi, k.f);
    }

    // forr(i, 1, 1<<n) {
    //     if(a <= __builtin_popcount(i) && __builtin_popcount(i) <= b && (i & (1<<(n-1)))) {
    //         lli tot = 0;
    //         lli v = 0;
    //         frange(j, n) {
    //             v += vec[j];
    //             if(i & (1<<j)) {
    //                 tot = tot | v;
    //                 v = 0;
    //             }
    //         }
    //         mi = min(mi, tot);
    //     }
    // }
    
    printf("%lld", mi);
}

Compilation message

sculpture.cpp: In function 'void usaco()':
sculpture.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp: In function 'int main()':
sculpture.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
sculpture.cpp:35:5: note: in expansion of macro 'scd'
   35 |     scd(n);
      |     ^~~
sculpture.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
sculpture.cpp:36:5: note: in expansion of macro 'scd'
   36 |     scd(a);
      |     ^~~
sculpture.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
sculpture.cpp:37:5: note: in expansion of macro 'scd'
   37 |     scd(b);
      |     ^~~
sculpture.cpp:6:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
sculpture.cpp:40:21: note: in expansion of macro 'sclld'
   40 |     forr(i, 1, n+1) sclld(vec[i]);
      |                     ^~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -