제출 #112050

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
112050	2019-05-17 07:35:15	Eug1ena	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	192 ms	632 KiB

sculpture

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
int N, A, B;
vector<lint> sum{0};
lint notbit = 0;
lint dp[105][105];
bool minimum(int now, int cnt){
    if(now == N){
        return (A <= cnt && cnt <= B);
    }else if(dp[now][cnt] != -1){
        return dp[now][cnt];
    }
    int ans = false;
    for(int i = now + 1; i <= N; i++){
        if(((sum[i] - sum[now]) & notbit) == 0){
            ans |= minimum(i, cnt + 1);
        }
    }
    return dp[now][cnt] = ans;
}
int dp2[2020];
int minimum2(int now){
    if(now == N){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

sculpture.cpp: In function 'bool minimum(int, int)':
sculpture.cpp:24:25: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
     return dp[now][cnt] = ans;
            ~~~~~~~~~~~~~^~~~~

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 29 / 29