제출 #1291347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291347		blackscreen1	Bali Sculptures (APIO15_sculpture)	C++20	71 / 100	68 ms	584 KiB

sculpture

#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 tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n, m, t;
	cin >> n >> m >> t;
	ll a[n];
	iloop(0, n) cin >> a[i];
	if (m > 1) {
		ll cv = (1LL<<40)-1;
		bool vis[n+1][n+1];
		lloop(39, -1) {
			cv ^= (1LL<<l);
			memset(vis, 0, sizeof(vis));
			vis[0][0] = 1;
			iloop(0, n) {
				jloop(0, n+1) if (vis[i][j]) {
					ll ts = 0;
					kloop(i, n) {
						ts += a[k];
						if ((ts&cv) == ts) vis[k+1][j+1] = 1;
					}
				}
			}
			bool can = 0;
			iloop(m, t+1) if (vis[n][i]) can = 1;
			if (!can) cv ^= (1LL<<l);
		}
		cout << cv;
		return 0;
	}
	ll cv = (1LL<<40)-1;
	ll ds[n+1];
	lloop(39, -1) {
		cv ^= (1LL<<l);
		iloop(1, n+1) ds[i] = INF;
		ds[0] = 0;
		iloop(0, n) {
			ll ts = 0;
			kloop(i, n) {
				ts += a[k];
				if ((ts&cv) == ts) ds[k+1] = min(ds[k+1], ds[i] + 1);
			}
		}
		if (ds[n] > t) cv ^= (1LL<<l);
	}
	cout << cv;
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 0 / 29