oj.uz

Submission #22339

# Submission time Handle Problem Language Result Execution time Memory
22339 2017-04-30T04:03:04 Z 최숭실(#962, eldkqmfhf123, youngjeong_yu, choiking10) Fully Generate (KRIII5_FG) C++11
2 / 7
 500 ms 213488 KB 
#include <cstdio>
#include <queue>
#include <set> 
#include <vector>
#include <algorithm>
#include <map>
#define MOD 1000000007

long long pow(long long n, long long k) {
	if (k == 0) return 1;
	if (k == 1) return n%MOD;
	long long ret = pow(n, k / 2);
	ret = ret * ret % MOD;
	if (k & 1) ret = ret * n % MOD;
	return ret;
}
long long count(long long i) {
	if (i & 1) {
		return i / 2 * (i / 2 + 1) + i/2 + 1;
	}
	else {
		return i/2 * (i/2+1);
	}
}
long long dy[2000000];
std::vector<std::pair<long long,long long>> D;
int main() {
	long long n;
	scanf("%lld", &n);
	long long ans = 4;
	long long nu = 3;
	long long i = 0;
	long long pv = 0;
	if (n <= 3) {
		if (n == 1) ans = 1;
		else if (n == 2) ans = 2;
		else if (n == 3) ans = 4;
		printf("%lld\n", ans);
		return 0;
	}
	D.push_back({ 1, 1 });
	D.push_back({ 3, 2 });
	for (i = 3; nu <= n; i++) {
		pv = std::upper_bound(D.begin(), D.end(), 
							std::make_pair( i,0ll) ) - D.begin();
		if (nu + D[pv].second > n) break;
		ans = ans * pow(i, D[pv].second) % MOD;
		nu += D[pv].second;
		D.push_back({ nu, i });
	}
	n -= nu;
	ans = ans * pow(i, n) % MOD;
	printf("%lld\n", ans);
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:29:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
                   ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 16796 KB Output is correct
2 Correct 0 ms 16796 KB Output is correct
3 Correct 0 ms 16796 KB Output is correct
4 Correct 0 ms 16796 KB Output is correct
5 Correct 0 ms 16796 KB Output is correct
6 Correct 0 ms 16796 KB Output is correct
7 Correct 0 ms 16796 KB Output is correct
8 Correct 0 ms 16796 KB Output is correct
9 Correct 0 ms 16796 KB Output is correct
10 Correct 0 ms 16796 KB Output is correct
11 Correct 0 ms 16936 KB Output is correct
12 Correct 0 ms 17068 KB Output is correct
13 Correct 0 ms 17068 KB Output is correct
14 Correct 0 ms 16796 KB Output is correct
15 Correct 0 ms 17068 KB Output is correct
16 Correct 0 ms 17068 KB Output is correct
17 Correct 0 ms 16936 KB Output is correct
18 Correct 0 ms 17068 KB Output is correct
19 Correct 0 ms 16936 KB Output is correct
20 Correct 0 ms 16936 KB Output is correct
21 Correct 0 ms 17068 KB Output is correct
22 Correct 0 ms 16936 KB Output is correct
23 Correct 0 ms 16936 KB Output is correct
24 Correct 0 ms 17068 KB Output is correct
25 Correct 0 ms 16936 KB Output is correct
26 Correct 0 ms 16796 KB Output is correct
27 Correct 0 ms 17068 KB Output is correct
28 Correct 0 ms 16936 KB Output is correct
29 Correct 0 ms 17068 KB Output is correct
30 Correct 0 ms 16936 KB Output is correct
31 Correct 0 ms 17068 KB Output is correct
32 Correct 0 ms 16936 KB Output is correct
33 Correct 0 ms 17068 KB Output is correct
34 Correct 0 ms 16936 KB Output is correct
35 Correct 0 ms 17068 KB Output is correct
36 Correct 0 ms 16936 KB Output is correct
37 Correct 0 ms 16936 KB Output is correct
38 Correct 0 ms 16936 KB Output is correct
39 Correct 0 ms 17068 KB Output is correct
40 Correct 0 ms 17068 KB Output is correct
41 Correct 0 ms 16936 KB Output is correct
42 Correct 0 ms 17068 KB Output is correct
43 Correct 0 ms 16936 KB Output is correct
44 Correct 0 ms 17068 KB Output is correct
45 Correct 0 ms 16936 KB Output is correct
46 Correct 0 ms 17068 KB Output is correct
47 Correct 0 ms 16936 KB Output is correct
48 Correct 0 ms 17068 KB Output is correct
49 Correct 0 ms 16936 KB Output is correct
50 Correct 0 ms 17068 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 16796 KB Output is correct
2 Correct 0 ms 16796 KB Output is correct
3 Correct 0 ms 16796 KB Output is correct
4 Correct 0 ms 16796 KB Output is correct
5 Correct 0 ms 16796 KB Output is correct
6 Correct 0 ms 16796 KB Output is correct
7 Correct 0 ms 16796 KB Output is correct
8 Correct 0 ms 16796 KB Output is correct
9 Correct 0 ms 16796 KB Output is correct
10 Correct 0 ms 16796 KB Output is correct
11 Correct 0 ms 16936 KB Output is correct
12 Correct 0 ms 17068 KB Output is correct
13 Correct 0 ms 17068 KB Output is correct
14 Correct 0 ms 16796 KB Output is correct
15 Correct 0 ms 17068 KB Output is correct
16 Correct 0 ms 17068 KB Output is correct
17 Correct 0 ms 16936 KB Output is correct
18 Correct 0 ms 17068 KB Output is correct
19 Correct 0 ms 16936 KB Output is correct
20 Correct 0 ms 16936 KB Output is correct
21 Correct 0 ms 17068 KB Output is correct
22 Correct 0 ms 16936 KB Output is correct
23 Correct 0 ms 16936 KB Output is correct
24 Correct 0 ms 17068 KB Output is correct
25 Correct 0 ms 16936 KB Output is correct
26 Correct 0 ms 16796 KB Output is correct
27 Correct 0 ms 17068 KB Output is correct
28 Correct 0 ms 16936 KB Output is correct
29 Correct 0 ms 17068 KB Output is correct
30 Correct 0 ms 16936 KB Output is correct
31 Correct 0 ms 17068 KB Output is correct
32 Correct 0 ms 16936 KB Output is correct
33 Correct 0 ms 17068 KB Output is correct
34 Correct 0 ms 16936 KB Output is correct
35 Correct 0 ms 17068 KB Output is correct
36 Correct 0 ms 16936 KB Output is correct
37 Correct 0 ms 16936 KB Output is correct
38 Correct 0 ms 16936 KB Output is correct
39 Correct 0 ms 17068 KB Output is correct
40 Correct 0 ms 17068 KB Output is correct
41 Correct 0 ms 16936 KB Output is correct
42 Correct 0 ms 17068 KB Output is correct
43 Correct 0 ms 16936 KB Output is correct
44 Correct 0 ms 17068 KB Output is correct
45 Correct 0 ms 16936 KB Output is correct
46 Correct 0 ms 17068 KB Output is correct
47 Correct 0 ms 16936 KB Output is correct
48 Correct 0 ms 17068 KB Output is correct
49 Correct 0 ms 16936 KB Output is correct
50 Correct 0 ms 17068 KB Output is correct
51 Execution timed out 500 ms 213488 KB Execution timed out
52 Halted 0 ms 0 KB -