답안 #372513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372513 2021-02-28T14:49:07 Z Kevin_Zhang_TW Group Photo (JOI21_ho_t3) C++17
100 / 100
681 ms 620 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 5010;

int n, a[MAX_N];

int dp[MAX_N], pos[MAX_N], fr[MAX_N];

struct bit {
	vector<int> val;
	void add(int i) {
		for (;i <= n;i += i & -i) val[i] ++;
	}
	int qry(int i) {
		int res = 0;
		for (;i;i ^= i & -i) res += val[i];
		return res;
	}
	bit() { val.resize(n + 1); }
};


int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n;
	for (int i = 1;i <= n;++i)
		cin >> a[i];

	fill(dp, dp + n + 1, n * n); dp[0] = 0;

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

		bit tree;

		for (int j = 1;j <= n;++j) assert(tree.qry(j) == 0);

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

		int cost = dp[i], ni = 0, ps = 0;

		for (int j = i + 1;j <= n;++j) {
			ni += tree.qry(pos[j]);
			ps += pos[j] - (j - i);

			if (i == 1) DE(i, j, ni, ps);

			if (chmin(dp[j], ni + ps + dp[i])) {
				fr[j] = i;
				if (i == 1) DE(ni + ps + dp[i]);
			}

			tree.add(pos[j]);
		}
	}

	cout << dp[n] << '\n';
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
Main.cpp:62:16: note: in expansion of macro 'DE'
   62 |    if (i == 1) DE(i, j, ni, ps);
      |                ^~
Main.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
Main.cpp:66:17: note: in expansion of macro 'DE'
   66 |     if (i == 1) DE(ni + ps + dp[i]);
      |                 ^~
Main.cpp:56:7: warning: unused variable 'cost' [-Wunused-variable]
   56 |   int cost = dp[i], ni = 0, ps = 0;
      |       ^~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 15 ms 364 KB Output is correct
32 Correct 14 ms 364 KB Output is correct
33 Correct 17 ms 364 KB Output is correct
34 Correct 14 ms 364 KB Output is correct
35 Correct 17 ms 492 KB Output is correct
36 Correct 14 ms 364 KB Output is correct
37 Correct 15 ms 364 KB Output is correct
38 Correct 14 ms 364 KB Output is correct
39 Correct 15 ms 364 KB Output is correct
40 Correct 21 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 15 ms 364 KB Output is correct
32 Correct 14 ms 364 KB Output is correct
33 Correct 17 ms 364 KB Output is correct
34 Correct 14 ms 364 KB Output is correct
35 Correct 17 ms 492 KB Output is correct
36 Correct 14 ms 364 KB Output is correct
37 Correct 15 ms 364 KB Output is correct
38 Correct 14 ms 364 KB Output is correct
39 Correct 15 ms 364 KB Output is correct
40 Correct 21 ms 364 KB Output is correct
41 Correct 657 ms 496 KB Output is correct
42 Correct 670 ms 496 KB Output is correct
43 Correct 658 ms 496 KB Output is correct
44 Correct 674 ms 492 KB Output is correct
45 Correct 679 ms 620 KB Output is correct
46 Correct 659 ms 496 KB Output is correct
47 Correct 660 ms 620 KB Output is correct
48 Correct 662 ms 620 KB Output is correct
49 Correct 655 ms 496 KB Output is correct
50 Correct 657 ms 620 KB Output is correct
51 Correct 662 ms 496 KB Output is correct
52 Correct 656 ms 496 KB Output is correct
53 Correct 658 ms 620 KB Output is correct
54 Correct 681 ms 620 KB Output is correct
55 Correct 665 ms 492 KB Output is correct