답안 #966329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966329	2024-04-19T17:36:21 Z	shadow_sami	Toys (CEOI18_toy)	C++17	100 / 100	2167 ms	86632 KB

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
vi v;
vector<set<ll>> vv;

void get(ll x){
	for(ll i = 1 ; i*i <= n ; i++)
		if(n % i == 0){
			v.push_back(i);
			if((n/i)!=i)
				v.push_back(n/i);
		}
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n;
        get(n);
        vv.resize((ll)v.size());
        vv[0].insert(0);
        srt(v);
        fip(0,(ll)v.size()){
        	fjp(0,i){
        		if(v[i]%v[j]==0){
        			fx(vv[j]){
        				vv[i].insert(x-1+(v[i]/v[j]));
        			}
        		}
        	}
        }
        cout<<vv[v.size()-1].size()<<nli;
        // srt(vv);
        fx(vv[v.size()-1])
        	cout<<x<<" ";
        cout<<nli;
        
    // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
19.0 / 19.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	348 KB	Output is correct
21	Correct	348 KB	Output is correct
22	Correct	348 KB	Output is correct
23	Correct	348 KB	Output is correct
24	Correct	348 KB	Output is correct
25	Correct	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	516 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	456 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	2 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	548 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	516 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	456 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	2 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	548 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	2 ms	604 KB	Output is correct
53	Correct	2 ms	604 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	3 ms	604 KB	Output is correct
56	Correct	3 ms	604 KB	Output is correct
57	Correct	3 ms	600 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	344 KB	Output is correct
61	Correct	2 ms	480 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	1 ms	604 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	0 ms	344 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	1 ms	344 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	516 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	456 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	2 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	548 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	2 ms	604 KB	Output is correct
53	Correct	2 ms	604 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	3 ms	604 KB	Output is correct
56	Correct	3 ms	604 KB	Output is correct
57	Correct	3 ms	600 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	344 KB	Output is correct
61	Correct	2 ms	480 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	1 ms	604 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	0 ms	344 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	1 ms	344 KB	Output is correct
71	Correct	287 ms	18748 KB	Output is correct
72	Correct	184 ms	14048 KB	Output is correct
73	Correct	256 ms	16468 KB	Output is correct
74	Correct	150 ms	11344 KB	Output is correct
75	Correct	165 ms	11856 KB	Output is correct
76	Correct	453 ms	24892 KB	Output is correct
77	Correct	418 ms	21992 KB	Output is correct
78	Correct	376 ms	20688 KB	Output is correct
79	Correct	353 ms	20160 KB	Output is correct
80	Correct	0 ms	344 KB	Output is correct
81	Correct	1 ms	348 KB	Output is correct
82	Correct	2 ms	604 KB	Output is correct
83	Correct	35 ms	3620 KB	Output is correct
84	Correct	50 ms	4372 KB	Output is correct
85	Correct	10 ms	1624 KB	Output is correct
86	Correct	1 ms	348 KB	Output is correct
87	Correct	50 ms	5096 KB	Output is correct
88	Correct	1 ms	344 KB	Output is correct
89	Correct	0 ms	344 KB	Output is correct
90	Correct	1 ms	348 KB	Output is correct
91	Correct	13 ms	2084 KB	Output is correct
92	Correct	61 ms	6412 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	516 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	456 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	2 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	548 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	2 ms	604 KB	Output is correct
53	Correct	2 ms	604 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	3 ms	604 KB	Output is correct
56	Correct	3 ms	604 KB	Output is correct
57	Correct	3 ms	600 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	344 KB	Output is correct
61	Correct	2 ms	480 KB	Output is correct
62	Correct	1 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	1 ms	604 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	0 ms	344 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	1 ms	344 KB	Output is correct
71	Correct	287 ms	18748 KB	Output is correct
72	Correct	184 ms	14048 KB	Output is correct
73	Correct	256 ms	16468 KB	Output is correct
74	Correct	150 ms	11344 KB	Output is correct
75	Correct	165 ms	11856 KB	Output is correct
76	Correct	453 ms	24892 KB	Output is correct
77	Correct	418 ms	21992 KB	Output is correct
78	Correct	376 ms	20688 KB	Output is correct
79	Correct	353 ms	20160 KB	Output is correct
80	Correct	0 ms	344 KB	Output is correct
81	Correct	1 ms	348 KB	Output is correct
82	Correct	2 ms	604 KB	Output is correct
83	Correct	35 ms	3620 KB	Output is correct
84	Correct	50 ms	4372 KB	Output is correct
85	Correct	10 ms	1624 KB	Output is correct
86	Correct	1 ms	348 KB	Output is correct
87	Correct	50 ms	5096 KB	Output is correct
88	Correct	1 ms	344 KB	Output is correct
89	Correct	0 ms	344 KB	Output is correct
90	Correct	1 ms	348 KB	Output is correct
91	Correct	13 ms	2084 KB	Output is correct
92	Correct	61 ms	6412 KB	Output is correct
93	Correct	1795 ms	77400 KB	Output is correct
94	Correct	987 ms	52052 KB	Output is correct
95	Correct	1125 ms	54868 KB	Output is correct
96	Correct	994 ms	48812 KB	Output is correct
97	Correct	892 ms	44628 KB	Output is correct
98	Correct	2096 ms	85204 KB	Output is correct
99	Correct	2167 ms	86632 KB	Output is correct
100	Correct	2041 ms	83268 KB	Output is correct
101	Correct	1902 ms	77180 KB	Output is correct
102	Correct	1653 ms	69744 KB	Output is correct
103	Correct	1309 ms	62356 KB	Output is correct
104	Correct	1 ms	348 KB	Output is correct
105	Correct	1 ms	348 KB	Output is correct
106	Correct	4 ms	856 KB	Output is correct
107	Correct	112 ms	9560 KB	Output is correct
108	Correct	322 ms	20372 KB	Output is correct
109	Correct	26 ms	3164 KB	Output is correct
110	Correct	1 ms	344 KB	Output is correct
111	Correct	150 ms	12156 KB	Output is correct
112	Correct	1 ms	348 KB	Output is correct
113	Correct	1 ms	348 KB	Output is correct
114	Correct	4 ms	968 KB	Output is correct
115	Correct	1 ms	348 KB	Output is correct
116	Correct	9 ms	1628 KB	Output is correct
117	Correct	315 ms	24480 KB	Output is correct

답안 #966329

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 21.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
21.0 / 21.0