oj.uz

Submission #377935

# Submission time Handle Problem Language Result Execution time Memory
377935 2021-03-15T15:03:35 Z Thistle Packing Biscuits (IOI20_biscuits) C++14
42 / 100
 1000 ms 16300 KB 
#include "biscuits.h"
#include <vector>
#include<iostream>
#include<algorithm>
#include<unordered_map>
#include<map>
using namespace std;
using ll=long long;
using H=pair<ll, ll>;
using vi=vector<ll>;
#define rng(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) rng((i),(0),(n))
#define pb push_back
#define vec vector
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define siz(a) ll((a).size())


long long count_tastiness(long long x, std::vector<long long> a) {
	ll k=siz(a);
	a.resize(60);
	rng(i,k,60) a[i]=0;
	unordered_map<ll, ll>mp[2];
	//remain cookie -> able number
	mp[0][0]=1;
	rep(i,60){
		auto& now=mp[i&1];
		auto& nxt=mp[(i+1)&1];
		nxt.clear();
		for(auto g:now){
			ll t=g.fs;
			t+=a[i];
			if(t>=x) nxt[(t-x)/2]+=g.sc;
			nxt[t/2]+=g.sc;
		}
	}

	ll ans=0;
	for(auto g:mp[0]){
		ans+=g.sc;
	}
	return ans;
}

Compilation message

biscuits.cpp: In function 'long long int count_tastiness(long long int, std::vector<long long int>)':
biscuits.cpp:11:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define rng(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
      |                            ^
biscuits.cpp:24:2: note: in expansion of macro 'rng'
   24 |  rng(i,k,60) a[i]=0;
      |  ^~~
biscuits.cpp:11:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define rng(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
      |                            ^
biscuits.cpp:12:18: note: in expansion of macro 'rng'
   12 | #define rep(i,n) rng((i),(0),(n))
      |                  ^~~
biscuits.cpp:28:2: note: in expansion of macro 'rep'
   28 |  rep(i,60){
      |  ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 1132 KB Output is correct
2 Correct 70 ms 1144 KB Output is correct
3 Correct 110 ms 1132 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 274 ms 1316 KB Output is correct
9 Correct 186 ms 1176 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 4 ms 364 KB Output is correct
12 Correct 39 ms 364 KB Output is correct
13 Correct 289 ms 1276 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 16300 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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 34 ms 1132 KB Output is correct
25 Correct 70 ms 1144 KB Output is correct
26 Correct 110 ms 1132 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 274 ms 1316 KB Output is correct
32 Correct 186 ms 1176 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 4 ms 364 KB Output is correct
35 Correct 39 ms 364 KB Output is correct
36 Correct 289 ms 1276 KB Output is correct
37 Execution timed out 1077 ms 16300 KB Time limit exceeded
38 Halted 0 ms 0 KB -