oj.uz

Submission #605427

# Submission time Handle Problem Language Result Execution time Memory
605427 2022-07-25T17:26:49 Z Sam_a17 Packing Biscuits (IOI20_biscuits) C++14
42 / 100
 1000 ms 16644 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(x) cout << #x << " " << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define ld long double
#define ll long long
 
// #include "mushrooms.h"
int use_machine(vector<int> m);
 
template<typename T>
void pr(vector<T>& a) {
  cerr << "arr" << " ";
  for(auto i: a) {
    cerr << i << " "; 
  } cerr << endl;
}


long long count_tastiness(long long x, std::vector<long long> a) {
  
  for(int i = 0; i < 66; i++) {
    a.push_back(0);
  }

  int k = sz(a);
  map<long long, long long> mp1, mp2;
  
  //
  mp1[0] = 1;
  
  //
  for(int i = 0; i < k; i++) {
    for(auto j: mp1) {
      mp2[(j.first + a[i]) / 2] += j.second;

      if(j.first + a[i] >= x) {
        mp2[(j.first + a[i] - x) / 2] += j.second;
      }
    } 
    
    mp1 = mp2;
    mp2.clear();
  }

  //
  long long answ = 0;
  for(auto i: mp1) {
    answ += i.second;
  }

	return answ;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 1528 KB Output is correct
2 Correct 149 ms 1380 KB Output is correct
3 Correct 220 ms 1356 KB Output is correct
4 Correct 1 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 1 ms 296 KB Output is correct
8 Correct 698 ms 1544 KB Output is correct
9 Correct 495 ms 1540 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 8 ms 304 KB Output is correct
12 Correct 72 ms 424 KB Output is correct
13 Correct 601 ms 1516 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 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 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 85 ms 1528 KB Output is correct
25 Correct 149 ms 1380 KB Output is correct
26 Correct 220 ms 1356 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 698 ms 1544 KB Output is correct
32 Correct 495 ms 1540 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 8 ms 304 KB Output is correct
35 Correct 72 ms 424 KB Output is correct
36 Correct 601 ms 1516 KB Output is correct
37 Execution timed out 1100 ms 16644 KB Time limit exceeded
38 Halted 0 ms 0 KB -