oj.uz

Submission #378216

# Submission time Handle Problem Language Result Execution time Memory
378216 2021-03-16T08:47:36 Z Thistle Packing Biscuits (IOI20_biscuits) C++14
42 / 100
 1000 ms 15896 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())
#pragma GCC target("avx2")
#pragma GCC optimize("O3")


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];
	mp[0].reserve(100000);
	mp[1].reserve(100000);
	//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)>>1]+=g.sc;
			nxt[t>>1]+=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:27:2: note: in expansion of macro 'rng'
   27 |  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:33:2: note: in expansion of macro 'rep'
   33 |  rep(i,60){
      |  ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2092 KB Output is correct
2 Correct 27 ms 2180 KB Output is correct
3 Correct 32 ms 2060 KB Output is correct
4 Correct 27 ms 2092 KB Output is correct
5 Correct 27 ms 2092 KB Output is correct
6 Correct 26 ms 2092 KB Output is correct
7 Correct 26 ms 2092 KB Output is correct
8 Correct 26 ms 2092 KB Output is correct
9 Correct 26 ms 2092 KB Output is correct
10 Correct 27 ms 2092 KB Output is correct
11 Correct 27 ms 2092 KB Output is correct
12 Correct 26 ms 2068 KB Output is correct
13 Correct 26 ms 2860 KB Output is correct
14 Correct 23 ms 2112 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2092 KB Output is correct
2 Correct 16 ms 2060 KB Output is correct
3 Correct 28 ms 2116 KB Output is correct
4 Correct 27 ms 2156 KB Output is correct
5 Correct 26 ms 2052 KB Output is correct
6 Correct 26 ms 2068 KB Output is correct
7 Correct 27 ms 2092 KB Output is correct
8 Correct 27 ms 2104 KB Output is correct
9 Correct 32 ms 2068 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 2644 KB Output is correct
2 Correct 86 ms 2552 KB Output is correct
3 Correct 121 ms 2640 KB Output is correct
4 Correct 27 ms 2052 KB Output is correct
5 Correct 26 ms 2052 KB Output is correct
6 Correct 26 ms 2064 KB Output is correct
7 Correct 28 ms 2092 KB Output is correct
8 Correct 255 ms 2668 KB Output is correct
9 Correct 180 ms 2692 KB Output is correct
10 Correct 26 ms 2068 KB Output is correct
11 Correct 25 ms 2028 KB Output is correct
12 Correct 61 ms 2132 KB Output is correct
13 Correct 272 ms 2668 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2092 KB Output is correct
2 Correct 27 ms 2180 KB Output is correct
3 Correct 32 ms 2060 KB Output is correct
4 Correct 27 ms 2092 KB Output is correct
5 Correct 27 ms 2092 KB Output is correct
6 Correct 26 ms 2092 KB Output is correct
7 Correct 26 ms 2092 KB Output is correct
8 Correct 26 ms 2092 KB Output is correct
9 Correct 26 ms 2092 KB Output is correct
10 Correct 27 ms 2092 KB Output is correct
11 Correct 27 ms 2092 KB Output is correct
12 Correct 26 ms 2068 KB Output is correct
13 Correct 26 ms 2860 KB Output is correct
14 Correct 23 ms 2112 KB Output is correct
15 Correct 28 ms 2092 KB Output is correct
16 Correct 16 ms 2060 KB Output is correct
17 Correct 28 ms 2116 KB Output is correct
18 Correct 27 ms 2156 KB Output is correct
19 Correct 26 ms 2052 KB Output is correct
20 Correct 26 ms 2068 KB Output is correct
21 Correct 27 ms 2092 KB Output is correct
22 Correct 27 ms 2104 KB Output is correct
23 Correct 32 ms 2068 KB Output is correct
24 Correct 48 ms 2644 KB Output is correct
25 Correct 86 ms 2552 KB Output is correct
26 Correct 121 ms 2640 KB Output is correct
27 Correct 27 ms 2052 KB Output is correct
28 Correct 26 ms 2052 KB Output is correct
29 Correct 26 ms 2064 KB Output is correct
30 Correct 28 ms 2092 KB Output is correct
31 Correct 255 ms 2668 KB Output is correct
32 Correct 180 ms 2692 KB Output is correct
33 Correct 26 ms 2068 KB Output is correct
34 Correct 25 ms 2028 KB Output is correct
35 Correct 61 ms 2132 KB Output is correct
36 Correct 272 ms 2668 KB Output is correct
37 Execution timed out 1057 ms 15896 KB Time limit exceeded
38 Halted 0 ms 0 KB -