oj.uz

답안 #110248

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110248 2019-05-10T10:06:21 Z SamAnd Bali Sculptures (APIO15_sculpture) C++17
46 / 100
 1000 ms 2084 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2003, M = 102;

int n;
int ll, rr;
int a[N];

void solv0()
{
    long long ans = (1LL << 62);
    for (int x = 0; x < (1 << n); ++x)
    {
        if ((x & (1 << 0)) == 0)
            continue;
        vector<long long> v;
        long long y = a[1];
        for (int i = 1; i < n; ++i)
        {
            if ((x & (1 << i)))
            {
                v.push_back(y);
                y = a[i + 1];
            }
            else
                y += a[i + 1];
        }
        v.push_back(y);
        long long yans = 0;
        for (int i = 0; i < v.size(); ++i)
            yans = yans | v[i];
        if (ll <= v.size() && v.size() <= rr)
            ans = min(ans, yans);
    }
    cout << ans << endl;
}

void solv1()
{
    bool dp[M][M][1 << 12] = {};
    dp[0][0][0] = true;
    for (int i = 1; i <= n; ++i)
    {
        int s = 0;
        for (int j = i; j >= 1; --j)
        {
            s += a[j];
            for (int k = 0; k <= rr; ++k)
            {
                for (int x = 0; x < (1 << 12); ++x)
                {
                    if (!dp[j - 1][k][x])
                        continue;
                    dp[i][k + 1][x | s] = true;
                }
            }
        }
    }
    int ans = (1 << 12);
    for (int k = ll; k <= rr; ++k)
    {
        for (int x = 0; x < (1 << 12); ++x)
        {
            if (dp[n][k][x])
                ans = min(ans, x);
        }
    }
    cout << ans << endl;
}

void solv2()
{
    vector<long long> dp[M][M];
    dp[0][0].push_back(0);
    for (int i = 1; i <= n; ++i)
    {
        for (int k = 0; k <= rr; ++k)
        {
            long long s = 0;
            for (int j = i; j >= 1; --j)
            {
                s += a[j];
                for (int ii = 0; ii < dp[j - 1][k].size(); ++ii)
                {
                    long long x = (dp[j - 1][k][ii] | s);
                    bool z = false;
                    for (int kk = ll; kk <= k; ++kk)
                    {
                        for (int jj = 0; jj < dp[i][kk].size(); ++jj)
                        {
                            if ((x | dp[i][kk][jj]) == x)
                            {
                                z = true;
                                break;
                            }
                        }
                        if (z)
                            break;
                    }
                    for (int jj = 0; jj < dp[i][k + 1].size(); ++jj)
                    {
                        if ((x | dp[i][k + 1][jj]) == x)
                        {
                            z = true;
                            break;
                        }
                    }
                    if (!z)
                        dp[i][k + 1].push_back(x);
                }
            }
        }
    }
    long long ans = (1LL << 62);
    for (int k = ll; k <= rr; ++k)
    {
        for (int ii = 0; ii < dp[n][k].size(); ++ii)
        {
            long long x = dp[n][k][ii];
            ans = min(ans, x);
        }
    }
    cout << ans << endl;
}

int main()
{
    //freopen("input.txt", "r", stdin);
    cin >> n >> ll >> rr;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    solv2();
    return 0;
}

Compilation message

sculpture.cpp: In function 'void solv0()':
sculpture.cpp:30:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); ++i)
                         ~~^~~~~~~~~~
sculpture.cpp:32:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (ll <= v.size() && v.size() <= rr)
             ~~~^~~~~~~~~~~
sculpture.cpp:32:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (ll <= v.size() && v.size() <= rr)
                               ~~~~~~~~~^~~~~
sculpture.cpp: In function 'void solv2()':
sculpture.cpp:83:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int ii = 0; ii < dp[j - 1][k].size(); ++ii)
                                  ~~~^~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:89:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for (int jj = 0; jj < dp[i][kk].size(); ++jj)
                                          ~~~^~~~~~~~~~~~~~~~~~
sculpture.cpp:100:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for (int jj = 0; jj < dp[i][k + 1].size(); ++jj)
                                      ~~~^~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:117:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int ii = 0; ii < dp[n][k].size(); ++ii)
                          ~~~^~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 3 ms 640 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 2 ms 640 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 3 ms 640 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 3 ms 640 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 3 ms 512 KB Output is correct
36 Correct 2 ms 640 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 2 ms 640 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 7 ms 640 KB Output is correct
23 Correct 3 ms 444 KB Output is correct
24 Correct 4 ms 640 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 640 KB Output is correct
29 Correct 5 ms 640 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 5 ms 640 KB Output is correct
32 Correct 4 ms 512 KB Output is correct
33 Correct 3 ms 640 KB Output is correct
34 Correct 6 ms 640 KB Output is correct
35 Correct 4 ms 512 KB Output is correct
36 Correct 4 ms 628 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 5 ms 640 KB Output is correct
19 Correct 4 ms 640 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 3 ms 640 KB Output is correct
24 Correct 4 ms 640 KB Output is correct
25 Correct 6 ms 640 KB Output is correct
26 Correct 11 ms 640 KB Output is correct
27 Correct 24 ms 640 KB Output is correct
28 Correct 22 ms 768 KB Output is correct
29 Correct 22 ms 640 KB Output is correct
30 Correct 2 ms 640 KB Output is correct
31 Correct 24 ms 752 KB Output is correct
32 Correct 30 ms 768 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 4 ms 640 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 3 ms 640 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 3 ms 640 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 3 ms 640 KB Output is correct
29 Correct 3 ms 512 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 3 ms 640 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 2 ms 512 KB Output is correct
36 Correct 2 ms 640 KB Output is correct
37 Correct 3 ms 640 KB Output is correct
38 Correct 3 ms 640 KB Output is correct
39 Correct 3 ms 640 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 5 ms 640 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 2 ms 640 KB Output is correct
44 Correct 3 ms 640 KB Output is correct
45 Correct 3 ms 640 KB Output is correct
46 Correct 3 ms 640 KB Output is correct
47 Correct 4 ms 640 KB Output is correct
48 Correct 6 ms 640 KB Output is correct
49 Correct 11 ms 640 KB Output is correct
50 Correct 19 ms 640 KB Output is correct
51 Correct 26 ms 640 KB Output is correct
52 Correct 18 ms 640 KB Output is correct
53 Correct 2 ms 512 KB Output is correct
54 Correct 24 ms 768 KB Output is correct
55 Correct 39 ms 748 KB Output is correct
56 Execution timed out 1068 ms 2084 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 684 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 612 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 3 ms 640 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 3 ms 640 KB Output is correct
27 Correct 4 ms 640 KB Output is correct
28 Correct 4 ms 640 KB Output is correct
29 Correct 5 ms 640 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 3 ms 640 KB Output is correct
33 Correct 5 ms 640 KB Output is correct
34 Correct 7 ms 640 KB Output is correct
35 Correct 9 ms 640 KB Output is correct
36 Correct 15 ms 640 KB Output is correct
37 Correct 19 ms 640 KB Output is correct
38 Correct 30 ms 760 KB Output is correct
39 Correct 18 ms 640 KB Output is correct
40 Correct 3 ms 640 KB Output is correct
41 Correct 26 ms 760 KB Output is correct
42 Correct 30 ms 716 KB Output is correct
43 Correct 969 ms 1892 KB Output is correct
44 Execution timed out 1070 ms 2012 KB Time limit exceeded
45 Halted 0 ms 0 KB -