Submission #543758

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
543758	2022-03-31T10:17:16 Z	Asymmetry	Group Photo (JOI21_ho_t3)	C++17	44 / 100	5000 ms	340 KB

Main

//Autor: Bartłomiej Czarkowski
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n'
#else
#define debug(...) {}
#endif

const int N = 5010;
int n;
int t[N];
int p[N];
int dp[N];

int wylicz(int l, int r) {
	int ret = 0;
	for (int i = l; i <= r; ++i) {
		// ile na lewo od wartości i jest w przedziale wartości <r + 1, n>
		for (int j = p[i] - 1; j; --j) {
			if (t[j] > r) {
				++ret;
			}
		}
		// ile na lewo od wartości i jest w przedziale wartości <l, i - 1>
		for (int j = p[i] - 1; j; --j) {
			if (l <= t[j] && t[j] < i) {
				++ret;
			}
		}
	}
	debug(l, r, ret);
	return ret;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &t[i]);
		p[t[i]] = i;
	}
	for (int r = 1; r <= n; ++r) {
		dp[r] = 1e9;
		for (int l = r; l; --l) {
			dp[r] = min(dp[r], dp[l - 1] + wylicz(l, r));
		}
	}
	printf("%d\n", dp[n]);
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
Main.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |   scanf("%d", &t[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	300 KB	Output is correct
10	Correct	0 ms	308 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	300 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	337 ms	292 KB	Output is correct
22	Correct	343 ms	332 KB	Output is correct
23	Correct	342 ms	288 KB	Output is correct
24	Correct	342 ms	292 KB	Output is correct
25	Correct	368 ms	304 KB	Output is correct
26	Correct	342 ms	308 KB	Output is correct
27	Correct	358 ms	212 KB	Output is correct
28	Correct	353 ms	296 KB	Output is correct
29	Correct	352 ms	336 KB	Output is correct
30	Correct	345 ms	292 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	300 KB	Output is correct
10	Correct	0 ms	308 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	300 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	337 ms	292 KB	Output is correct
22	Correct	343 ms	332 KB	Output is correct
23	Correct	342 ms	288 KB	Output is correct
24	Correct	342 ms	292 KB	Output is correct
25	Correct	368 ms	304 KB	Output is correct
26	Correct	342 ms	308 KB	Output is correct
27	Correct	358 ms	212 KB	Output is correct
28	Correct	353 ms	296 KB	Output is correct
29	Correct	352 ms	336 KB	Output is correct
30	Correct	345 ms	292 KB	Output is correct
31	Execution timed out	5060 ms	212 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	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	300 KB	Output is correct
10	Correct	0 ms	308 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	300 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	337 ms	292 KB	Output is correct
22	Correct	343 ms	332 KB	Output is correct
23	Correct	342 ms	288 KB	Output is correct
24	Correct	342 ms	292 KB	Output is correct
25	Correct	368 ms	304 KB	Output is correct
26	Correct	342 ms	308 KB	Output is correct
27	Correct	358 ms	212 KB	Output is correct
28	Correct	353 ms	296 KB	Output is correct
29	Correct	352 ms	336 KB	Output is correct
30	Correct	345 ms	292 KB	Output is correct
31	Execution timed out	5060 ms	212 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Submission #543758

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