Submission #814201

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
814201	2023-08-08T06:17:31 Z	MohamedAhmed04	Group Photo (JOI21_ho_t3)	C++14	100 / 100	3436 ms	764 KB

Main

#include <bits/stdc++.h>

using namespace std ;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds ;

template<class T> using ordered_set = tree<T , null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update> ;

const int MAX = 5000 + 10 ;

int arr[MAX] ;
int n ;

int pos[MAX] , cnt[MAX] ;
int dp[MAX] ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 1 ; i <= n ; ++i)
		cin>>arr[i] ;
	ordered_set<int>s ;
	for(int i = 1 ; i <= n ; ++i)
	{
		pos[arr[i]] = i ;
		cnt[i] = s.size() - s.order_of_key(arr[i]) ;
		s.insert(arr[i]) ;
	}
	for(int i = n ; i >= 1 ; --i)
	{
		s.clear() ;
		dp[i] = 1e9 ;
		int inv = 0 ;
		for(int j = i ; j <= n ; ++j)
		{
			inv += cnt[j] ;
			inv += s.order_of_key(pos[j]) ;
			inv -= s.size() - s.order_of_key(pos[j]) ;
			dp[i] = min(dp[i] , dp[j+1] + inv) ;
			s.insert(pos[j]) ;
		}
	}
	return cout<<dp[1]<<"\n" , 0 ;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	328 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	228 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	328 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	228 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	292 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct

Subtask #3
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	328 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	228 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	292 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	3 ms	352 KB	Output is correct
22	Correct	4 ms	340 KB	Output is correct
23	Correct	4 ms	340 KB	Output is correct
24	Correct	3 ms	340 KB	Output is correct
25	Correct	4 ms	340 KB	Output is correct
26	Correct	4 ms	340 KB	Output is correct
27	Correct	4 ms	340 KB	Output is correct
28	Correct	3 ms	340 KB	Output is correct
29	Correct	3 ms	340 KB	Output is correct
30	Correct	4 ms	340 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	328 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	228 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	292 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	3 ms	352 KB	Output is correct
22	Correct	4 ms	340 KB	Output is correct
23	Correct	4 ms	340 KB	Output is correct
24	Correct	3 ms	340 KB	Output is correct
25	Correct	4 ms	340 KB	Output is correct
26	Correct	4 ms	340 KB	Output is correct
27	Correct	4 ms	340 KB	Output is correct
28	Correct	3 ms	340 KB	Output is correct
29	Correct	3 ms	340 KB	Output is correct
30	Correct	4 ms	340 KB	Output is correct
31	Correct	62 ms	340 KB	Output is correct
32	Correct	62 ms	372 KB	Output is correct
33	Correct	62 ms	340 KB	Output is correct
34	Correct	63 ms	364 KB	Output is correct
35	Correct	62 ms	368 KB	Output is correct
36	Correct	62 ms	364 KB	Output is correct
37	Correct	62 ms	372 KB	Output is correct
38	Correct	62 ms	332 KB	Output is correct
39	Correct	62 ms	368 KB	Output is correct
40	Correct	63 ms	368 KB	Output is correct

Subtask #5
36.0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	328 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	228 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	292 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	3 ms	352 KB	Output is correct
22	Correct	4 ms	340 KB	Output is correct
23	Correct	4 ms	340 KB	Output is correct
24	Correct	3 ms	340 KB	Output is correct
25	Correct	4 ms	340 KB	Output is correct
26	Correct	4 ms	340 KB	Output is correct
27	Correct	4 ms	340 KB	Output is correct
28	Correct	3 ms	340 KB	Output is correct
29	Correct	3 ms	340 KB	Output is correct
30	Correct	4 ms	340 KB	Output is correct
31	Correct	62 ms	340 KB	Output is correct
32	Correct	62 ms	372 KB	Output is correct
33	Correct	62 ms	340 KB	Output is correct
34	Correct	63 ms	364 KB	Output is correct
35	Correct	62 ms	368 KB	Output is correct
36	Correct	62 ms	364 KB	Output is correct
37	Correct	62 ms	372 KB	Output is correct
38	Correct	62 ms	332 KB	Output is correct
39	Correct	62 ms	368 KB	Output is correct
40	Correct	63 ms	368 KB	Output is correct
41	Correct	3420 ms	644 KB	Output is correct
42	Correct	3270 ms	632 KB	Output is correct
43	Correct	3275 ms	636 KB	Output is correct
44	Correct	3289 ms	636 KB	Output is correct
45	Correct	3302 ms	716 KB	Output is correct
46	Correct	3304 ms	640 KB	Output is correct
47	Correct	3357 ms	640 KB	Output is correct
48	Correct	3277 ms	628 KB	Output is correct
49	Correct	3299 ms	636 KB	Output is correct
50	Correct	3293 ms	640 KB	Output is correct
51	Correct	3397 ms	764 KB	Output is correct
52	Correct	3363 ms	644 KB	Output is correct
53	Correct	3297 ms	636 KB	Output is correct
54	Correct	3436 ms	624 KB	Output is correct
55	Correct	3341 ms	764 KB	Output is correct

Submission #814201

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 20.0 / 20.0

Subtask #5 36.0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
20.0 / 20.0

Subtask #5
36.0 / 36.0