oj.uz

답안 #470705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470705 2021-09-05T07:33:16 Z Return_0 Liteh and Newfiteh (INOI20_litehfiteh) C++17
100 / 100
 131 ms 158000 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e5 + 7, lg = 19;

ll a [N], dp1 [lg + 1][N][lg + 1], dp2 [N], n;

int main ()
{
	cin.tie(0)->sync_with_stdio(false);

	cin>> n;
	input(1, n, a);

	memset(dp1, 63, sizeof dp1);
	memset(dp2, 63, sizeof dp2);
	for (ll i = 1; i <= n; i++) for (ll j = 0; j < lg; j++) {
		if (a[i] == j) dp1[0][i][j] = 0;
		else if (a[i] == j + 1) dp1[0][i][j] = 1;
	}

	for (ll l = 0; l + 1 < lg; l++) for (ll i = 1 << (l + 1); i <= n; i++) for (ll j = 0; j < lg; j++)
		dp1[l + 1][i][j] = min({dp1[l + 1][i][j], dp1[l][i][j] + dp1[l][i - (1 << l)][j], dp1[l][i][j + 1] + dp1[l][i - (1 << l)][j + 1] + 1});
	
	dp2[0] = 0;
	for (ll i = 1; i <= n; i++) for (ll j = 0; i >= 1 << j; j++) dp2[i] = min(dp2[i], dp2[i - (1 << j)] + dp1[j][i][0]);

	if (dp2[n] > inf) dp2[n] = -1;
	cout<< dp2[n] << endl;

	cerr<< "\n" __TIMESTAMP__ " - Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*

*/

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 157252 KB Output is correct
2 Correct 77 ms 157184 KB Output is correct
3 Correct 77 ms 157256 KB Output is correct
4 Correct 79 ms 157252 KB Output is correct
5 Correct 78 ms 157224 KB Output is correct
6 Correct 85 ms 157156 KB Output is correct
7 Correct 84 ms 157252 KB Output is correct
8 Correct 79 ms 157240 KB Output is correct
9 Correct 77 ms 157384 KB Output is correct
10 Correct 78 ms 157204 KB Output is correct
11 Correct 81 ms 157164 KB Output is correct
12 Correct 87 ms 157224 KB Output is correct
13 Correct 78 ms 157252 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 157252 KB Output is correct
2 Correct 77 ms 157184 KB Output is correct
3 Correct 77 ms 157256 KB Output is correct
4 Correct 79 ms 157252 KB Output is correct
5 Correct 78 ms 157224 KB Output is correct
6 Correct 85 ms 157156 KB Output is correct
7 Correct 84 ms 157252 KB Output is correct
8 Correct 79 ms 157240 KB Output is correct
9 Correct 77 ms 157384 KB Output is correct
10 Correct 78 ms 157204 KB Output is correct
11 Correct 81 ms 157164 KB Output is correct
12 Correct 87 ms 157224 KB Output is correct
13 Correct 78 ms 157252 KB Output is correct
14 Correct 81 ms 157156 KB Output is correct
15 Correct 91 ms 157232 KB Output is correct
16 Correct 78 ms 157244 KB Output is correct
17 Correct 76 ms 157252 KB Output is correct
18 Correct 78 ms 157268 KB Output is correct
19 Correct 77 ms 157268 KB Output is correct
20 Correct 81 ms 157328 KB Output is correct
21 Correct 82 ms 157264 KB Output is correct
22 Correct 126 ms 157888 KB Output is correct
23 Correct 129 ms 158000 KB Output is correct
24 Correct 128 ms 157760 KB Output is correct
25 Correct 76 ms 157168 KB Output is correct
26 Correct 77 ms 157196 KB Output is correct
27 Correct 79 ms 157240 KB Output is correct
28 Correct 78 ms 157176 KB Output is correct
29 Correct 81 ms 157240 KB Output is correct
30 Correct 81 ms 157412 KB Output is correct
31 Correct 81 ms 157256 KB Output is correct
32 Correct 80 ms 157280 KB Output is correct
33 Correct 123 ms 157764 KB Output is correct
34 Correct 129 ms 157936 KB Output is correct
35 Correct 124 ms 157800 KB Output is correct
36 Correct 131 ms 157840 KB Output is correct
37 Correct 125 ms 157856 KB Output is correct
38 Correct 123 ms 157844 KB Output is correct
39 Correct 127 ms 157888 KB Output is correct
40 Correct 123 ms 157956 KB Output is correct
41 Correct 129 ms 157764 KB Output is correct
42 Correct 123 ms 157852 KB Output is correct
43 Correct 124 ms 157776 KB Output is correct
44 Correct 128 ms 157836 KB Output is correct
45 Correct 125 ms 157892 KB Output is correct
46 Correct 130 ms 157764 KB Output is correct
47 Correct 109 ms 157600 KB Output is correct
48 Correct 117 ms 157636 KB Output is correct
49 Correct 122 ms 157724 KB Output is correct
50 Correct 126 ms 157872 KB Output is correct
51 Correct 82 ms 157244 KB Output is correct
52 Correct 126 ms 157808 KB Output is correct