oj.uz

Submission #653613

# Submission time Handle Problem Language Result Execution time Memory
653613 2022-10-27T11:40:47 Z AdamGS Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 8172 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--){
      int a=min(pos[i], make/i), b=min(neg[i], make/i);
      for(int use=0; use < a; ++use) if(knapsack1[make]<knapsack1[make-use*i-i]+use+1)
        knapsack1[make]=knapsack1[make-use*i-i]+use+1;
      for(int use=0; use<b; ++use) if(knapsack2[make]<knapsack2[make-use*i-i]+use+1)
        knapsack2[make]=knapsack2[make-use*i-i]+use+1;
    }
  }
  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] < 0 || knapsack1[i] < 0){
      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

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 15 ms 8156 KB Output is correct
3 Correct 9 ms 8172 KB Output is correct
4 Correct 45 ms 8148 KB Output is correct
5 Correct 1139 ms 8148 KB Output is correct
6 Correct 1256 ms 8148 KB Output is correct
7 Correct 580 ms 8148 KB Output is correct
8 Correct 1196 ms 8148 KB Output is correct
9 Correct 2295 ms 8148 KB Output is correct
10 Correct 215 ms 8148 KB Output is correct
11 Correct 203 ms 8148 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 15 ms 8156 KB Output is correct
3 Correct 9 ms 8172 KB Output is correct
4 Correct 45 ms 8148 KB Output is correct
5 Correct 1139 ms 8148 KB Output is correct
6 Correct 1256 ms 8148 KB Output is correct
7 Correct 580 ms 8148 KB Output is correct
8 Correct 1196 ms 8148 KB Output is correct
9 Correct 2295 ms 8148 KB Output is correct
10 Correct 215 ms 8148 KB Output is correct
11 Correct 203 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 16 ms 8156 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 45 ms 8148 KB Output is correct
16 Correct 1145 ms 8148 KB Output is correct
17 Correct 1286 ms 8148 KB Output is correct
18 Correct 592 ms 8148 KB Output is correct
19 Correct 1198 ms 8148 KB Output is correct
20 Correct 2282 ms 8148 KB Output is correct
21 Correct 209 ms 8136 KB Output is correct
22 Correct 204 ms 8148 KB Output is correct
23 Correct 4641 ms 8156 KB Output is correct
24 Correct 4537 ms 8148 KB Output is correct
25 Incorrect 1791 ms 8148 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8148 KB Output is correct
2 Execution timed out 5097 ms 8096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8148 KB Output is correct
2 Execution timed out 5097 ms 8096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8148 KB Output is correct
2 Execution timed out 5097 ms 8096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 15 ms 8156 KB Output is correct
3 Correct 9 ms 8172 KB Output is correct
4 Correct 45 ms 8148 KB Output is correct
5 Correct 1139 ms 8148 KB Output is correct
6 Correct 1256 ms 8148 KB Output is correct
7 Correct 580 ms 8148 KB Output is correct
8 Correct 1196 ms 8148 KB Output is correct
9 Correct 2295 ms 8148 KB Output is correct
10 Correct 215 ms 8148 KB Output is correct
11 Correct 203 ms 8148 KB Output is correct
12 Correct 45 ms 8148 KB Output is correct
13 Execution timed out 5097 ms 8096 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8148 KB Output is correct
2 Execution timed out 5097 ms 8096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 15 ms 8156 KB Output is correct
3 Correct 9 ms 8172 KB Output is correct
4 Correct 45 ms 8148 KB Output is correct
5 Correct 1139 ms 8148 KB Output is correct
6 Correct 1256 ms 8148 KB Output is correct
7 Correct 580 ms 8148 KB Output is correct
8 Correct 1196 ms 8148 KB Output is correct
9 Correct 2295 ms 8148 KB Output is correct
10 Correct 215 ms 8148 KB Output is correct
11 Correct 203 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 16 ms 8156 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 45 ms 8148 KB Output is correct
16 Correct 1145 ms 8148 KB Output is correct
17 Correct 1286 ms 8148 KB Output is correct
18 Correct 592 ms 8148 KB Output is correct
19 Correct 1198 ms 8148 KB Output is correct
20 Correct 2282 ms 8148 KB Output is correct
21 Correct 209 ms 8136 KB Output is correct
22 Correct 204 ms 8148 KB Output is correct
23 Correct 4641 ms 8156 KB Output is correct
24 Correct 4537 ms 8148 KB Output is correct
25 Incorrect 1791 ms 8148 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8148 KB Output is correct
2 Execution timed out 5097 ms 8096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8148 KB Output is correct
2 Correct 15 ms 8156 KB Output is correct
3 Correct 9 ms 8172 KB Output is correct
4 Correct 45 ms 8148 KB Output is correct
5 Correct 1139 ms 8148 KB Output is correct
6 Correct 1256 ms 8148 KB Output is correct
7 Correct 580 ms 8148 KB Output is correct
8 Correct 1196 ms 8148 KB Output is correct
9 Correct 2295 ms 8148 KB Output is correct
10 Correct 215 ms 8148 KB Output is correct
11 Correct 203 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 16 ms 8156 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 45 ms 8148 KB Output is correct
16 Correct 1145 ms 8148 KB Output is correct
17 Correct 1286 ms 8148 KB Output is correct
18 Correct 592 ms 8148 KB Output is correct
19 Correct 1198 ms 8148 KB Output is correct
20 Correct 2282 ms 8148 KB Output is correct
21 Correct 209 ms 8136 KB Output is correct
22 Correct 204 ms 8148 KB Output is correct
23 Correct 4641 ms 8156 KB Output is correct
24 Correct 4537 ms 8148 KB Output is correct
25 Incorrect 1791 ms 8148 KB Output isn't correct
26 Halted 0 ms 0 KB -