Submission #1075237

#TimeUsernameProblemLanguageResultExecution timeMemory
1075237allin27x비스킷 담기 (IOI20_biscuits)C++17
44 / 100
136 ms3676 KiB
#include <bits/stdc++.h>
using namespace std;
#include "biscuits.h"
#define int long long

const int N = 2e5+2;
int good[N];

long long count_tastiness(long long x, std::vector<long long> a) {
	a.resize(max((int)a.size(), 61ll), 0); int k = a.size();
	vector<int> s(k,0);
	s[0] = a[0];
	for (int i = 1; i < k; i++) {
		s[i] = s[i - 1] + a[i] * (1ll<<i);
	}
	int ans = 1;
	for (int i=0; i<61; i++) {
		int nw = ans;
		for (int j=0;  j<nw;  j++) {
			if ((good[j]+(1ll<<i)) <= s[i]/x) good[ans++] = good[j] + (1ll<<i);
			else break;
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...