Submission #22336

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
22336	2017-04-30T04:01:15 Z	크리님 제가 귀여우면 됬지 뭘 더 원하세요 진짜(#952, sys7961, hyorothy, skdudn321)	Fully Generate (KRIII5_FG)	C++14	7 / 7	316 ms	394472 KB

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<list>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<functional>
#include<cmath>
#include<string>

#define sd(a) scanf("%d", &a);
#define sld(a) scanf("%lld", &a);
#define MOD 1000000007

using namespace std;

typedef long long int lli;
typedef pair<int, int> ii;

lli N;
lli cal(lli A, lli B) {
	lli ret = 1;
	while (B != 0) {
		if (B % 2 == 0) {
			A *= A;
			A %= MOD;
			B /= 2;
		}
		else {
			ret *= A;
			ret %= MOD;
			B--;
		}
	}

	return ret;
}
vector<lli> ve;

int main(void) {
	sld(N);
	ve.push_back(0);
	ve.push_back(1);
	ve.push_back(2);
	ve.push_back(2);

	if (N == 1) {
		printf("1");
		return 0;
	}
	else if (N == 2) {
		printf("2");
		return 0;
	}
	else if (N == 3) {
		printf("4");
		return 0;
	}
	else if (N == 4) {
		printf("12");
		return 0;
	}
	else if (N == 5) {
		printf("36");
		return 0;
	}

	lli ind = 3;
	lli cur = ve[ind];
	lli hap = 5;
	lli ans = 36;
	lli val = 1;
	for (int i = 4; ; i++) {
		if (cur == 0) {
			ans *= cal(val, ind);
			ans %= MOD;
			val = 1;
			ind++;
			cur = ve[ind];
		}
		if (hap + ind >= N) {
			ans *= cal(val, ind);
			ans %= MOD;
			break;
		}
		val *= ve.size();
		val %= MOD;
		ve.push_back(ind);
		hap += ind;
		cur--;
	}
	ans *= cal(ve.size(), N - hap);
	ans %= MOD;

	printf("%lld", ans);

	return 0;
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:17:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sld(a) scanf("%lld", &a);
                                 ^
FG.cpp:46:2: note: in expansion of macro 'sld'
  sld(N);
  ^

Subtask #1
2.0 / 2.0

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

Subtask #2
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1172 KB	Output is correct
2	Correct	0 ms	1172 KB	Output is correct
3	Correct	0 ms	1172 KB	Output is correct
4	Correct	0 ms	1172 KB	Output is correct
5	Correct	0 ms	1172 KB	Output is correct
6	Correct	0 ms	1172 KB	Output is correct
7	Correct	0 ms	1172 KB	Output is correct
8	Correct	0 ms	1172 KB	Output is correct
9	Correct	0 ms	1172 KB	Output is correct
10	Correct	0 ms	1172 KB	Output is correct
11	Correct	0 ms	1172 KB	Output is correct
12	Correct	0 ms	1312 KB	Output is correct
13	Correct	0 ms	1312 KB	Output is correct
14	Correct	0 ms	1172 KB	Output is correct
15	Correct	0 ms	1312 KB	Output is correct
16	Correct	0 ms	1312 KB	Output is correct
17	Correct	0 ms	1312 KB	Output is correct
18	Correct	0 ms	1312 KB	Output is correct
19	Correct	0 ms	1172 KB	Output is correct
20	Correct	0 ms	1312 KB	Output is correct
21	Correct	0 ms	1312 KB	Output is correct
22	Correct	0 ms	1312 KB	Output is correct
23	Correct	0 ms	1172 KB	Output is correct
24	Correct	0 ms	1312 KB	Output is correct
25	Correct	0 ms	1312 KB	Output is correct
26	Correct	0 ms	1172 KB	Output is correct
27	Correct	0 ms	1312 KB	Output is correct
28	Correct	0 ms	1312 KB	Output is correct
29	Correct	0 ms	1312 KB	Output is correct
30	Correct	0 ms	1312 KB	Output is correct
31	Correct	0 ms	1312 KB	Output is correct
32	Correct	0 ms	1172 KB	Output is correct
33	Correct	0 ms	1312 KB	Output is correct
34	Correct	0 ms	1312 KB	Output is correct
35	Correct	0 ms	1312 KB	Output is correct
36	Correct	0 ms	1312 KB	Output is correct
37	Correct	0 ms	1172 KB	Output is correct
38	Correct	0 ms	1312 KB	Output is correct
39	Correct	0 ms	1312 KB	Output is correct
40	Correct	0 ms	1312 KB	Output is correct
41	Correct	0 ms	1172 KB	Output is correct
42	Correct	0 ms	1312 KB	Output is correct
43	Correct	0 ms	1172 KB	Output is correct
44	Correct	0 ms	1312 KB	Output is correct
45	Correct	0 ms	1312 KB	Output is correct
46	Correct	0 ms	1312 KB	Output is correct
47	Correct	0 ms	1312 KB	Output is correct
48	Correct	0 ms	1312 KB	Output is correct
49	Correct	0 ms	1312 KB	Output is correct
50	Correct	0 ms	1312 KB	Output is correct
51	Correct	286 ms	394472 KB	Output is correct
52	Correct	316 ms	394472 KB	Output is correct
53	Correct	243 ms	394472 KB	Output is correct
54	Correct	256 ms	394472 KB	Output is correct
55	Correct	256 ms	394472 KB	Output is correct
56	Correct	259 ms	394472 KB	Output is correct
57	Correct	279 ms	394472 KB	Output is correct
58	Correct	276 ms	394472 KB	Output is correct
59	Correct	289 ms	394472 KB	Output is correct
60	Correct	263 ms	394472 KB	Output is correct
61	Correct	273 ms	394472 KB	Output is correct
62	Correct	279 ms	394472 KB	Output is correct
63	Correct	283 ms	394472 KB	Output is correct
64	Correct	269 ms	394472 KB	Output is correct
65	Correct	253 ms	394472 KB	Output is correct
66	Correct	266 ms	394472 KB	Output is correct
67	Correct	299 ms	394472 KB	Output is correct
68	Correct	293 ms	394472 KB	Output is correct
69	Correct	266 ms	394472 KB	Output is correct
70	Correct	263 ms	394472 KB	Output is correct
71	Correct	179 ms	394472 KB	Output is correct
72	Correct	206 ms	394472 KB	Output is correct
73	Correct	219 ms	394472 KB	Output is correct
74	Correct	236 ms	394472 KB	Output is correct
75	Correct	243 ms	394472 KB	Output is correct
76	Correct	229 ms	394472 KB	Output is correct
77	Correct	236 ms	394472 KB	Output is correct
78	Correct	253 ms	394472 KB	Output is correct
79	Correct	243 ms	394472 KB	Output is correct
80	Correct	269 ms	394472 KB	Output is correct
81	Correct	219 ms	394472 KB	Output is correct
82	Correct	256 ms	394472 KB	Output is correct
83	Correct	276 ms	394472 KB	Output is correct
84	Correct	93 ms	197864 KB	Output is correct
85	Correct	89 ms	197864 KB	Output is correct
86	Correct	96 ms	197864 KB	Output is correct
87	Correct	119 ms	197864 KB	Output is correct
88	Correct	146 ms	197864 KB	Output is correct
89	Correct	123 ms	197864 KB	Output is correct
90	Correct	156 ms	394472 KB	Output is correct
91	Correct	186 ms	394472 KB	Output is correct
92	Correct	193 ms	394472 KB	Output is correct
93	Correct	226 ms	394472 KB	Output is correct
94	Correct	229 ms	394472 KB	Output is correct
95	Correct	203 ms	394472 KB	Output is correct
96	Correct	63 ms	99560 KB	Output is correct
97	Correct	53 ms	99560 KB	Output is correct
98	Correct	73 ms	99560 KB	Output is correct
99	Correct	56 ms	99560 KB	Output is correct
100	Correct	66 ms	99560 KB	Output is correct
101	Correct	36 ms	50408 KB	Output is correct
102	Correct	43 ms	99560 KB	Output is correct
103	Correct	46 ms	50408 KB	Output is correct
104	Correct	69 ms	99560 KB	Output is correct
105	Correct	26 ms	50408 KB	Output is correct
106	Correct	56 ms	99560 KB	Output is correct
107	Correct	19 ms	50408 KB	Output is correct
108	Correct	46 ms	99560 KB	Output is correct
109	Correct	13 ms	25832 KB	Output is correct
110	Correct	66 ms	99560 KB	Output is correct
111	Correct	0 ms	1444 KB	Output is correct
112	Correct	0 ms	1444 KB	Output is correct
113	Correct	0 ms	1444 KB	Output is correct
114	Correct	0 ms	1444 KB	Output is correct
115	Correct	0 ms	1444 KB	Output is correct
116	Correct	0 ms	1444 KB	Output is correct
117	Correct	0 ms	1444 KB	Output is correct
118	Correct	0 ms	1444 KB	Output is correct
119	Correct	0 ms	1444 KB	Output is correct
120	Correct	0 ms	1444 KB	Output is correct

Submission #22336

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 5.0 / 5.0

Subtask #1
2.0 / 2.0

Subtask #2
5.0 / 5.0