제출 #900246

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
900246		nguyentunglam	비스킷 담기 (IOI20_biscuits)	C++17	0 / 100	1056 ms	596 KiB

biscuits

#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

컴파일 시 표준 에러 (stderr) 메시지

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
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23