Submission #916738

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
916738	2024-01-26T12:36:14 Z	NintsiChkhaidze	Group Photo (JOI21_ho_t3)	C++17	44 / 100	5000 ms	548 KB

Main

#include <bits/stdc++.h>
#define ll long long
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define left (h<<1),l,(l + r)/2
#define right ((h<<1)|1),(l + r)/2 + 1,r
#define int ll 
using namespace std;

const int N = 5e3 + 3,inf = 1e18;

int a[N],dp[N],id[N],b[N];

signed main() {
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);

	int n;
	cin>>n;

	for (int i = 1; i <= n; i++)
		cin >> a[i],dp[i] = inf,id[a[i]] = i;

	//neli  

	for (int i = 1; i <= n; i++){
		
		for (int k = 1; k <= i; k++){
			int cost = 0;

			for (int j = 1; j <= n; j++)
				if (a[j] > i) b[j] = 1;
				else b[j] = 0;

			//marcxniv ramdenia i-ze meti
			for (int j = i; j >= i - k + 1; j--)
				for (int w = 1; w <= id[j]; w++)
					cost += b[w];
			
			//anti inverse ebis raodenoba [i - k + 1, i] shualedshi
			for (int j = 1; j <= n; j++)
				b[j] = 0;

			for (int j = i; j >= i - k + 1; j--){
				b[id[j]] = 1;
				for (int w = id[j] + 1; w <= n; w++)
					cost += b[w];
			}
			dp[i] = min(dp[i],dp[i - k] + cost);
		}
	}

	cout<<dp[n];
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 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	1 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	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct

Subtask #3
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 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	1 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	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	119 ms	452 KB	Output is correct
22	Correct	121 ms	452 KB	Output is correct
23	Correct	121 ms	348 KB	Output is correct
24	Correct	130 ms	348 KB	Output is correct
25	Correct	126 ms	456 KB	Output is correct
26	Correct	133 ms	548 KB	Output is correct
27	Correct	125 ms	448 KB	Output is correct
28	Correct	124 ms	348 KB	Output is correct
29	Correct	124 ms	344 KB	Output is correct
30	Correct	124 ms	452 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 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	1 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	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	119 ms	452 KB	Output is correct
22	Correct	121 ms	452 KB	Output is correct
23	Correct	121 ms	348 KB	Output is correct
24	Correct	130 ms	348 KB	Output is correct
25	Correct	126 ms	456 KB	Output is correct
26	Correct	133 ms	548 KB	Output is correct
27	Correct	125 ms	448 KB	Output is correct
28	Correct	124 ms	348 KB	Output is correct
29	Correct	124 ms	344 KB	Output is correct
30	Correct	124 ms	452 KB	Output is correct
31	Execution timed out	5026 ms	344 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 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	1 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	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	119 ms	452 KB	Output is correct
22	Correct	121 ms	452 KB	Output is correct
23	Correct	121 ms	348 KB	Output is correct
24	Correct	130 ms	348 KB	Output is correct
25	Correct	126 ms	456 KB	Output is correct
26	Correct	133 ms	548 KB	Output is correct
27	Correct	125 ms	448 KB	Output is correct
28	Correct	124 ms	348 KB	Output is correct
29	Correct	124 ms	344 KB	Output is correct
30	Correct	124 ms	452 KB	Output is correct
31	Execution timed out	5026 ms	344 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Submission #916738

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 32.0 / 32.0

Subtask #4 0 / 20.0

Subtask #5 0 / 36.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
32.0 / 32.0

Subtask #4
0 / 20.0

Subtask #5
0 / 36.0