oj.uz

답안 #77299

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77299 2018-09-25T02:44:55 Z qkxwsm Bali Sculptures (APIO15_sculpture) C++17
25 / 100
 1000 ms 1468 KB 
/*
PROG: source
LANG: C++11
_____
.'     '.
/  0   0  \
|     ^     |
|  \     /  |
\  '---'  /
'._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
	int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
		return x ^ (x >> 7) ^ (x >> 4);
	}
	int operator()(long long x) const
	{
		return x ^ (x >> 32);
	}
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 113

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

int N, L, R;
ll arr[MAXN], pref[MAXN];
bitset<MAXN> ok[MAXN];
ll ans = LLINF, best;

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
	cin >> N >> L >> R;
	for (int i = 0; i < N; i++)
	{
		cin >> arr[i];
		pref[i + 1] = pref[i] + arr[i];
	}
	for (int m = L; m <= R; m++)
	{
		best = 0;
		for (int i = 50; i >= 0; i--)
		{
			for (int j = 0; j <= N; j++) ok[j].reset();
			ok[0][0] = true;
			for (int j = 0; j <= N; j++)
			{
				for (int k = j + 1; k <= N; k++)
				{
					ll rsum = pref[k] - pref[j];
					if (rsum & (~((1ll << (i + 1)) - 1)) & (~(best))) continue;
					for (int m = 0; m <= R; m++)
					{
						if (!ok[j][m])
						{
							continue;
						}
						if (!(rsum & (1ll << i)))
						{
							ok[k][m + 1] = true;
						}
					}
				}
			}
			if (!ok[N][m])
			{
				best += (1ll << i);
			}
		}
		ckmin(ans, best);
	}
	cout << ans << '\n';
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

sculpture.cpp: In function 'int32_t main()':
sculpture.cpp:156:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:157:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 464 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 3 ms 472 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 5 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 9 ms 704 KB Output is correct
14 Correct 2 ms 736 KB Output is correct
15 Correct 2 ms 736 KB Output is correct
16 Correct 2 ms 736 KB Output is correct
17 Correct 3 ms 736 KB Output is correct
18 Correct 2 ms 736 KB Output is correct
19 Correct 2 ms 736 KB Output is correct
20 Correct 2 ms 736 KB Output is correct
21 Correct 3 ms 736 KB Output is correct
22 Correct 3 ms 736 KB Output is correct
23 Correct 3 ms 736 KB Output is correct
24 Correct 2 ms 736 KB Output is correct
25 Correct 3 ms 736 KB Output is correct
26 Correct 5 ms 736 KB Output is correct
27 Correct 2 ms 832 KB Output is correct
28 Correct 3 ms 868 KB Output is correct
29 Correct 4 ms 868 KB Output is correct
30 Correct 2 ms 868 KB Output is correct
31 Correct 3 ms 868 KB Output is correct
32 Correct 2 ms 868 KB Output is correct
33 Correct 5 ms 868 KB Output is correct
34 Correct 10 ms 868 KB Output is correct
35 Correct 3 ms 868 KB Output is correct
36 Correct 17 ms 868 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 868 KB Output is correct
2 Correct 2 ms 868 KB Output is correct
3 Correct 3 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 2 ms 896 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 3 ms 896 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 2 ms 896 KB Output is correct
15 Correct 2 ms 896 KB Output is correct
16 Correct 2 ms 896 KB Output is correct
17 Correct 2 ms 896 KB Output is correct
18 Correct 2 ms 896 KB Output is correct
19 Correct 2 ms 896 KB Output is correct
20 Correct 2 ms 896 KB Output is correct
21 Correct 3 ms 896 KB Output is correct
22 Correct 3 ms 896 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 3 ms 896 KB Output is correct
26 Correct 5 ms 896 KB Output is correct
27 Correct 13 ms 896 KB Output is correct
28 Correct 6 ms 896 KB Output is correct
29 Correct 5 ms 896 KB Output is correct
30 Correct 34 ms 896 KB Output is correct
31 Correct 59 ms 912 KB Output is correct
32 Correct 61 ms 912 KB Output is correct
33 Correct 2 ms 912 KB Output is correct
34 Correct 59 ms 912 KB Output is correct
35 Correct 45 ms 932 KB Output is correct
36 Correct 19 ms 932 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 932 KB Output is correct
2 Correct 2 ms 940 KB Output is correct
3 Correct 2 ms 940 KB Output is correct
4 Correct 2 ms 940 KB Output is correct
5 Correct 3 ms 940 KB Output is correct
6 Correct 5 ms 948 KB Output is correct
7 Correct 2 ms 948 KB Output is correct
8 Correct 3 ms 952 KB Output is correct
9 Correct 3 ms 952 KB Output is correct
10 Correct 2 ms 960 KB Output is correct
11 Correct 2 ms 964 KB Output is correct
12 Correct 2 ms 968 KB Output is correct
13 Correct 9 ms 972 KB Output is correct
14 Correct 12 ms 976 KB Output is correct
15 Correct 6 ms 980 KB Output is correct
16 Correct 6 ms 984 KB Output is correct
17 Correct 34 ms 992 KB Output is correct
18 Correct 58 ms 1004 KB Output is correct
19 Correct 64 ms 1004 KB Output is correct
20 Correct 2 ms 1004 KB Output is correct
21 Correct 59 ms 1008 KB Output is correct
22 Correct 46 ms 1136 KB Output is correct
23 Correct 19 ms 1136 KB Output is correct
24 Correct 60 ms 1136 KB Output is correct
25 Correct 30 ms 1136 KB Output is correct
26 Correct 206 ms 1136 KB Output is correct
27 Execution timed out 1080 ms 1136 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1136 KB Output is correct
2 Correct 2 ms 1136 KB Output is correct
3 Correct 2 ms 1136 KB Output is correct
4 Correct 2 ms 1136 KB Output is correct
5 Correct 2 ms 1136 KB Output is correct
6 Correct 5 ms 1136 KB Output is correct
7 Correct 2 ms 1136 KB Output is correct
8 Correct 2 ms 1136 KB Output is correct
9 Correct 2 ms 1136 KB Output is correct
10 Correct 2 ms 1136 KB Output is correct
11 Correct 2 ms 1136 KB Output is correct
12 Correct 2 ms 1136 KB Output is correct
13 Correct 9 ms 1136 KB Output is correct
14 Correct 2 ms 1136 KB Output is correct
15 Correct 2 ms 1136 KB Output is correct
16 Correct 2 ms 1184 KB Output is correct
17 Correct 2 ms 1184 KB Output is correct
18 Correct 2 ms 1184 KB Output is correct
19 Correct 3 ms 1184 KB Output is correct
20 Correct 2 ms 1184 KB Output is correct
21 Correct 4 ms 1184 KB Output is correct
22 Correct 3 ms 1184 KB Output is correct
23 Correct 3 ms 1184 KB Output is correct
24 Correct 2 ms 1184 KB Output is correct
25 Correct 4 ms 1184 KB Output is correct
26 Correct 5 ms 1184 KB Output is correct
27 Correct 2 ms 1184 KB Output is correct
28 Correct 2 ms 1184 KB Output is correct
29 Correct 3 ms 1184 KB Output is correct
30 Correct 3 ms 1184 KB Output is correct
31 Correct 4 ms 1184 KB Output is correct
32 Correct 2 ms 1184 KB Output is correct
33 Correct 5 ms 1184 KB Output is correct
34 Correct 9 ms 1184 KB Output is correct
35 Correct 2 ms 1184 KB Output is correct
36 Correct 16 ms 1184 KB Output is correct
37 Correct 11 ms 1284 KB Output is correct
38 Correct 6 ms 1284 KB Output is correct
39 Correct 5 ms 1284 KB Output is correct
40 Correct 35 ms 1284 KB Output is correct
41 Correct 75 ms 1284 KB Output is correct
42 Correct 66 ms 1284 KB Output is correct
43 Correct 2 ms 1284 KB Output is correct
44 Correct 59 ms 1284 KB Output is correct
45 Correct 45 ms 1284 KB Output is correct
46 Correct 19 ms 1284 KB Output is correct
47 Correct 72 ms 1340 KB Output is correct
48 Correct 30 ms 1340 KB Output is correct
49 Correct 185 ms 1348 KB Output is correct
50 Execution timed out 1085 ms 1348 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1348 KB Output is correct
2 Correct 2 ms 1348 KB Output is correct
3 Correct 2 ms 1348 KB Output is correct
4 Correct 2 ms 1348 KB Output is correct
5 Correct 2 ms 1348 KB Output is correct
6 Correct 5 ms 1348 KB Output is correct
7 Correct 2 ms 1348 KB Output is correct
8 Correct 2 ms 1348 KB Output is correct
9 Correct 2 ms 1348 KB Output is correct
10 Correct 3 ms 1348 KB Output is correct
11 Correct 2 ms 1348 KB Output is correct
12 Correct 2 ms 1348 KB Output is correct
13 Correct 8 ms 1348 KB Output is correct
14 Correct 2 ms 1348 KB Output is correct
15 Correct 2 ms 1348 KB Output is correct
16 Correct 3 ms 1348 KB Output is correct
17 Correct 2 ms 1348 KB Output is correct
18 Correct 3 ms 1348 KB Output is correct
19 Correct 2 ms 1348 KB Output is correct
20 Correct 5 ms 1348 KB Output is correct
21 Correct 9 ms 1348 KB Output is correct
22 Correct 2 ms 1348 KB Output is correct
23 Correct 12 ms 1348 KB Output is correct
24 Correct 14 ms 1348 KB Output is correct
25 Correct 6 ms 1348 KB Output is correct
26 Correct 5 ms 1348 KB Output is correct
27 Correct 35 ms 1412 KB Output is correct
28 Correct 65 ms 1412 KB Output is correct
29 Correct 61 ms 1444 KB Output is correct
30 Correct 2 ms 1444 KB Output is correct
31 Correct 59 ms 1448 KB Output is correct
32 Correct 50 ms 1448 KB Output is correct
33 Correct 19 ms 1448 KB Output is correct
34 Correct 66 ms 1448 KB Output is correct
35 Correct 33 ms 1448 KB Output is correct
36 Correct 198 ms 1468 KB Output is correct
37 Execution timed out 1068 ms 1468 KB Time limit exceeded
38 Halted 0 ms 0 KB -