oj.uz

답안 #865280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
865280 2023-10-24T06:59:47 Z Nuraly_Serikbay Meteors (POI11_met) C++17
74 / 100
 2641 ms 65536 KB 
//çalışan kazanır//
 
#include "bits/stdc++.h"
 
using namespace std;
 
#define int long long
#define pb push_back
#define S second
#define F first
#define all(x) x.begin(),x.end()
#define YOSIK() ios_base::sync_with_stdio(0),cin.tie(0)
int gcd (int a, int b) {if (b == 0){return a;}else {return gcd (b, a % b);}}
 
const int N = 3e5 + 5;
const int INF = 2e18 + 1;
const int MOD = 1e9 + 7;
const int MODD = 1070234587ll;
const double eps = 0.0001;
//const int p = 87;

int n, m, o[N], p[N], q, l[N], r[N], a[N], ans[N];
pair <int, int> brd[N];
vector <int> pos[N], MID[N];
int t[N*4], mod[N*4];

void upd (int v, int tl, int tr, int l, int r, int val) {
	if (tr < l || r < tl) return;
	if (l <= tl && tr <= r) {
		t[v] += val;
		return;
	}
	int mid = (tl + tr) >> 1;
	upd (v + v, tl, mid, l, r, val), upd (v + v + 1, mid + 1, tr, l, r, val);
	return; 
}

int get (int v, int tl, int tr, int pos) {
	if (tl == tr) return t[v];
	int mid = (tl + tr) >> 1;
	if (pos <= mid) return (t[v] + get (v + v, tl, mid, pos));
	return (t[v] + get (v + v + 1, mid + 1, tr, pos));
}

void cl (int v, int tl, int tr) {
	t[v] = 0;
	if (tl == tr) return;
	int mid = (tl + tr) >> 1;
	cl (v + v, tl, mid), cl (v + v + 1, mid + 1, tr);
	return;
}

void solution () {	
	cin >> n >> m;
	for (int i = 1; i <= m; ++ i) {
		cin >> o[i];
		pos[o[i]].pb (i);
	}
	for (int i = 1; i <= n; ++ i) cin >> p[i];
	cin >> q;
	for (int i = 1; i <= q; ++ i) cin >> l[i] >> r[i] >> a[i];
	for (int i = 1; i <= n; ++ i) brd[i] = make_pair (1, q), ans[i] = -1;
	
	for (int tt = 19; tt >= 0; -- tt) {
		for (int i = 1; i <= n; ++ i) {
			if (brd[i].F > brd[i].S) continue;
			MID[(brd[i].F + brd[i].S) >> 1].pb (i);
		}
		
		for (int mid = 1; mid <= q; ++ mid) {
			if (l[mid] <= r[mid]) upd (1, 1, m, l[mid], r[mid], a[mid]);
			else {
				upd (1, 1, m, 1, r[mid], a[mid]);
				upd (1, 1, m, l[mid], m, a[mid]);
			}
			for (auto i: MID[mid]) {
				int sum = 0;
				for (auto j: pos[i]) sum += get (1, 1, m, j);
				if (sum >= p[i]) brd[i].S = mid - 1, ans[i] = mid;
				else brd[i].F = mid + 1;
			}
		}
		cl (1, 1, m);
		for (int i = 1; i <= q; ++ i) MID[i].clear();
	}	
	for (int i = 1; i <= n; ++ i) {
		if (ans[i] == -1) cout << "NIE\n";
		else cout << ans[i] << '\n';
	}	
	return;
}
 
signed main() {
	YOSIK();
//	srand (time(0));
//	freopen ("E.in", "r", stdin);
//	freopen ("E.out", "w", stdout);
	int TT = 1;// cin >> TT;
	for (int i = 1; i <= TT; ++ i) {
//		cout << "Case " << i << ": ";
		solution ();
		
  	}
 
	return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 29020 KB Output is correct
2 Correct 8 ms 29020 KB Output is correct
3 Correct 9 ms 29016 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 29020 KB Output is correct
2 Correct 9 ms 29104 KB Output is correct
3 Correct 9 ms 29324 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 293 ms 32560 KB Output is correct
2 Correct 348 ms 37512 KB Output is correct
3 Correct 338 ms 36660 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 311 ms 35928 KB Output is correct
2 Correct 320 ms 36176 KB Output is correct
3 Correct 342 ms 37632 KB Output is correct
4 Correct 65 ms 35920 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 33224 KB Output is correct
2 Correct 215 ms 37908 KB Output is correct
3 Correct 153 ms 29272 KB Output is correct
4 Correct 324 ms 37364 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 313 ms 31748 KB Output is correct
2 Correct 297 ms 35968 KB Output is correct
3 Correct 294 ms 32084 KB Output is correct
4 Correct 342 ms 38988 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2621 ms 65536 KB Output is correct
2 Incorrect 1342 ms 42120 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2641 ms 62728 KB Output is correct
2 Incorrect 903 ms 41076 KB Output isn't correct
3 Halted 0 ms 0 KB -