Submission #995126


Source Code Expand

Copy
// tsukasa_diary's programing contest code template
#include <bits/stdc++.h>
using namespace std;
#define TSUKASA_DIARY_S_TEMPLATE
// define
#define for_(i,a,b) for(int i=(a);i<(b);++i)
#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)
#define allof(a) (a).begin(),(a).end()
#define minit(a,b) memset(a,b,sizeof(a))
#define size_of(a) int((a).size())
#define cauto const auto
// typedef
typedef long long lint;
typedef double Double;
typedef pair< int, int > pii;
template< typename T > using Vec = vector< T >;
template< typename T > using Matrix = Vec< Vec< T > >;
template< typename T > using USet = unordered_set< T >;
template< typename T, class C > using MyUSet = unordered_set< T, C >;
template< typename T, typename F > using UMap = unordered_map< T, F >;
template< typename T, typename F, class C > using MyUMap = unordered_map< T, F, C >;
// hash
class PiiHash { public: size_t operator () (const pii& p) const { return (p.first << 20) | p.second; } };
// popcount
inline int POPCNT(int x) { return __builtin_popcount(x); }
inline int POPCNT(lint x) { return __builtin_popcount(x); }
// inf
const int iINF = 1L << 30;
const lint lINF = 1LL << 60;
// eps
const Double EPS = 1e-9;
const Double PI = acos(-1);
// inrange
template< typename T >
inline bool in_range(T v, T mi, T mx) { return mi <= v && v < mx; }
template< typename T >
inline bool in_range(T x, T y, T W, T H) { return in_range(x,0,W) && in_range(y,0,H); }
// neighbor clockwise
const int DX[4] = {0,1,0,-1}, DY[4] = {-1,0,1,0};
const int DX_[8] = {0,1,1,1,0,-1,-1,-1}, DY_[8] = {-1,-1,0,1,1,1,0,-1};
// variable update
template< typename T > inline void modAdd(T& a, T b, T mod) { a = (a + b) % mod; }
template< typename T > inline void modMul(T& a, T b, T mod) { a = (a * b) % mod; }
template< typename T > inline void minUpdate(T& a, T b) { a = min(a, b); }
template< typename T > inline void maxUpdate(T& a, T b) { a = max(a, b); }
// converter
template< typename F, typename T >
inline void convert(F& from, T& to) {
	stringstream ss;
	ss << from; ss >> to;
}


lint N, A;
MyUMap< pii, int, PiiHash > dp;

void solve() {
	dp[pii(0, 1)] = 0;
	priority_queue< pii, Vec< pii >, greater< pii > > que; que.push(pii(0, 1));
	
	while (!que.empty()) {
		pii p = que.top(); que.pop();
		
		if (dp[p] >= N) {
			cout << p.first << endl;
			break;
		}
		
		int y = dp[p];
		pii np1(p.first + A, y);
		if (dp.count(np1) == 0) que.push(np1);
		
		pii np0(p.first + 1, p.second);
		if (dp[np0] < p.second + y) {
			dp[np0] = p.second + y;
			que.push(np0);
		}
	}
}


int main() {
	cin >> N >> A;
	if (N <= 1000000 && A <= 1000000) {
		solve();
	}
}




Submission Info

Submission Time
Task E - Cookies
User tsukasa_diary
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2708 Byte
Status
Exec Time 2108 ms
Memory 83260 KB

Judge Result

Set Name Score / Max Score Test Cases
sample 0 / 0 sample-01.txt, sample-02.txt, sample-03.txt
dataset1 0 / 500 sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt
dataset2 0 / 500 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt, 02-17.txt, 02-18.txt, 02-19.txt, 02-20.txt, 02-21.txt, 02-22.txt, 02-23.txt, 02-24.txt, 02-25.txt, 02-26.txt, 02-27.txt, 02-28.txt, 02-29.txt, 02-30.txt, 02-31.txt, 02-32.txt, 02-33.txt, 02-34.txt, 02-35.txt, 02-36.txt, 02-37.txt, 02-38.txt, 02-39.txt, 02-40.txt
Case Name Status Exec Time Memory
01-01.txt 10 ms 1408 KB
01-02.txt 21 ms 2432 KB
01-03.txt 43 ms 3204 KB
01-04.txt 47 ms 3972 KB
01-05.txt 59 ms 5532 KB
01-06.txt 65 ms 6168 KB
01-07.txt 95 ms 10812 KB
01-08.txt 147 ms 15932 KB
01-09.txt 298 ms 32612 KB
01-10.txt 768 ms 83260 KB
01-11.txt 761 ms 83132 KB
01-12.txt 2108 ms 51068 KB
01-13.txt 2108 ms 51580 KB
01-14.txt 12 ms 1024 KB
01-15.txt 8 ms 1024 KB
01-16.txt 16 ms 1792 KB
01-17.txt 91 ms 10812 KB
01-18.txt 3 ms 256 KB
01-19.txt 3 ms 256 KB
01-20.txt 3 ms 256 KB
01-21.txt 3 ms 256 KB
01-22.txt 3 ms 256 KB
01-23.txt 3 ms 256 KB
01-24.txt 3 ms 256 KB
01-25.txt 3 ms 256 KB
01-26.txt 3 ms 256 KB
02-01.txt 3 ms 256 KB
02-02.txt 3 ms 256 KB
02-03.txt 3 ms 256 KB
02-04.txt 3 ms 256 KB
02-05.txt 3 ms 256 KB
02-06.txt 3 ms 256 KB
02-07.txt 3 ms 256 KB
02-08.txt 3 ms 256 KB
02-09.txt 3 ms 256 KB
02-10.txt 3 ms 256 KB
02-11.txt 3 ms 256 KB
02-12.txt 3 ms 256 KB
02-13.txt 3 ms 256 KB
02-14.txt 3 ms 256 KB
02-15.txt 3 ms 256 KB
02-16.txt 3 ms 256 KB
02-17.txt 3 ms 256 KB
02-18.txt 3 ms 256 KB
02-19.txt 3 ms 256 KB
02-20.txt 3 ms 256 KB
02-21.txt 3 ms 256 KB
02-22.txt 3 ms 256 KB
02-23.txt 3 ms 256 KB
02-24.txt 3 ms 256 KB
02-25.txt 3 ms 256 KB
02-26.txt 3 ms 256 KB
02-27.txt 3 ms 256 KB
02-28.txt 3 ms 256 KB
02-29.txt 3 ms 256 KB
02-30.txt 3 ms 256 KB
02-31.txt 3 ms 256 KB
02-32.txt 3 ms 256 KB
02-33.txt 3 ms 256 KB
02-34.txt 3 ms 256 KB
02-35.txt 3 ms 256 KB
02-36.txt 3 ms 256 KB
02-37.txt 3 ms 256 KB
02-38.txt 3 ms 256 KB
02-39.txt 3 ms 256 KB
02-40.txt 3 ms 256 KB
sample-01.txt 3 ms 256 KB
sample-02.txt 3 ms 256 KB
sample-03.txt 25 ms 2952 KB