oj.uz

답안 #675564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675564 2022-12-27T12:55:51 Z m23022002 Bali Sculptures (APIO15_sculpture) C++14
21 / 100
 43 ms 536 KB 
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define pi (3.141592653589)
#define ordered_set tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update>
#define mod 1000000007
#define N 100000
#define float double
#define pb push_back
#define all(c) c.begin(), c.end()
#define rloop(i, n) for(int i=n-1;i>=0;i--)
#define loop(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);


//--------------------------I never forgive--------------------------------//

vector<int>arr;//(n);
vector<vector<int>>dp;//(arr.size() + 5, vector<int>(curr + 5, -1));
int rec(int i, int n)
{
    //base condition
    if(i == arr.size()){
        // if(n == 0) return 0;
        return LLONG_MAX;
    }
    if(n > arr.size() - i) return LLONG_MAX;
    if(n == 1) return accumulate(arr.begin() + i, arr.end(), 0ll);
    if(dp[i][n] != -1) return dp[i][n];

    //recv condition
    int ans = LLONG_MAX;
    int curr_ans = 0;
    for(int idx = i;idx < arr.size();++idx)
    {
        curr_ans += arr[idx];
        ans = min(ans, curr_ans | rec(idx + 1, n - 1));
    }
    return dp[i][n] = ans;
}
int sol(int curr){
    dp.clear();
    dp.resize(arr.size() + 5);
    loop(i, dp.size()){
        dp[i].resize(curr + 5);
        loop(j, dp[i].size()) dp[i][j] = -1;
    }
    return rec(0, curr);
}
void solve()
{
    int n, a, b;
    cin >> n >> a >> b;
    arr.resize(n);
    loop(i, n) cin >> arr[i];
    int ans = LLONG_MAX;
    for(int i=a;i<=b;++i)
    {
        // cout << sol(i) << endl;
        ans = min(ans, sol(i));
    }
    cout << ans << endl;
}

int32_t main(){
fast
int t=1;
// cin>>t;
while(t--){
    solve();
}
return 0;
}

Compilation message

sculpture.cpp: In function 'long long int rec(long long int, long long int)':
sculpture.cpp:26:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     if(i == arr.size()){
      |        ~~^~~~~~~~~~~~~
sculpture.cpp:30:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   30 |     if(n > arr.size() - i) return LLONG_MAX;
      |        ~~^~~~~~~~~~~~~~~~
sculpture.cpp:37:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int idx = i;idx < arr.size();++idx)
      |                     ~~~~^~~~~~~~~~~~
sculpture.cpp: In function 'long long int sol(long long int)':
sculpture.cpp:15:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 | #define loop(i,n) for(int i=0;i<n;i++)
......
   47 |     loop(i, dp.size()){
      |          ~~~~~~~~~~~~           
sculpture.cpp:47:5: note: in expansion of macro 'loop'
   47 |     loop(i, dp.size()){
      |     ^~~~
sculpture.cpp:15:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 | #define loop(i,n) for(int i=0;i<n;i++)
......
   49 |         loop(j, dp[i].size()) dp[i][j] = -1;
      |              ~~~~~~~~~~~~~~~    
sculpture.cpp:49:9: note: in expansion of macro 'loop'
   49 |         loop(j, dp[i].size()) dp[i][j] = -1;
      |         ^~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 0 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 0 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 24 ms 416 KB Output is correct
28 Correct 40 ms 532 KB Output is correct
29 Correct 43 ms 428 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 19 ms 396 KB Output is correct
32 Correct 33 ms 412 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 0 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 18 ms 340 KB Output is correct
38 Correct 38 ms 516 KB Output is correct
39 Correct 39 ms 532 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 19 ms 416 KB Output is correct
42 Correct 40 ms 536 KB Output is correct
43 Incorrect 1 ms 340 KB Output isn't correct
44 Halted 0 ms 0 KB -