제출 #657091

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
657091	2022-11-08 21:05:32	Lobo	Uplifting Excursion (BOI22_vault)	C++17	20 / 100	3224 ms	524288 KiB

vault

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;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxm = 51;
int n, m, L;
void solve() {
    cin >> m >> L;
    vector<pair<int,int>> vals;
    int sumneg = 0, sumpos = 0;
    for(int i = -m; i <= m; i++) {
        int x; cin >> x;
        if(i > 0) sumpos+= x*i;
        if(i < 0) sumneg-= x*i;
        for(int j = 0; j <= 10; j++) {
            if((1<<j) <= x) {
                x-= (1<<j);
                vals.pb(mp(i*(1<<j),(1<<j)));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

vault.cpp: In function 'void solve()':
vault.cpp:60:51: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   60 |             dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j+up]);
      |                                                  ~^~
vault.cpp:61:87: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   61 |             if(j-x >= -sumneg && j-x <= sumpos) dp[i&1][j+up] = max(dp[i&1][j+up],dp[i&1^1][j-x+up]+q);
      |                                                                                      ~^~

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10