oj.uz

Submission #836428

# Submission time Handle Problem Language Result Execution time Memory
836428 2023-08-24T11:05:26 Z NeroZein Packing Biscuits (IOI20_biscuits) C++17
9 / 100
 196 ms 340 KB 
#include "biscuits.h"
#include "bits/stdc++.h"
using namespace std; 

long long count_tastiness(long long x, std::vector<long long> a) {
  long long ret = 1;
  int k = (int) a.size(); 
  if (x != 1) {
    for (int i = 1; (long long) i * x <= (int) 1e5; ++i) {
      vector<long long> b = a; 
      bool ok = true; 
      for (int rep = 0; rep < x; ++rep) {
        int rem = i;
        for (int j = k - 1; j >= 0; --j) {
          int take = rem / (1LL << j); 
          int can_take = min((long long) take, b[j]); 
          b[j] -= can_take;
          rem -= can_take * (1LL << j); 
        }
        ok &= rem == 0;       
      }
      ret += ok; 
    }    
  } else {
    int cnt = 0; 
    for (int i = k - 1; i >= 0; --i) {
      cnt++; 
      if (a[i]) {
        ret += (ret - 1) * min(a[i], ((1LL << cnt) - 1)) + a[i];
        cnt = 0; 
      }
      //cout << ret << '\n'; 
    }
  }
  return ret;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 212 KB Output is correct
4 Correct 23 ms 212 KB Output is correct
5 Correct 11 ms 212 KB Output is correct
6 Correct 34 ms 276 KB Output is correct
7 Correct 8 ms 296 KB Output is correct
8 Correct 34 ms 276 KB Output is correct
9 Correct 10 ms 212 KB Output is correct
10 Correct 63 ms 212 KB Output is correct
11 Correct 11 ms 212 KB Output is correct
12 Correct 196 ms 276 KB Output is correct
13 Correct 187 ms 212 KB Output is correct
14 Correct 195 ms 276 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 121 ms 276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 212 KB Output is correct
4 Correct 23 ms 212 KB Output is correct
5 Correct 11 ms 212 KB Output is correct
6 Correct 34 ms 276 KB Output is correct
7 Correct 8 ms 296 KB Output is correct
8 Correct 34 ms 276 KB Output is correct
9 Correct 10 ms 212 KB Output is correct
10 Correct 63 ms 212 KB Output is correct
11 Correct 11 ms 212 KB Output is correct
12 Correct 196 ms 276 KB Output is correct
13 Correct 187 ms 212 KB Output is correct
14 Correct 195 ms 276 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Incorrect 0 ms 212 KB Output isn't correct
24 Halted 0 ms 0 KB -