Submission #267117

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
267117	2020-08-15T20:51:11 Z	peuch	Toys (CEOI18_toy)	C++17	79 / 100	5000 ms	7896 KB

#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")


const int MAXN = 2e4;
 
int n;
int cnt;
int v[MAXN], qnt[MAXN];
 
vector<int> ans;
map<int, vector<int> > dp, divisor;
 
void getDiv(int num);
void calcDP(int num);
 
int main(){
	scanf("%d", &n);
	calcDP(n);
	sort(ans.begin(), ans.end());
	printf("%lu\n", ans.size());
	for(int i = 0; i < ans.size(); i++)
		printf("%d ", ans[i]);
	printf("\n");
}
 
void getDiv(int num){
	if(!divisor[num].empty()) return;
	if(num == 1){
		divisor[num].push_back(1);
		return;
	}
	map<int, bool> marc;
	for(int i = sqrt(num); i > 1; i--){
		if(num == i) continue;
		if(num % i) continue;
		if(divisor[i].empty() || divisor[num / i].empty()) continue;
		getDiv(i);
		getDiv(num / i);
		for(int j = 0; j < divisor[i].size(); j++){
			for(int k = 0; k < divisor[num / i].size(); k++){
				int val = divisor[i][j] * divisor[num / i][k];
				if(marc[val]) continue;
				marc[val] = 1;
				divisor[num].push_back(val);
			}
		}
		return;
	}
	for(int i = sqrt(num); i > 1; i--){
		if(num == i) continue;
		if(num % i) continue;
		if(divisor[i].empty() && divisor[num / i].empty()) continue;
		getDiv(i);
		getDiv(num / i);
		for(int j = 0; j < divisor[i].size(); j++){
			for(int k = 0; k < divisor[num / i].size(); k++){
				int val = divisor[i][j] * divisor[num / i][k];
				if(marc[val]) continue;
				marc[val] = 1;
				divisor[num].push_back(val);
			}
		}
		return;
	}
	for(int i = sqrt(num); i > 1; i--){
		if(num == i) continue;
		if(num % i) continue;
		getDiv(i);
		getDiv(num / i);
		for(int j = 0; j < divisor[i].size(); j++){
			for(int k = 0; k < divisor[num / i].size(); k++){
				int val = divisor[i][j] * divisor[num / i][k];
				if(marc[val]) continue;
				marc[val] = 1;
				divisor[num].push_back(val);
			}
		}
		return;
	}
	divisor[num].push_back(1);
	divisor[num].push_back(num);
}
 
void calcDP(int num){
	if(!dp[num].empty()){
		ans = dp[num];
		return;
	}
	getDiv(num);
	vector<int> aux = divisor[num];
	vector<int> ret;
	ret.push_back(num - 1);
	vector<int> aux1, aux2;
	map<int, bool> marc;
	for(int i = 0; i < aux.size(); i++){
		if(aux[i] == num || aux[i] == 1) continue;
		if(num / aux[i] < aux[i]) continue;
		calcDP(aux[i]);
		aux1 = ans;
		calcDP(num / aux[i]);
		aux2 = ans;
		for(int i1 = 0; i1 < aux1.size(); i1++){
			for( int i2 = 0; i2 < aux2.size(); i2++){
				if(marc[aux1[i1] + aux2[i2]]) continue;
				ret.push_back(aux1[i1] + aux2[i2]);
				marc[aux1[i1] + aux2[i2]] = 1;
			}
		}
	}
	ans = ret;
	dp[num] = ans;
}

Compilation message

toy.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
toy.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
toy.cpp: In function 'int main()':
toy.cpp:25:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |  for(int i = 0; i < ans.size(); i++)
      |                 ~~^~~~~~~~~~~~
