oj.uz

Submission #129818

# Submission time Handle Problem Language Result Execution time Memory
129818 2019-07-13T09:52:46 Z kostia244 Bali Sculptures (APIO15_sculpture) C++14
37 / 100
 101 ms 31096 KB 
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define pb push_back
#define __V vector
#define all(x) x.begin(), x.end()
#define oit ostream_iterator
#define mod M
using namespace std;
void doin() {
	cin.tie();
	cout.tie();
	ios::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
}
template<typename X, typename Y>
istream& operator>>(istream& in, pair<X, Y> &a) {
	in >> a.first >> a.second;
	return in;
}
template<typename T>
void getv(T& i) {
	cin >> i;
}
template<typename T, typename ... Ns>
void getv(vector<T>& v, int n, Ns ... ns) {
	v.resize(n);
	for (auto& i : v)
		getv(i, ns...);
}
template<typename T>
void getv1(T& i) {
	cin >> i;
}
template<typename T, typename ... Ns>
void getv1(vector<T>& v, int n, Ns ... ns) {
	v.resize(n + 1);
	for (int i = 1; i <= n; i++)
		getv(v[i], ns...);
}
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
inline void getch(char &x) {
	while (x = getchar_unlocked(), x < 33) {
		;
	}
}
inline void getstr(string &str) {
	str.clear();
	char cur;
	while (cur = getchar_unlocked(), cur < 33) {
		;
	}
	while (cur > 32) {
		str += cur;
		cur = getchar_unlocked();
	}
}
template<typename T> inline bool sc(T &num) {
	bool neg = 0;
	int c;
	num = 0;
	while (c = getchar_unlocked(), c < 33) {
		if (c == EOF)
			return false;
	}
	if (c == '-') {
		neg = 1;
		c = getchar_unlocked();
	}
	for (; c > 47; c = getchar_unlocked())
		num = num * 10 + c - 48;
	if (neg)
		num *= -1;
	return true;
}
typedef unsigned long long ull;
typedef long long ll;
typedef float ld;
typedef ll _I;
typedef pair<_I, _I> pi;
typedef pair<ld, ld> pd;
typedef map<_I, _I> mii;
typedef __V <_I> vi;
typedef __V <char> vc;
typedef __V <ld> vd;
typedef __V <vd> vvd;
typedef __V <pi> vpi;
typedef __V <__V<_I>> vvi;
typedef __V <__V<char>> vvc;
typedef __V <__V<pi>> vvpi;
using AntonTsypko = void;
using arsijo = AntonTsypko;
using god = arsijo;
uniform_real_distribution<double> double_dist(0, 1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, A, B;
int dp[101][101][2001];
vi a, pref;
int main() {
	doin();
	cin >> n >> A >> B;
	getv(a, n);
	pref.resize(n);
	pref[0] = a[0];
	for (int i = 1; i < n; i++)
		pref[i] = a[i] + pref[i - 1];
	dp[0][0][0] = 1;
	for (int i = 0; i < n; i++) {
		for(int p = 0; p < B; p++) {
			for(int o = 0; o <= 2000; o++) {
				if(!dp[i][p][o]) continue;
				for(int ni = i+1; ni <= n; ni++) {
					dp[ni][p+1][o|(pref[ni-1] - (i ? pref[i-1] : 0))]=1;
				}
			}
		}
	}
	int ans = INT_MAX;
	for(int c = A; c <= B; c++) {
		int cor = 0;
		while(!dp[n][c][cor]) cor++;
		ans = min(cor, ans);
//		cout <<
	}
	cout << ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 4 ms 1148 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 3 ms 888 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 3 ms 888 KB Output is correct
22 Correct 3 ms 888 KB Output is correct
23 Correct 3 ms 888 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 3 ms 888 KB Output is correct
26 Correct 4 ms 1144 KB Output is correct
27 Runtime error 7 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 4 ms 1272 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 3 ms 888 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 3 ms 888 KB Output is correct
22 Correct 3 ms 888 KB Output is correct
23 Correct 4 ms 888 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 3 ms 888 KB Output is correct
26 Correct 4 ms 1148 KB Output is correct
27 Correct 4 ms 1400 KB Output is correct
28 Correct 4 ms 1272 KB Output is correct
29 Correct 3 ms 1144 KB Output is correct
30 Correct 7 ms 3064 KB Output is correct
31 Correct 12 ms 4088 KB Output is correct
32 Correct 9 ms 4092 KB Output is correct
33 Correct 3 ms 632 KB Output is correct
34 Correct 9 ms 3960 KB Output is correct
35 Correct 8 ms 3576 KB Output is correct
36 Correct 6 ms 2424 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 4 ms 1272 KB Output is correct
14 Correct 4 ms 1400 KB Output is correct
15 Correct 4 ms 1272 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 7 ms 2936 KB Output is correct
18 Correct 10 ms 4088 KB Output is correct
19 Correct 9 ms 4084 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 9 ms 3960 KB Output is correct
22 Correct 8 ms 3576 KB Output is correct
23 Correct 6 ms 2424 KB Output is correct
24 Correct 10 ms 4348 KB Output is correct
25 Correct 9 ms 3320 KB Output is correct
26 Correct 23 ms 8440 KB Output is correct
27 Correct 52 ms 19192 KB Output is correct
28 Correct 88 ms 27200 KB Output is correct
29 Correct 101 ms 31096 KB Output is correct
30 Correct 4 ms 888 KB Output is correct
31 Correct 63 ms 21496 KB Output is correct
32 Correct 83 ms 27296 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 788 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 1 ms 632 KB Output is correct
11 Correct 2 ms 508 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 4 ms 1144 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 3 ms 888 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 3 ms 888 KB Output is correct
22 Correct 3 ms 888 KB Output is correct
23 Correct 3 ms 888 KB Output is correct
24 Correct 2 ms 508 KB Output is correct
25 Correct 3 ms 888 KB Output is correct
26 Correct 3 ms 1144 KB Output is correct
27 Runtime error 6 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 508 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 4 ms 1144 KB Output is correct
14 Runtime error 6 ms 508 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -