oj.uz

Submission #491241

# Submission time Handle Problem Language Result Execution time Memory
491241 2021-12-01T06:54:52 Z fhvirus Meteors (POI11_met) C++17
61 / 100
 403 ms 33000 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
template<class I>bool chmax(I&a,I b){return a<b?(a=b,true):false;}
template<class I>bool chmin(I&a,I b){return b<a?(a=b,true):false;} 
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#pragma GCC optimize("Ofast")
#define debug(...) ((void)0)
#endif

const int kN = 300003;
int n, m, o[kN], p[kN];
int k, l[kN], r[kN], a[kN];
int ans[kN];

struct SGT {
	int n; vector<ll> val;
	SGT (int nn = 0): n(nn), val(nn+1, 0) {}
	void modify(int p, int v) {
		for (; p <= n; p += p & -p)
			val[p] += v;
	}
	ll query(int p) {
		ll r = 0;
		for (; p > 0; p -= p & -p)
			r += val[p];
		return r;
	}
	void modify(int l, int r, int v) {
		modify(l, v);
		modify(r+1, -v);
	}
} sgt;

int tmp[kN];
int cnt[kN];
void wbs(vector<int> &ids, int ql, int qr) {
	if (ql == qr) {
		for (int &i: ids)
			ans[o[i]] = ql;
		return;
	}

	int qm = (ql + qr) / 2;

	for (int i = max(1, ql); i <= qm; ++i) {
		if (l[i] <= r[i]) sgt.modify(l[i], r[i], a[i]);
		else {
			sgt.modify(l[i], m, a[i]);
			sgt.modify(1, r[i], a[i]);
		}
	}

	for (int &i: ids) {
		tmp[o[i]] += sgt.query(i);
		++cnt[o[i]];
	}

	vector<int> lid, rid;
	for (int &i: ids) {
		--cnt[o[i]];

		if (tmp[o[i]] >= p[o[i]]) {
			lid.pb(i);
		} else {
			rid.pb(i);
			if (cnt[o[i]] == 0)
				p[o[i]] -= tmp[o[i]];
		}
		if (cnt[o[i]] == 0)
			tmp[o[i]] = 0;
	}

	for (int i = max(1, ql); i <= qm; ++i) {
		if (l[i] <= r[i]) sgt.modify(l[i], r[i], -a[i]);
		else {
			sgt.modify(l[i], m, -a[i]);
			sgt.modify(1, r[i], -a[i]);
		}
	}

	if (!lid.empty()) wbs(lid, ql, qm);
	if (!rid.empty()) wbs(rid, qm+1, qr);
}

void solve() {
	for (int i = 1; i <= n; ++i)
		ans[i] = k+1;

	vector<int> ids(m);
	iota(AI(ids), 1);
	sgt = SGT(m);
	wbs(ids, 0, k+1);
}

void input() {
	cin >> n >> m;
	for (int i = 1; i <= m; ++i) cin >> o[i];
	for (int i = 1; i <= n; ++i) cin >> p[i];
	cin >> k;
	for (int i = 1; i <= k; ++i)
		cin >> l[i] >> r[i] >> a[i];
}
void ouput() {
	for (int i = 1; i <= n; ++i) {
		if (ans[i] == k+1) cout << "NIE\n";
		else cout << ans[i] << '\n';
	}
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	input();
	solve();
	ouput();
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 2 ms 460 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 5068 KB Output is correct
2 Correct 69 ms 6388 KB Output is correct
3 Correct 97 ms 3708 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 3556 KB Output is correct
2 Correct 81 ms 3604 KB Output is correct
3 Correct 55 ms 5584 KB Output is correct
4 Correct 28 ms 3472 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 3656 KB Output is correct
2 Correct 76 ms 5436 KB Output is correct
3 Correct 17 ms 1536 KB Output is correct
4 Correct 77 ms 3892 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 4580 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 33000 KB Output is correct
2 Incorrect 324 ms 30272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 401 ms 29528 KB Output is correct
2 Incorrect 345 ms 24052 KB Output isn't correct
3 Halted 0 ms 0 KB -