oj.uz

Submission #653619

# Submission time Handle Problem Language Result Execution time Memory
653619 2022-10-27T11:54:07 Z AdamGS Uplifting Excursion (BOI22_vault) C++17
5 / 100
 5000 ms 8268 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast, 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, akt=make-i; use < a; ++use, akt-=i) if(knapsack1[make]<knapsack1[akt]+use+1)
        knapsack1[make]=knapsack1[akt]+use+1;
      for(int use=0, akt=make-i; use<b; ++use, akt-=i) if(knapsack2[make]<knapsack2[akt]+use+1)
        knapsack2[make]=knapsack2[akt]+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:43: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
    2 | #pragma GCC optimize("Ofast, 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 8092 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 44 ms 8148 KB Output is correct
5 Correct 1147 ms 8148 KB Output is correct
6 Correct 1281 ms 8268 KB Output is correct
7 Correct 598 ms 8152 KB Output is correct
8 Correct 1211 ms 8148 KB Output is correct
9 Correct 2257 ms 8148 KB Output is correct
10 Correct 209 ms 8148 KB Output is correct
11 Correct 201 ms 8148 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8092 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 44 ms 8148 KB Output is correct
5 Correct 1147 ms 8148 KB Output is correct
6 Correct 1281 ms 8268 KB Output is correct
7 Correct 598 ms 8152 KB Output is correct
8 Correct 1211 ms 8148 KB Output is correct
9 Correct 2257 ms 8148 KB Output is correct
10 Correct 209 ms 8148 KB Output is correct
11 Correct 201 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 16 ms 8148 KB Output is correct
14 Correct 9 ms 8156 KB Output is correct
15 Correct 51 ms 8140 KB Output is correct
16 Correct 1159 ms 8148 KB Output is correct
17 Correct 1368 ms 8148 KB Output is correct
18 Correct 609 ms 8148 KB Output is correct
19 Correct 1190 ms 8148 KB Output is correct
20 Correct 2277 ms 8148 KB Output is correct
21 Correct 223 ms 8148 KB Output is correct
22 Correct 207 ms 8148 KB Output is correct
23 Correct 4839 ms 8148 KB Output is correct
24 Correct 4618 ms 8148 KB Output is correct
25 Correct 1848 ms 8148 KB Output is correct
26 Execution timed out 5090 ms 8148 KB Time limit exceeded
27 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 5084 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 45 ms 8148 KB Output is correct
2 Execution timed out 5084 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 45 ms 8148 KB Output is correct
2 Execution timed out 5084 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 8092 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 44 ms 8148 KB Output is correct
5 Correct 1147 ms 8148 KB Output is correct
6 Correct 1281 ms 8268 KB Output is correct
7 Correct 598 ms 8152 KB Output is correct
8 Correct 1211 ms 8148 KB Output is correct
9 Correct 2257 ms 8148 KB Output is correct
10 Correct 209 ms 8148 KB Output is correct
11 Correct 201 ms 8148 KB Output is correct
12 Correct 45 ms 8148 KB Output is correct
13 Execution timed out 5084 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 45 ms 8148 KB Output is correct
2 Execution timed out 5084 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 8092 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 44 ms 8148 KB Output is correct
5 Correct 1147 ms 8148 KB Output is correct
6 Correct 1281 ms 8268 KB Output is correct
7 Correct 598 ms 8152 KB Output is correct
8 Correct 1211 ms 8148 KB Output is correct
9 Correct 2257 ms 8148 KB Output is correct
10 Correct 209 ms 8148 KB Output is correct
11 Correct 201 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 16 ms 8148 KB Output is correct
14 Correct 9 ms 8156 KB Output is correct
15 Correct 51 ms 8140 KB Output is correct
16 Correct 1159 ms 8148 KB Output is correct
17 Correct 1368 ms 8148 KB Output is correct
18 Correct 609 ms 8148 KB Output is correct
19 Correct 1190 ms 8148 KB Output is correct
20 Correct 2277 ms 8148 KB Output is correct
21 Correct 223 ms 8148 KB Output is correct
22 Correct 207 ms 8148 KB Output is correct
23 Correct 4839 ms 8148 KB Output is correct
24 Correct 4618 ms 8148 KB Output is correct
25 Correct 1848 ms 8148 KB Output is correct
26 Execution timed out 5090 ms 8148 KB Time limit exceeded
27 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 5084 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 8092 KB Output is correct
2 Correct 16 ms 8148 KB Output is correct
3 Correct 8 ms 8148 KB Output is correct
4 Correct 44 ms 8148 KB Output is correct
5 Correct 1147 ms 8148 KB Output is correct
6 Correct 1281 ms 8268 KB Output is correct
7 Correct 598 ms 8152 KB Output is correct
8 Correct 1211 ms 8148 KB Output is correct
9 Correct 2257 ms 8148 KB Output is correct
10 Correct 209 ms 8148 KB Output is correct
11 Correct 201 ms 8148 KB Output is correct
12 Correct 12 ms 8148 KB Output is correct
13 Correct 16 ms 8148 KB Output is correct
14 Correct 9 ms 8156 KB Output is correct
15 Correct 51 ms 8140 KB Output is correct
16 Correct 1159 ms 8148 KB Output is correct
17 Correct 1368 ms 8148 KB Output is correct
18 Correct 609 ms 8148 KB Output is correct
19 Correct 1190 ms 8148 KB Output is correct
20 Correct 2277 ms 8148 KB Output is correct
21 Correct 223 ms 8148 KB Output is correct
22 Correct 207 ms 8148 KB Output is correct
23 Correct 4839 ms 8148 KB Output is correct
24 Correct 4618 ms 8148 KB Output is correct
25 Correct 1848 ms 8148 KB Output is correct
26 Execution timed out 5090 ms 8148 KB Time limit exceeded
27 Halted 0 ms 0 KB -