Submission #994706


Source Code Expand

#include <climits>
#include <iostream>
using namespace std;

int main(void)
{
    long long int N, A;
    cin >> N >> A;

    long long int dp[40];
    dp[0] = 0;

    for (long long int i = 1; i < 40; i++) {
        dp[i] = LONG_MAX;
        for (int j = 0; j < i; j++)
            dp[i] = min(dp[i], dp[j] + (1L << (i - j)) + A);
        //cout << i << " " << dp[i] << endl;
    }

    long long int res = LONG_MAX, cnt;
    for (long long int i = 0; i < 40; i++) {
        cnt = dp[i] + N / (1L << i);
        //cout << i << " " << cnt << endl;
        res = min(res, cnt);
    }

    cout << res << endl;
    return 0;
}

Submission Info

Submission Time
Task A - Where's Snuke?
User hiromu
Language C++14 (GCC 5.4.1)
Score 0
Code Size 654 Byte
Status WA
Exec Time 3 ms
Memory 256 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 100
Status
WA × 2
WA × 9
Set Name Test Cases
sample sample-01.txt, sample-02.txt
all sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt
Case Name Status Exec Time Memory
01-01.txt WA 2 ms 256 KB
01-02.txt WA 3 ms 256 KB
01-03.txt WA 3 ms 256 KB
01-04.txt WA 3 ms 256 KB
01-05.txt WA 3 ms 256 KB
01-06.txt WA 3 ms 256 KB
01-07.txt WA 3 ms 256 KB
sample-01.txt WA 3 ms 256 KB
sample-02.txt WA 3 ms 256 KB