제출 #1313368

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313368		thieunguyenhuy	popa (BOI18_popa)	C++20	37 / 100	77 ms	412 KiB

popa

#ifndef hwe
	#include "popa.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2> bool maximize(T1 &x, T2 y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}

template <class T> void remove_duplicate(vector<T> &ve) {
	sort (ve.begin(), ve.end());
	ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
	return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
	return rng() % r;
}

const int N = 1000 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

#ifdef hwe
int S[N];
int query(int l, int r, int u, int v) {
	int g1 = 0, g2 = 0;
	for (int i = l; i <= r; ++i) g1 = __gcd(g1, S[i]);
	for (int i = u; i <= v; ++i) g2 = __gcd(g2, S[i]);
	return g1 == g2;
}
#endif

int solve(int n, int *Left, int *Right) {
	Left[0] = Right[0] = -1;
	int root = 0;
	for (int i = 1; i < n; ++i) {
		if (query(root, i, i, i)) Left[i] = root, Right[i] = -1, root = i;
		else {
			int p = root;
			while (true) {
				if (Right[p] == -1) {
					Right[p] = i, Left[i] = Right[i] = -1;
					break;
				}

				if (query(Right[p], i, i, i)) {
					Left[i] = Right[p], Right[p] = i, Right[i] = -1;
					break;
				}
				p = Right[p];
			}
		}
	}
	return root;
}

#ifdef hwe
int L[N], R[N];

signed main() {
	int n; cin >> n;

	for (int i = 0; i < n; ++i) cin >> S[i];

	cerr << "root = " << solve(n, L, R) << '\n';
	for (int i = 0; i < n; ++i) cerr << i << ' ' << L[i] << ' ' << R[i] << '\n';

	return 0;
}
#endif

• Subtask 1: 37 / 37
• Subtask 2: 0 / 24
• Subtask 3: 0 / 39