oj.uz

Submission #393696

# Submission time Handle Problem Language Result Execution time Memory
393696 2021-04-24T09:53:12 Z fedoseevtimofey Packing Biscuits (IOI20_biscuits) C++14
42 / 100
 1000 ms 12648 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>
#include <bitset>
#include <chrono>
 
using namespace std;
 
typedef long long ll;
 
#include "biscuits.h"
 
long long count_tastiness(long long x, std::vector<long long> a) {
  int k = a.size();
  vector <pair <ll, ll>> dp;
  dp.push_back({0, 1});
  for (int i = 0;; ++i) {
    vector <pair <ll, ll>> ndp;
    for (auto p : dp) {
      if (i < k) p.first += a[i];
      if (p.first >= x) {
        ndp.push_back(make_pair((p.first - x) / 2, p.second));
      }
      ndp.push_back(make_pair(p.first / 2, p.second));
    }
    sort(ndp.begin(), ndp.end());
    dp.clear();
    for (auto p : ndp) {
      if (dp.empty() || dp.back().first != p.first) dp.push_back(p);
      else dp.back().second += p.second;
    }
    if (dp.size() == 1 && dp[0].first == 0 && i >= k) break;
  }
  ll ans = 0;
  for (auto p : dp) ans += p.second;
  return ans;
}
 
#ifdef LOCAL
int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int q;
  cin >> q;
	vector<int> k(q);
	vector<long long> x(q);
	vector<vector<long long>> a(q);
	vector<long long> results(q);
	for (int t = 0; t < q; t++) {
    cin >> k[t] >> x[t];
		a[t] = vector<long long>(k[t]);
		for (int i = 0; i < k[t]; i++) {
      cin >> a[t][i];
		}
	}
	for (int t = 0; t < q; t++) {
		results[t] = count_tastiness(x[t], a[t]);
	}
	for (int t = 0; t < q; t++) {
	  cout << results[t] << '\n';;
	}
}
#endif

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 296 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1424 KB Output is correct
2 Correct 84 ms 1260 KB Output is correct
3 Correct 150 ms 1348 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 361 ms 1412 KB Output is correct
9 Correct 239 ms 1396 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 6 ms 204 KB Output is correct
12 Correct 52 ms 448 KB Output is correct
13 Correct 425 ms 1424 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 292 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 39 ms 1424 KB Output is correct
25 Correct 84 ms 1260 KB Output is correct
26 Correct 150 ms 1348 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 361 ms 1412 KB Output is correct
32 Correct 239 ms 1396 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 6 ms 204 KB Output is correct
35 Correct 52 ms 448 KB Output is correct
36 Correct 425 ms 1424 KB Output is correct
37 Execution timed out 1097 ms 12648 KB Time limit exceeded
38 Halted 0 ms 0 KB -