oj.uz

Submission #653617

# Submission time Handle Problem Language Result Execution time Memory
653617 2022-10-27T11:49:27 Z AdamGS Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 8156 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3, unroll-loops")
 
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) 
        knapsack1[make]=max(knapsack1[make], knapsack1[make-use*i-i]+use+1);
      for(int use=0; use<b; ++use)
        knapsack2[make]=max(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 < 0){
    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();
  }
}

Compilation message

vault.cpp:2:40: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
    2 | #pragma GCC optimize("O3, unroll-loops")
      |                                        ^
vault.cpp:14:12: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   14 | void solve(){
      |            ^
vault.cpp:54:10: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   54 | int main(){
      |          ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8148 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1459 ms 8148 KB Output is correct
6 Correct 1610 ms 8148 KB Output is correct
7 Correct 667 ms 8148 KB Output is correct
8 Correct 1460 ms 8156 KB Output is correct
9 Correct 2672 ms 8148 KB Output is correct
10 Correct 218 ms 8148 KB Output is correct
11 Correct 202 ms 8148 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8148 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1459 ms 8148 KB Output is correct
6 Correct 1610 ms 8148 KB Output is correct
7 Correct 667 ms 8148 KB Output is correct
8 Correct 1460 ms 8156 KB Output is correct
9 Correct 2672 ms 8148 KB Output is correct
10 Correct 218 ms 8148 KB Output is correct
11 Correct 202 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 17 ms 8156 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 46 ms 8148 KB Output is correct
16 Correct 1461 ms 8148 KB Output is correct
17 Correct 1601 ms 8148 KB Output is correct
18 Correct 678 ms 8152 KB Output is correct
19 Correct 1508 ms 8148 KB Output is correct
20 Correct 2680 ms 8148 KB Output is correct
21 Correct 216 ms 8140 KB Output is correct
22 Correct 207 ms 8156 KB Output is correct
23 Execution timed out 5067 ms 8148 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

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

Subtask #3-2
0 / 10.0

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

Subtask #4-1
0 / 10.0

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

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8148 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1459 ms 8148 KB Output is correct
6 Correct 1610 ms 8148 KB Output is correct
7 Correct 667 ms 8148 KB Output is correct
8 Correct 1460 ms 8156 KB Output is correct
9 Correct 2672 ms 8148 KB Output is correct
10 Correct 218 ms 8148 KB Output is correct
11 Correct 202 ms 8148 KB Output is correct
12 Correct 44 ms 8148 KB Output is correct
13 Execution timed out 5059 ms 8148 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

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

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8148 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1459 ms 8148 KB Output is correct
6 Correct 1610 ms 8148 KB Output is correct
7 Correct 667 ms 8148 KB Output is correct
8 Correct 1460 ms 8156 KB Output is correct
9 Correct 2672 ms 8148 KB Output is correct
10 Correct 218 ms 8148 KB Output is correct
11 Correct 202 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 17 ms 8156 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 46 ms 8148 KB Output is correct
16 Correct 1461 ms 8148 KB Output is correct
17 Correct 1601 ms 8148 KB Output is correct
18 Correct 678 ms 8152 KB Output is correct
19 Correct 1508 ms 8148 KB Output is correct
20 Correct 2680 ms 8148 KB Output is correct
21 Correct 216 ms 8140 KB Output is correct
22 Correct 207 ms 8156 KB Output is correct
23 Execution timed out 5067 ms 8148 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

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

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8148 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 47 ms 8148 KB Output is correct
5 Correct 1459 ms 8148 KB Output is correct
6 Correct 1610 ms 8148 KB Output is correct
7 Correct 667 ms 8148 KB Output is correct
8 Correct 1460 ms 8156 KB Output is correct
9 Correct 2672 ms 8148 KB Output is correct
10 Correct 218 ms 8148 KB Output is correct
11 Correct 202 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 17 ms 8156 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 46 ms 8148 KB Output is correct
16 Correct 1461 ms 8148 KB Output is correct
17 Correct 1601 ms 8148 KB Output is correct
18 Correct 678 ms 8152 KB Output is correct
19 Correct 1508 ms 8148 KB Output is correct
20 Correct 2680 ms 8148 KB Output is correct
21 Correct 216 ms 8140 KB Output is correct
22 Correct 207 ms 8156 KB Output is correct
23 Execution timed out 5067 ms 8148 KB Time limit exceeded
24 Halted 0 ms 0 KB -