oj.uz

답안 #587347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587347 2022-07-01T16:54:58 Z LittlePants Meteors (POI11_met) C++17
74 / 100
 551 ms 65536 KB 
#define ll loli
#include<bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define push emplace
#define lb(x, v) lower_bound(all(x), v)
#define ub(x, v) upper_bound(all(x), v)
#define sz(x) (int)(x.size())
#define re(x) reverse(all(x))
#define uni(x) x.resize(unique(all(x)) - x.begin())
#define all(x) x.begin(), x.end()
#define mem(x, v) memset(x, v, sizeof x); 
#define pii pair<int, int>
#define inf 1000000000
#define INF 1000000000000000000
#define mod 1000000007
#define F first
#define S second
#define IO ios_base::sync_with_stdio(0); cin.tie(0);
#define chmax(a, b) (a = (b > a ? b : a))
#define chmin(a, b) (a = (b < a ? b : a))
#define get_bit(x, y) ((x>>y)&1)
#define mkp make_pair
using namespace std;

#ifdef loli
void trace_() {cerr << "\n";}
template<typename T1, typename... T2> void trace_(T1 t1, T2... t2) {cerr << ' ' << t1; trace_(t2...); }
#define trace(...) cerr << "[" << #__VA_ARGS__ << "] :", trace_(__VA_ARGS__);
#else
#define trace(...) 49
#endif

const int mxN = 3e5 + 5;

int n, m, k, ans[mxN];
long long a[mxN];

bool cmp(array<int, 3> a, array<int, 3> b) {
	if (a[1] == b[1]) return (a[0] == 0 ? INF : a[0]) < (b[0] == 0 ? INF : b[0]);
	return a[1] < b[1];
}

void bs(vector<array<int, 3>> &v, int l, int r) {
	if (l == r) {
		for (auto [i, p, o] : v) {
			if (!i) ans[o] = l;
		}
		return;
	}
	int mid = (l + r) >> 1;
	long long res = 0;
	vector<array<int, 3>> va, vb;

	for (auto [i, x, val] : v) {
		if (i and i <= mid) res += val;
		if (!i) a[val] -= res;
	}

	for (auto [i, x, val] : v) {
		if (i) {
			if (i <= mid) va.pb({i, x, val});
			else vb.pb({i, x, val});
		} else {
			if (a[val] <= 0) va.pb({i, x, val});
			else vb.pb({i, x, val});
		}
	}
	v.clear();

	res = 0;
	for (auto [i, x, val] : va) {
		if (i)  res += val;
		else a[val] += res;
	}

	bs(va, l, mid);
	bs(vb, mid+1, r);
}

inline void solve() {
	cin >> n >> m;
	vector<int> o(m + 1);
	for (int i = 1; i <= m; i++) cin >> o[i];
	for (int i = 1; i <= n; i++) cin >> a[i];

	vector<array<int, 3>> v;
	for (int i = 1; i <= m; i++) {
		v.pb({0, i, o[i]});
	}

	cin >> k;
	for (int i = 1; i <= k; i++) {
		int l, r, x; cin >> l >> r >> x;
		if (l > r) {
			v.pb({i, l, x});
			v.pb({i, 1, x});
			v.pb({i, r + 1, -x});
		} else {
			v.pb({i, l, x});
			if (r + 1 <= m) v.pb({i, r + 1, -x});
		}
	}

	sort(all(v), cmp);
	bs(v, 1, k + 1);

	for (int i = 1; i <= n; i++) {
		if (ans[i] == 0 or ans[i] == k + 1) cout << "NIE\n";
		else cout << ans[i] << '\n';
	}
}

signed main() {
	IO;	
	solve();	
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 468 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 468 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 12320 KB Output is correct
2 Correct 93 ms 17744 KB Output is correct
3 Correct 94 ms 7984 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 7812 KB Output is correct
2 Correct 88 ms 7928 KB Output is correct
3 Correct 92 ms 14568 KB Output is correct
4 Correct 24 ms 6396 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 8760 KB Output is correct
2 Correct 83 ms 14048 KB Output is correct
3 Correct 55 ms 5004 KB Output is correct
4 Correct 83 ms 8260 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 14248 KB Output is correct
2 Correct 116 ms 13440 KB Output is correct
3 Correct 76 ms 7892 KB Output is correct
4 Correct 93 ms 9600 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 551 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 507 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -