oj.uz

Submission #900246

# Submission time Handle Problem Language Result Execution time Memory
900246 2024-01-08T01:44:35 Z nguyentunglam Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 1000 ms 596 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;

const int N = 110;

long long a[N];

long long count_tastiness(long long x, vector<long long> A) {
  for(int i = 0; i < A.size(); i++) a[i] = A[i];
  long long ret = 1;
  for(int y = 1; y <= 1e5; y++) {
    long long tmp = y;
    long long cur = 0;
    for(int j = 60; j >= 0; j--) {
      cur *= 2;
      if (tmp >> j & 1) cur += x;
      cur = max(0LL, cur - a[j]);
    }
    if (!cur) ret++;
//    if (!cur) cout << y << endl;
  }
  return ret;
}

#ifdef ngu
int main() {

  freopen ("task.inp", "r", stdin);
  freopen ("task.out", "w", stdout);

  int q; cin >> q;

  while (q--) {
    long long k, x;
    cin >> k >> x;
    vector<long long> a(k);
    for(int i = 0; i < k; i++) cin >> a[i];
    cout << count_tastiness(x, a) << endl;
  }
}
#endif // ngu

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:13:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for(int i = 0; i < A.size(); i++) a[i] = A[i];
      |                  ~~^~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 348 KB Output is correct
2 Incorrect 83 ms 416 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 596 KB Output is correct
2 Incorrect 50 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1056 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 348 KB Output is correct
2 Incorrect 83 ms 416 KB Output isn't correct
3 Halted 0 ms 0 KB -