oj.uz

Submission #170527

# Submission time Handle Problem Language Result Execution time Memory
170527 2019-12-25T14:51:41 Z Swan Bali Sculptures (APIO15_sculpture) C++14
46 / 100
 1000 ms 10624 KB 
#include <bits/stdc++.h>
#define stop system("pause")
#define stop2 char o; cin >> o
#define INP freopen("pcb.in","r",stdin)
#define OUTP freopen ("pcb.out","w",stdout)
#define int long long
using namespace std;

const int maxn = 210;

set<int> dp[maxn][maxn];
int ans[maxn][maxn];

void prosev(int x,int y){
    vector<int> bad;
    vector<int> now;
    for(auto&a : dp[x][y])now.push_back(a);
    for(int i(0); i < now.size();i++){
        for(int j(0); j < now.size();j++){
            if(i == j)continue;
            int kek = now[i]^(now[i]|now[j]);
            if(!kek){
                bad.push_back(i);
                break;
            }
        }
    }
    for(int i(0); i < bad.size();i++){
        dp[x][y].erase(dp[x][y].find(now[bad[i]]));
    }
}

main(){
    ios_base::sync_with_stdio(0);
    int n,a,b; cin >> n >> a >> b;
    vector<int> v;
    v.push_back(0);
    //srand(time(0));
    for(int i(1); i <= n;i++){
        int x;cin>>x;
        v.push_back(x);
    }
    dp[0][0].insert(0);
    for(int i(0);i<=n;i++){
        for(int j(0);j<=n;j++){
            ans[i][j] = 1e16;
        }
    }
    for(int k(1);k<=b;k++){
        for(int i(1); i <=n;i++){
            int sum = 0;
            //cout << k << ' ' << i << ' ' << ans[k][i] << endl;
            for(int to(i);to > 0;to--){
                sum+=v[to];
                for(auto&a : dp[k-1][to-1]){
                    dp[k][i].insert(sum|a);
                    ans[k][i] = min(ans[k][i],(sum|a));
                }
            }
            //cout << k << ' ' << i << ' ' << ans[k][i] << endl;
            prosev(k,i);
        }
    }
    int res = 1e17;
    for(int i(a);i<=b;i++){
        //cout << i << ' ' << ans[i][n] << endl;
        res = min(res,ans[i][n]);
    }
    cout << res;
}

/*
6 1 3
8 1 2 1 5 4
100 1 100
5 1 5
1 2 3 4 5
*/

Compilation message

