Submission #1307270

#	Time	Username	Problem	Language	Result	Execution time	Memory
1307270		thieunguyenhuy	Restore Array (RMI19_restore)	C++20	0 / 100	4 ms	828 KiB

restore

#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 = 5000 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

int n, m;
int cnt[N];
ll dist[N];
vii adj[N];
bitset<N> inQ;

void add(int x, int y, int k) {
	// pref(x) - pref(y) <= k
	adj[y].emplace_back(x, k);
}

bool spfa(int s) {
	memset(dist, 0x0f, sizeof dist);

	queue<int> q; q.emplace(s);
	dist[s] = 0, inQ[s] = true;
	while (!q.empty()) {
		int u = q.front(); q.pop();
		inQ[u] = false;
		// cerr << u << '\n';

		for (auto [v, w] : adj[u]) if (minimize(dist[v], dist[u] + w)) {
			// cerr << v << '\n';
			if (!inQ[v]) {
				q.emplace(v), inQ[v] = true;
				++cnt[v];
				if (cnt[v] > n + 2) return false;
			}
		}
	}

	return true;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

	cin >> n >> m;

	for (int i = 1; i <= m; ++i) {
		int l, r, k, value; cin >> l >> r >> k >> value;
		++l, ++r;
		if (value == 1) {
			// pref(r) - pref(l-1) < k
			add(r, l - 1, k);
		}
		else {
			// pref(r) - pref(l-1) >= k
			// pref(l-1) - pref(r) <= -k
			add(l - 1, r, -k);
		}
	}

	for (int i = 1; i <= n; ++i) add(i, i - 1, 1);
	for (int i = 1; i <= n; ++i) adj[n + 1].emplace_back(i, 0);

	if (!spfa(n + 1)) return cout << -1, 0;
	for (int i = 1; i <= n; ++i) cout << !(dist[i] - dist[i - 1]) << ' ';
	return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 55