CODE FESTIVAL 2016 Final

Submission #5394630

Source codeソースコード

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
	if(c == '-') f = -1;
	c = getchar();
    }
    while(c >= '0' && c <= '9') {
	res = res * 10 +c - '0';
	c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
	out(x / 10);
    }
    putchar('0' + x % 10);
}
int64 N,A;
map<int64,int64> zz;
int64 f(int64 x) {
    if(x == 1) return 0;
    if(zz.count(x)) return zz[x];
    int64 res = x + A;
    for(int64 i = 2 ; i <= x / i ; ++i) {
	if(x % i == 0) {
	    res = min(res,f(i) + (N / i - 1) + A);
	    int64 j = x / i;
	    if(j != i) {
		res = min(res,f(j) + (N / j - 1) + A);
	    }
	}
    }
    zz[x] = res;return res;
}
void Solve() {
    read(N);read(A);
    int64 ans = N;
    for(int64 i = 1 ; i <= N / i ; ++i) {
	if(N % i == 0) {
	    ans = min(ans,f(i) + (N / i));
	    int64 j = N / i;
	    if(j != i) ans = min(ans,f(j) + (N / j));
	}
    }
    out(ans);enter;
}
int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

Submission

Task問題 E - Cookies
User nameユーザ名 sigongzi
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 1503 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
sample - 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,sample-01.txt,sample-02.txt,sample-03.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt WA
01-02.txt WA
01-03.txt WA
01-04.txt WA
01-05.txt WA
01-06.txt WA
01-07.txt WA
01-08.txt WA
01-09.txt WA
01-10.txt WA
01-11.txt WA
01-12.txt AC 1 ms 256 KB
01-13.txt AC 1 ms 256 KB
01-14.txt WA
01-15.txt WA
01-16.txt WA
01-17.txt WA
01-18.txt AC 1 ms 256 KB
01-19.txt WA
01-20.txt AC 1 ms 256 KB
01-21.txt AC 1 ms 256 KB
01-22.txt AC 1 ms 256 KB
01-23.txt AC 1 ms 256 KB
01-24.txt AC 1 ms 256 KB
01-25.txt AC 1 ms 256 KB
01-26.txt AC 1 ms 256 KB
02-01.txt AC 1 ms 256 KB
02-02.txt WA
02-03.txt WA
02-04.txt WA
02-05.txt WA
02-06.txt WA
02-07.txt WA
02-08.txt WA
02-09.txt WA
02-10.txt WA
02-11.txt WA
02-12.txt WA
02-13.txt WA
02-14.txt WA
02-15.txt WA
02-16.txt WA
02-17.txt WA
02-18.txt WA
02-19.txt WA
02-20.txt WA
02-21.txt WA
02-22.txt AC 131 ms 256 KB
02-23.txt AC 131 ms 256 KB
02-24.txt AC 131 ms 256 KB
02-25.txt WA
02-26.txt WA
02-27.txt WA
02-28.txt WA
02-29.txt WA
02-30.txt WA
02-31.txt WA
02-32.txt WA
02-33.txt WA
02-34.txt WA
02-35.txt WA
02-36.txt WA
02-37.txt WA
02-38.txt WA
02-39.txt WA
02-40.txt WA
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 131 ms 384 KB
sample-03.txt WA