sculpture.cpp: In function 'void prosev(long long int, long long int)':
sculpture.cpp:18:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i(0); i < now.size();i++){
                   ~~^~~~~~~~~~~~
sculpture.cpp:19:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j(0); j < now.size();j++){
                       ~~^~~~~~~~~~~~
sculpture.cpp:28:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i(0); i < bad.size();i++){
                   ~~^~~~~~~~~~~~
sculpture.cpp: At global scope:
sculpture.cpp:33:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 4 ms 2424 KB Output is correct
3 Correct 4 ms 2424 KB Output is correct
4 Correct 4 ms 2424 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 4 ms 2428 KB Output is correct
8 Correct 4 ms 2424 KB Output is correct
9 Correct 4 ms 2296 KB Output is correct
10 Correct 4 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 4 ms 2552 KB Output is correct
14 Correct 4 ms 2424 KB Output is correct
15 Correct 4 ms 2472 KB Output is correct
16 Correct 4 ms 2428 KB Output is correct
17 Correct 4 ms 2424 KB Output is correct
18 Correct 4 ms 2424 KB Output is correct
19 Correct 4 ms 2424 KB Output is correct
20 Correct 4 ms 2424 KB Output is correct
21 Correct 4 ms 2552 KB Output is correct
22 Correct 4 ms 2552 KB Output is correct
23 Correct 4 ms 2424 KB Output is correct
24 Correct 4 ms 2424 KB Output is correct
25 Correct 4 ms 2552 KB Output is correct
26 Correct 4 ms 2552 KB Output is correct
27 Correct 4 ms 2460 KB Output is correct
28 Correct 5 ms 2472 KB Output is correct
29 Correct 6 ms 2556 KB Output is correct
30 Correct 8 ms 2680 KB Output is correct
31 Correct 15 ms 2936 KB Output is correct
32 Correct 11 ms 2684 KB Output is correct
33 Correct 4 ms 2552 KB Output is correct
34 Correct 12 ms 2808 KB Output is correct
35 Correct 11 ms 2808 KB Output is correct
36 Correct 10 ms 2760 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2424 KB Output is correct
2 Correct 4 ms 2424 KB Output is correct
3 Correct 4 ms 2424 KB Output is correct
4 Correct 4 ms 2424 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 4 ms 2424 KB Output is correct
8 Correct 4 ms 2424 KB Output is correct
9 Correct 4 ms 2424 KB Output is correct
10 Correct 4 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 4 ms 2552 KB Output is correct
14 Correct 4 ms 2424 KB Output is correct
15 Correct 5 ms 2424 KB Output is correct
16 Correct 5 ms 2552 KB Output is correct
17 Correct 8 ms 2680 KB Output is correct
18 Correct 16 ms 2880 KB Output is correct
19 Correct 10 ms 2680 KB Output is correct
20 Correct 4 ms 2552 KB Output is correct
21 Correct 13 ms 2808 KB Output is correct
22 Correct 11 ms 2808 KB Output is correct
23 Correct 10 ms 2680 KB Output is correct
24 Correct 17 ms 2920 KB Output is correct
25 Correct 23 ms 2936 KB Output is correct
26 Correct 67 ms 3836 KB Output is correct
27 Correct 102 ms 4472 KB Output is correct
28 Correct 150 ms 5344 KB Output is correct
29 Correct 98 ms 4472 KB Output is correct
30 Correct 4 ms 2552 KB Output is correct
31 Correct 158 ms 5196 KB Output is correct
32 Correct 177 ms 5752 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 4 ms 2424 KB Output is correct
3 Correct 4 ms 2424 KB Output is correct
4 Correct 4 ms 2424 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 4 ms 2424 KB Output is correct
8 Correct 4 ms 2424 KB Output is correct
9 Correct 4 ms 2424 KB Output is correct
10 Correct 4 ms 2424 KB Output is correct
11 Correct 5 ms 2424 KB Output is correct
12 Correct 5 ms 2424 KB Output is correct
13 Correct 4 ms 2424 KB Output is correct
14 Correct 4 ms 2424 KB Output is correct
15 Correct 4 ms 2424 KB Output is correct
16 Correct 4 ms 2428 KB Output is correct
17 Correct 4 ms 2424 KB Output is correct
18 Correct 5 ms 2424 KB Output is correct
19 Correct 4 ms 2424 KB Output is correct
20 Correct 5 ms 2428 KB Output is correct
21 Correct 4 ms 2552 KB Output is correct
22 Correct 4 ms 2556 KB Output is correct
23 Correct 6 ms 2424 KB Output is correct
24 Correct 4 ms 2424 KB Output is correct
25 Correct 4 ms 2424 KB Output is correct
26 Correct 4 ms 2424 KB Output is correct
27 Correct 4 ms 2424 KB Output is correct
28 Correct 4 ms 2424 KB Output is correct
29 Correct 5 ms 2552 KB Output is correct
30 Correct 5 ms 2424 KB Output is correct
31 Correct 5 ms 2552 KB Output is correct
32 Correct 4 ms 2424 KB Output is correct
33 Correct 5 ms 2472 KB Output is correct
34 Correct 5 ms 2424 KB Output is correct
35 Correct 5 ms 2424 KB Output is correct
36 Correct 4 ms 2424 KB Output is correct
37 Correct 5 ms 2552 KB Output is correct
38 Correct 5 ms 2552 KB Output is correct
39 Correct 6 ms 2556 KB Output is correct
40 Correct 9 ms 2680 KB Output is correct
41 Correct 17 ms 2808 KB Output is correct
42 Correct 11 ms 2680 KB Output is correct
43 Correct 5 ms 2424 KB Output is correct
44 Correct 13 ms 2808 KB Output is correct
45 Correct 11 ms 2680 KB Output is correct
46 Correct 10 ms 2680 KB Output is correct
47 Correct 17 ms 2936 KB Output is correct
48 Correct 23 ms 3064 KB Output is correct
49 Correct 65 ms 3960 KB Output is correct
50 Correct 103 ms 4472 KB Output is correct
51 Correct 150 ms 5340 KB Output is correct
52 Correct 97 ms 4344 KB Output is correct
53 Correct 4 ms 2556 KB Output is correct
54 Correct 161 ms 5244 KB Output is correct
55 Correct 173 ms 5496 KB Output is correct
56 Execution timed out 1075 ms 10060 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 4 ms 2424 KB Output is correct
3 Correct 4 ms 2424 KB Output is correct
4 Correct 4 ms 2424 KB Output is correct
5 Correct 4 ms 2424 KB Output is correct
6 Correct 4 ms 2424 KB Output is correct
7 Correct 4 ms 2424 KB Output is correct
8 Correct 4 ms 2424 KB Output is correct
9 Correct 4 ms 2424 KB Output is correct
10 Correct 4 ms 2424 KB Output is correct
11 Correct 4 ms 2424 KB Output is correct
12 Correct 4 ms 2424 KB Output is correct
13 Correct 4 ms 2424 KB Output is correct
14 Correct 4 ms 2424 KB Output is correct
15 Correct 4 ms 2424 KB Output is correct
16 Correct 4 ms 2552 KB Output is correct
17 Correct 4 ms 2552 KB Output is correct
18 Correct 4 ms 2424 KB Output is correct
19 Correct 4 ms 2424 KB Output is correct
20 Correct 4 ms 2552 KB Output is correct
21 Correct 4 ms 2552 KB Output is correct
22 Correct 4 ms 2424 KB Output is correct
23 Correct 4 ms 2428 KB Output is correct
24 Correct 4 ms 2424 KB Output is correct
25 Correct 5 ms 2680 KB Output is correct
26 Correct 5 ms 2552 KB Output is correct
27 Correct 9 ms 2680 KB Output is correct
28 Correct 15 ms 2808 KB Output is correct
29 Correct 10 ms 2680 KB Output is correct
30 Correct 4 ms 2424 KB Output is correct
31 Correct 12 ms 2812 KB Output is correct
32 Correct 11 ms 2680 KB Output is correct
33 Correct 10 ms 2680 KB Output is correct
34 Correct 17 ms 2936 KB Output is correct
35 Correct 23 ms 2936 KB Output is correct
36 Correct 65 ms 3832 KB Output is correct
37 Correct 103 ms 4600 KB Output is correct
38 Correct 150 ms 5496 KB Output is correct
39 Correct 97 ms 4348 KB Output is correct
40 Correct 4 ms 2552 KB Output is correct
41 Correct 161 ms 5268 KB Output is correct
42 Correct 174 ms 5628 KB Output is correct
43 Execution timed out 1078 ms 10624 KB Time limit exceeded
44 Halted 0 ms 0 KB -