답안 #445262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
445262	2021-07-17T08:04:18 Z	maomao90	Group Photo (JOI21_ho_t3)	C++17	100 / 100	912 ms	596 KB

Main

#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifdef DEBUG
#define debug(args...) _debug(args)
void _debug(const char* format, ...) {
	va_list args;
	va_start(args, format);
	vprintf(format, args);
	va_end(args);
}
#else
#define debug(args...)
#endif

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 5005

int n;
int h[MAXN];
int mp[MAXN];
int dp[MAXN]; // minimum number of swaps with heights [1 ... i]

int fw1[MAXN], fw2[MAXN];
void incre(int i, int x, int* fw) {
	for (; i <= n; i += i & -i) fw[i] += x;
}
int qsm(int i, int* fw) {
	int res = 0;
	for (; i > 0; i -= i & -i) res += fw[i];
	return res;
}
int qsm(int s, int e, int* fw) {
	return qsm(e, fw) - qsm(s - 1, fw);
}

int main() {
	scanf("%d", &n);
	REP (i, 1, n + 1) {
		scanf("%d", &h[i]);
		mp[h[i]] = i;
	}
	dp[1] = 0;
	REP (i, 2, n + 1) {
		dp[i] = INF;
		memset(fw1, 0, sizeof fw1);
		memset(fw2, 0, sizeof fw2);
		REP (j, 1, i + 1) {
			incre(mp[j], 1, fw1);
		}
		int cost = 0;
		RREP (j, i, 1) {
			cost -= qsm(1, mp[j] - 1, fw2) * 2;
			cost += i - j;
			cost += qsm(mp[j] + 1, n, fw1);
			// consider placing i at position j, so before position j, minimum
			// swaps is dp[j - 1] and after position j, the array is 
			// [i, i - 1, i - 2, ..., j]
			mnto(dp[i], dp[j - 1] + cost);
			incre(mp[j], -1, fw1);
			incre(mp[j], 1, fw2);
		}
	}
	printf("%d\n", dp[n]);
	return 0;
}

/*
5
3 5 2 4 1
*/

Compilation message

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

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct

Subtask #3
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	2 ms	332 KB	Output is correct
30	Correct	2 ms	332 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	2 ms	332 KB	Output is correct
30	Correct	2 ms	332 KB	Output is correct
31	Correct	19 ms	332 KB	Output is correct
32	Correct	19 ms	344 KB	Output is correct
33	Correct	19 ms	352 KB	Output is correct
34	Correct	18 ms	300 KB	Output is correct
35	Correct	18 ms	332 KB	Output is correct
36	Correct	18 ms	348 KB	Output is correct
37	Correct	18 ms	332 KB	Output is correct
38	Correct	19 ms	356 KB	Output is correct
39	Correct	17 ms	352 KB	Output is correct
40	Correct	18 ms	352 KB	Output is correct

Subtask #5
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	2 ms	332 KB	Output is correct
30	Correct	2 ms	332 KB	Output is correct
31	Correct	19 ms	332 KB	Output is correct
32	Correct	19 ms	344 KB	Output is correct
33	Correct	19 ms	352 KB	Output is correct
34	Correct	18 ms	300 KB	Output is correct
35	Correct	18 ms	332 KB	Output is correct
36	Correct	18 ms	348 KB	Output is correct
37	Correct	18 ms	332 KB	Output is correct
38	Correct	19 ms	356 KB	Output is correct
39	Correct	17 ms	352 KB	Output is correct
40	Correct	18 ms	352 KB	Output is correct
41	Correct	904 ms	512 KB	Output is correct
42	Correct	900 ms	400 KB	Output is correct
43	Correct	905 ms	596 KB	Output is correct
44	Correct	907 ms	584 KB	Output is correct
45	Correct	912 ms	516 KB	Output is correct
46	Correct	903 ms	396 KB	Output is correct
47	Correct	886 ms	516 KB	Output is correct
48	Correct	885 ms	516 KB	Output is correct
49	Correct	877 ms	392 KB	Output is correct
50	Correct	890 ms	384 KB	Output is correct
51	Correct	890 ms	524 KB	Output is correct
52	Correct	891 ms	456 KB	Output is correct
53	Correct	893 ms	452 KB	Output is correct
54	Correct	877 ms	456 KB	Output is correct
55	Correct	887 ms	332 KB	Output is correct

답안 #445262

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