toy.cpp: In function 'void getDiv(int)':
toy.cpp:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |   for(int j = 0; j < divisor[i].size(); j++){
      |                  ~~^~~~~~~~~~~~~~~~~~~
toy.cpp:44:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |    for(int k = 0; k < divisor[num / i].size(); k++){
      |                   ~~^~~~~~~~~~~~~~~~~~~~~~~~~
toy.cpp:59:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for(int j = 0; j < divisor[i].size(); j++){
      |                  ~~^~~~~~~~~~~~~~~~~~~
toy.cpp:60:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |    for(int k = 0; k < divisor[num / i].size(); k++){
      |                   ~~^~~~~~~~~~~~~~~~~~~~~~~~~
toy.cpp:74:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for(int j = 0; j < divisor[i].size(); j++){
      |                  ~~^~~~~~~~~~~~~~~~~~~
toy.cpp:75:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |    for(int k = 0; k < divisor[num / i].size(); k++){
      |                   ~~^~~~~~~~~~~~~~~~~~~~~~~~~
toy.cpp: In function 'void calcDP(int)':
toy.cpp:99:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |  for(int i = 0; i < aux.size(); i++){
      |                 ~~^~~~~~~~~~~~
toy.cpp:106:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |   for(int i1 = 0; i1 < aux1.size(); i1++){
      |                   ~~~^~~~~~~~~~~~~
toy.cpp:107:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |    for( int i2 = 0; i2 < aux2.size(); i2++){
      |                     ~~~^~~~~~~~~~~~~
toy.cpp: In function 'int main()':
toy.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~

Subtask #1
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	288 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	288 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	5 ms	416 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	0 ms	384 KB	Output is correct
42	Correct	1 ms	256 KB	Output is correct
43	Correct	1 ms	384 KB	Output is correct
44	Correct	1 ms	256 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	1 ms	384 KB	Output is correct
48	Correct	1 ms	384 KB	Output is correct
49	Correct	1 ms	384 KB	Output is correct
50	Correct	7 ms	492 KB	Output is correct
51	Correct	6 ms	384 KB	Output is correct
52	Correct	6 ms	384 KB	Output is correct
53	Correct	5 ms	384 KB	Output is correct
54	Correct	3 ms	384 KB	Output is correct
55	Correct	10 ms	512 KB	Output is correct
56	Correct	10 ms	512 KB	Output is correct
57	Correct	8 ms	512 KB	Output is correct
58	Correct	1 ms	384 KB	Output is correct
59	Correct	1 ms	256 KB	Output is correct
60	Correct	1 ms	384 KB	Output is correct
61	Correct	11 ms	384 KB	Output is correct
62	Correct	3 ms	384 KB	Output is correct
63	Correct	2 ms	384 KB	Output is correct
64	Correct	1 ms	384 KB	Output is correct
65	Correct	5 ms	384 KB	Output is correct
66	Correct	1 ms	256 KB	Output is correct
67	Correct	1 ms	256 KB	Output is correct
68	Correct	1 ms	384 KB	Output is correct
69	Correct	1 ms	384 KB	Output is correct
70	Correct	2 ms	384 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	288 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	5 ms	416 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	0 ms	384 KB	Output is correct
42	Correct	1 ms	256 KB	Output is correct
43	Correct	1 ms	384 KB	Output is correct
44	Correct	1 ms	256 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	1 ms	384 KB	Output is correct
48	Correct	1 ms	384 KB	Output is correct
49	Correct	1 ms	384 KB	Output is correct
50	Correct	7 ms	492 KB	Output is correct
51	Correct	6 ms	384 KB	Output is correct
52	Correct	6 ms	384 KB	Output is correct
53	Correct	5 ms	384 KB	Output is correct
54	Correct	3 ms	384 KB	Output is correct
55	Correct	10 ms	512 KB	Output is correct
56	Correct	10 ms	512 KB	Output is correct
57	Correct	8 ms	512 KB	Output is correct
58	Correct	1 ms	384 KB	Output is correct
59	Correct	1 ms	256 KB	Output is correct
60	Correct	1 ms	384 KB	Output is correct
61	Correct	11 ms	384 KB	Output is correct
62	Correct	3 ms	384 KB	Output is correct
63	Correct	2 ms	384 KB	Output is correct
64	Correct	1 ms	384 KB	Output is correct
65	Correct	5 ms	384 KB	Output is correct
66	Correct	1 ms	256 KB	Output is correct
67	Correct	1 ms	256 KB	Output is correct
68	Correct	1 ms	384 KB	Output is correct
69	Correct	1 ms	384 KB	Output is correct
70	Correct	2 ms	384 KB	Output is correct
71	Correct	1938 ms	4388 KB	Output is correct
72	Correct	1033 ms	3496 KB	Output is correct
73	Correct	1995 ms	3940 KB	Output is correct
74	Correct	789 ms	2808 KB	Output is correct
75	Correct	1047 ms	3192 KB	Output is correct
76	Correct	3910 ms	5280 KB	Output is correct
77	Correct	4383 ms	5248 KB	Output is correct
78	Correct	3024 ms	4548 KB	Output is correct
79	Correct	3148 ms	4640 KB	Output is correct
80	Correct	1 ms	256 KB	Output is correct
81	Correct	1 ms	256 KB	Output is correct
82	Correct	16 ms	384 KB	Output is correct
83	Correct	375 ms	1264 KB	Output is correct
84	Correct	338 ms	1620 KB	Output is correct
85	Correct	54 ms	760 KB	Output is correct
86	Correct	1 ms	384 KB	Output is correct
87	Correct	383 ms	1600 KB	Output is correct
88	Correct	1 ms	384 KB	Output is correct
89	Correct	1 ms	256 KB	Output is correct
90	Correct	1 ms	384 KB	Output is correct
91	Correct	45 ms	1016 KB	Output is correct
92	Correct	239 ms	2168 KB	Output is correct

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	288 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct
34	Correct	1 ms	256 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	5 ms	416 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	0 ms	384 KB	Output is correct
42	Correct	1 ms	256 KB	Output is correct
43	Correct	1 ms	384 KB	Output is correct
44	Correct	1 ms	256 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	0 ms	384 KB	Output is correct
47	Correct	1 ms	384 KB	Output is correct
48	Correct	1 ms	384 KB	Output is correct
49	Correct	1 ms	384 KB	Output is correct
50	Correct	7 ms	492 KB	Output is correct
51	Correct	6 ms	384 KB	Output is correct
52	Correct	6 ms	384 KB	Output is correct
53	Correct	5 ms	384 KB	Output is correct
54	Correct	3 ms	384 KB	Output is correct
55	Correct	10 ms	512 KB	Output is correct
56	Correct	10 ms	512 KB	Output is correct
57	Correct	8 ms	512 KB	Output is correct
58	Correct	1 ms	384 KB	Output is correct
59	Correct	1 ms	256 KB	Output is correct
60	Correct	1 ms	384 KB	Output is correct
61	Correct	11 ms	384 KB	Output is correct
62	Correct	3 ms	384 KB	Output is correct
63	Correct	2 ms	384 KB	Output is correct
64	Correct	1 ms	384 KB	Output is correct
65	Correct	5 ms	384 KB	Output is correct
66	Correct	1 ms	256 KB	Output is correct
67	Correct	1 ms	256 KB	Output is correct
68	Correct	1 ms	384 KB	Output is correct
69	Correct	1 ms	384 KB	Output is correct
70	Correct	2 ms	384 KB	Output is correct
71	Correct	1938 ms	4388 KB	Output is correct
72	Correct	1033 ms	3496 KB	Output is correct
73	Correct	1995 ms	3940 KB	Output is correct
74	Correct	789 ms	2808 KB	Output is correct
75	Correct	1047 ms	3192 KB	Output is correct
76	Correct	3910 ms	5280 KB	Output is correct
77	Correct	4383 ms	5248 KB	Output is correct
78	Correct	3024 ms	4548 KB	Output is correct
79	Correct	3148 ms	4640 KB	Output is correct
80	Correct	1 ms	256 KB	Output is correct
81	Correct	1 ms	256 KB	Output is correct
82	Correct	16 ms	384 KB	Output is correct
83	Correct	375 ms	1264 KB	Output is correct
84	Correct	338 ms	1620 KB	Output is correct
85	Correct	54 ms	760 KB	Output is correct
86	Correct	1 ms	384 KB	Output is correct
87	Correct	383 ms	1600 KB	Output is correct
88	Correct	1 ms	384 KB	Output is correct
89	Correct	1 ms	256 KB	Output is correct
90	Correct	1 ms	384 KB	Output is correct
91	Correct	45 ms	1016 KB	Output is correct
92	Correct	239 ms	2168 KB	Output is correct
93	Execution timed out	5075 ms	7896 KB	Time limit exceeded
94	Halted	0 ms	0 KB	-

Submission #267117

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 20.0 / 20.0

Subtask #5 0 / 21.0

Subtask #1
19.0 / 19.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
20.0 / 20.0

Subtask #5
0 / 21.0