답안 #701729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
701729	2023-02-22T02:51:10 Z	shmad	Discharging (NOI20_discharging)	C++17	47 / 100	1000 ms	172704 KB

Discharging

#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

int n, a[N], dp[N], st[N][20], lg[N];

void build () {
	lg[0] = -1;
	for (int i = 1; i <= n; i++) lg[i] = lg[i / 2] + 1, st[i][0] = a[i];
	for (int j = 1; j <= lg[n]; j++) {
		for (int i = 1; i + (1 << (j - 1)) <= n; i++) st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
	}
}

int get (int l, int r) {
	int j = lg[r - l + 1];
	return max(st[l][j], st[r - (1 << j) + 1][j]);
}

void solve () {
	cin >> n;
	a[0] = inf;
	bool ok = 1;
	for (int i = 1; i <= n; i++) cin >> a[i], ok &= (a[i] <= a[i - 1]);
	if (ok) cout << a[1] * n << '\n', exit(0);
	build();
	for (int i = 1; i <= n; i++) {
	 	dp[i] = inf;
	 	for (int j = 1; j <= i; j++) dp[i] = min(dp[i], dp[j - 1] + get(j, i) * (n - j + 1));
	}
	cout << dp[n];
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Subtask #1
9.0 / 9.0

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

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	596 KB	Output is correct
2	Correct	4 ms	596 KB	Output is correct
3	Correct	3 ms	596 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	3 ms	724 KB	Output is correct
6	Correct	3 ms	604 KB	Output is correct
7	Correct	3 ms	596 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	3 ms	596 KB	Output is correct
11	Correct	4 ms	596 KB	Output is correct
12	Correct	3 ms	596 KB	Output is correct
13	Correct	3 ms	596 KB	Output is correct
14	Correct	4 ms	596 KB	Output is correct
15	Correct	3 ms	596 KB	Output is correct

Subtask #3
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	596 KB	Output is correct
2	Correct	4 ms	596 KB	Output is correct
3	Correct	3 ms	596 KB	Output is correct
4	Correct	3 ms	596 KB	Output is correct
5	Correct	3 ms	724 KB	Output is correct
6	Correct	3 ms	604 KB	Output is correct
7	Correct	3 ms	596 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	3 ms	596 KB	Output is correct
11	Correct	4 ms	596 KB	Output is correct
12	Correct	3 ms	596 KB	Output is correct
13	Correct	3 ms	596 KB	Output is correct
14	Correct	4 ms	596 KB	Output is correct
15	Correct	3 ms	596 KB	Output is correct
16	Execution timed out	1088 ms	172704 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #4
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	86 ms	8092 KB	Output is correct
2	Correct	96 ms	17784 KB	Output is correct
3	Correct	92 ms	17684 KB	Output is correct
4	Correct	91 ms	17684 KB	Output is correct
5	Correct	93 ms	17752 KB	Output is correct
6	Correct	102 ms	17876 KB	Output is correct
7	Correct	91 ms	17740 KB	Output is correct
8	Correct	92 ms	17716 KB	Output is correct
9	Correct	93 ms	17712 KB	Output is correct
10	Correct	100 ms	17728 KB	Output is correct

Subtask #5
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	3 ms	596 KB	Output is correct
16	Correct	4 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	3 ms	596 KB	Output is correct
19	Correct	3 ms	724 KB	Output is correct
20	Correct	3 ms	604 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	3 ms	604 KB	Output is correct
23	Correct	3 ms	596 KB	Output is correct
24	Correct	3 ms	596 KB	Output is correct
25	Correct	4 ms	596 KB	Output is correct
26	Correct	3 ms	596 KB	Output is correct
27	Correct	3 ms	596 KB	Output is correct
28	Correct	4 ms	596 KB	Output is correct
29	Correct	3 ms	596 KB	Output is correct
30	Correct	3 ms	612 KB	Output is correct
31	Correct	3 ms	596 KB	Output is correct
32	Correct	3 ms	596 KB	Output is correct
33	Correct	3 ms	596 KB	Output is correct
34	Correct	3 ms	596 KB	Output is correct
35	Correct	3 ms	596 KB	Output is correct
36	Correct	3 ms	596 KB	Output is correct
37	Correct	3 ms	596 KB	Output is correct
38	Correct	3 ms	596 KB	Output is correct
39	Correct	3 ms	596 KB	Output is correct
40	Correct	3 ms	596 KB	Output is correct
41	Correct	3 ms	596 KB	Output is correct
42	Correct	3 ms	596 KB	Output is correct
43	Correct	3 ms	596 KB	Output is correct
44	Correct	3 ms	596 KB	Output is correct
45	Correct	3 ms	596 KB	Output is correct
46	Correct	3 ms	596 KB	Output is correct
47	Correct	4 ms	596 KB	Output is correct
48	Correct	3 ms	596 KB	Output is correct
49	Correct	3 ms	596 KB	Output is correct
50	Correct	3 ms	596 KB	Output is correct

Subtask #6
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	3 ms	596 KB	Output is correct
16	Correct	4 ms	596 KB	Output is correct
17	Correct	3 ms	596 KB	Output is correct
18	Correct	3 ms	596 KB	Output is correct
19	Correct	3 ms	724 KB	Output is correct
20	Correct	3 ms	604 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	3 ms	604 KB	Output is correct
23	Correct	3 ms	596 KB	Output is correct
24	Correct	3 ms	596 KB	Output is correct
25	Correct	4 ms	596 KB	Output is correct
26	Correct	3 ms	596 KB	Output is correct
27	Correct	3 ms	596 KB	Output is correct
28	Correct	4 ms	596 KB	Output is correct
29	Correct	3 ms	596 KB	Output is correct
30	Execution timed out	1088 ms	172704 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

답안 #701729

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 13.0 / 13.0

Subtask #3 0 / 25.0

Subtask #4 11.0 / 11.0

Subtask #5 14.0 / 14.0

Subtask #6 0 / 28.0

Subtask #1
9.0 / 9.0

Subtask #2
13.0 / 13.0

Subtask #3
0 / 25.0

Subtask #4
11.0 / 11.0

Subtask #5
14.0 / 14.0

Subtask #6
0 / 28.0