oj.uz

답안 #653563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
653563 2022-10-27T09:16:17 Z atigun Uplifting Excursion (BOI22_vault) C++14
5 / 100
 5000 ms 16336 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")

using namespace std;
typedef long long ll;

const int maxn = 100;

int M;
ll L;

vector<int> pos(maxn+5), neg(maxn+5);

void solve(){
  cin >> M >> L;
  for(int i = 1; i <= M; i++)
    cin >> neg[M-i+1];
  ll ans;
  cin >> ans;
  for(int i = 1; i <= M; i++)
    cin >> pos[i];
  int maxn3 = (maxn*maxn+1)/2*maxn;
  vector<ll> knapsack1(maxn3+5, -1e18), knapsack2(maxn3+5, -1e18);
  knapsack1[0] = knapsack2[0] = 0;
  for(int i = 1; i <= M; i++){
    for(int make = maxn3; make >= 0; make--){
      for(int use = 1; use <= max(pos[i], neg[i]); use++){
        if(use <= pos[i] && use*i <= make && knapsack1[make-use*i] != -1e18)
          knapsack1[make] = max(knapsack1[make], knapsack1[make-use*i]+use);
        if(use <= neg[i] && use*i <= make && knapsack2[make-use*i] != -1e18)
          knapsack2[make] = max(knapsack2[make], knapsack2[make-use*i]+use);
      }
    }
  }
  ll add = -1e18;
  for(int i = 0; i <= maxn3; i++){
    ll need = L-i;
    if(need > 0){
      continue;
    }else if(need == 0){
      add = max(add, knapsack1[i]);
    }else if(-need >= maxn3 || knapsack2[-need] == -1e18 || knapsack1[i] == -1e18){
      continue;
    }else{
      add = max(add, knapsack1[i] + knapsack2[-need]);
    }
  }
  if(add == -1e18){
    cout << "impossible\n";
  }else{
    cout << ans+add;
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt = 1;
  // cin >> tt;
  while(tt--){
    solve();
  }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 9 ms 8164 KB Output is correct
3 Correct 9 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1634 ms 8132 KB Output is correct
6 Correct 1720 ms 8148 KB Output is correct
7 Correct 775 ms 8148 KB Output is correct
8 Correct 1666 ms 8148 KB Output is correct
9 Correct 2686 ms 8140 KB Output is correct
10 Correct 112 ms 8148 KB Output is correct
11 Correct 110 ms 8148 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 9 ms 8164 KB Output is correct
3 Correct 9 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1634 ms 8132 KB Output is correct
6 Correct 1720 ms 8148 KB Output is correct
7 Correct 775 ms 8148 KB Output is correct
8 Correct 1666 ms 8148 KB Output is correct
9 Correct 2686 ms 8140 KB Output is correct
10 Correct 112 ms 8148 KB Output is correct
11 Correct 110 ms 8148 KB Output is correct
12 Correct 13 ms 8148 KB Output is correct
13 Correct 9 ms 8148 KB Output is correct
14 Correct 10 ms 8148 KB Output is correct
15 Correct 48 ms 8148 KB Output is correct
16 Correct 1591 ms 8148 KB Output is correct
17 Correct 1828 ms 8148 KB Output is correct
18 Correct 796 ms 8152 KB Output is correct
19 Correct 1592 ms 8148 KB Output is correct
20 Correct 2528 ms 8148 KB Output is correct
21 Correct 106 ms 8148 KB Output is correct
22 Correct 98 ms 8148 KB Output is correct
23 Execution timed out 5066 ms 8148 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 8148 KB Output is correct
2 Runtime error 533 ms 16336 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 8148 KB Output is correct
2 Runtime error 533 ms 16336 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 8148 KB Output is correct
2 Runtime error 533 ms 16336 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 9 ms 8164 KB Output is correct
3 Correct 9 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1634 ms 8132 KB Output is correct
6 Correct 1720 ms 8148 KB Output is correct
7 Correct 775 ms 8148 KB Output is correct
8 Correct 1666 ms 8148 KB Output is correct
9 Correct 2686 ms 8140 KB Output is correct
10 Correct 112 ms 8148 KB Output is correct
11 Correct 110 ms 8148 KB Output is correct
12 Correct 49 ms 8148 KB Output is correct
13 Runtime error 533 ms 16336 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 8148 KB Output is correct
2 Runtime error 533 ms 16336 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 9 ms 8164 KB Output is correct
3 Correct 9 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1634 ms 8132 KB Output is correct
6 Correct 1720 ms 8148 KB Output is correct
7 Correct 775 ms 8148 KB Output is correct
8 Correct 1666 ms 8148 KB Output is correct
9 Correct 2686 ms 8140 KB Output is correct
10 Correct 112 ms 8148 KB Output is correct
11 Correct 110 ms 8148 KB Output is correct
12 Correct 13 ms 8148 KB Output is correct
13 Correct 9 ms 8148 KB Output is correct
14 Correct 10 ms 8148 KB Output is correct
15 Correct 48 ms 8148 KB Output is correct
16 Correct 1591 ms 8148 KB Output is correct
17 Correct 1828 ms 8148 KB Output is correct
18 Correct 796 ms 8152 KB Output is correct
19 Correct 1592 ms 8148 KB Output is correct
20 Correct 2528 ms 8148 KB Output is correct
21 Correct 106 ms 8148 KB Output is correct
22 Correct 98 ms 8148 KB Output is correct
23 Execution timed out 5066 ms 8148 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 8148 KB Output is correct
2 Runtime error 533 ms 16336 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 9 ms 8164 KB Output is correct
3 Correct 9 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1634 ms 8132 KB Output is correct
6 Correct 1720 ms 8148 KB Output is correct
7 Correct 775 ms 8148 KB Output is correct
8 Correct 1666 ms 8148 KB Output is correct
9 Correct 2686 ms 8140 KB Output is correct
10 Correct 112 ms 8148 KB Output is correct
11 Correct 110 ms 8148 KB Output is correct
12 Correct 13 ms 8148 KB Output is correct
13 Correct 9 ms 8148 KB Output is correct
14 Correct 10 ms 8148 KB Output is correct
15 Correct 48 ms 8148 KB Output is correct
16 Correct 1591 ms 8148 KB Output is correct
17 Correct 1828 ms 8148 KB Output is correct
18 Correct 796 ms 8152 KB Output is correct
19 Correct 1592 ms 8148 KB Output is correct
20 Correct 2528 ms 8148 KB Output is correct
21 Correct 106 ms 8148 KB Output is correct
22 Correct 98 ms 8148 KB Output is correct
23 Execution timed out 5066 ms 8148 KB Time limit exceeded
24 Halted 0 ms 0 KB -