oj.uz

답안 #831067

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831067 2023-08-19T16:47:15 Z NothingXD 사탕 분배 (IOI21_candies) C++17
100 / 100
 2538 ms 11772 KB 
#include "candies.h"
#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx")

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 2e5 + 10;
const int S = 2048;

int n, q, a[maxn], c[maxn], l[maxn], r[maxn], v[maxn];

void add1(int l, int r, int x){
//	debug(1, l, r, x);
	for (int i = l; i <= r; i++){
		a[i] = (a[i]+x > c[i]? c[i]: a[i]+x);
	}
}

void add2(int l, int r, int x){
//	debug(2, l, r, x);
	for (int i = l; i <= r; i++){
		a[i] = (a[i]+x < 0? 0: a[i]+x);
	}
}

void add3(int l, int r, int x, int y){
//	debug(3, l, r, x, y);
	for (int i = l; i <= r; i++){
		a[i] = (a[i]+x > c[i]? c[i]: a[i]+x);
//		debug(i, a[i]);
		a[i] = (a[i]+y < 0? 0: a[i]+y);
//		debug(i, a[i]);
	}
}

void add4(int l, int r, int x, int y){
	//debug(4, l, r, x, y);
	for (int i = l; i <= r; i++){
		a[i] = (a[i]+x < 0? 0: a[i]+x);
		a[i] = (a[i]+y > c[i]? c[i]: a[i]+y);
	}
}

vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) {
	n = C.size();
	q = L.size();
	for (int i = 0; i < n; i++){
		c[i] = C[i];
	}
	for (int i = 0; i < q; i++){
		l[i] = L[i];
		r[i] = R[i];
		v[i] = V[i];
	}
	for (int st = 0; st < n; st += S){
	for (int i = 0; i < q; i += 2){
		if (i + 1 == q){
			int L = max(st, l[i]);
			int R = min(st+S-1, r[i]);
			if (v[i] > 0) add1(L, R, v[i]);
			if (v[i] < 0) add2(L, R, v[i]);
			break;
		}
		int L1 = max(st, l[i]);
		int R1 = min(st+S-1, r[i]);
		int L2 = max(st, l[i+1]);
		int R2 = min(st+S-1, r[i+1]);
		if (v[i] == 0 && v[i+1] == 0) continue;
		if (v[i] >= 0 && v[i+1] >= 0){
			add1(L1, min(R1, L2-1), v[i]);
			add1(L2, min(R2, L1-1), v[i+1]);
			add1(max(L1, L2), min(R1, R2), min(v[i]+v[i+1],(int)1e9));
			add1(max(L1, R2+1), R1, v[i]);
			add1(max(L2, R1+1), R2, v[i+1]);
		}
		else if (v[i] <= 0 && v[i+1] <= 0){
			add2(L1, min(R1, L2-1), v[i]);
			add2(L2, min(R2, L1-1), v[i+1]);
			add2(max(L1, L2), min(R1, R2), max(v[i]+v[i+1],(int)-1e9));
			add2(max(L1, R2+1), R1, v[i]);
			add2(max(L2, R1+1), R2, v[i+1]);
		}
		else if (v[i] >= 0 && v[i+1] <= 0){
			add1(L1, min(R1, L2-1), v[i]);
			add2(L2, min(R2, L1-1), v[i+1]);
			add3(max(L1, L2), min(R1, R2), v[i], v[i+1]);
			add1(max(L1, R2+1), R1, v[i]);
			add2(max(L2, R1+1), R2, v[i+1]);
		}
		else{
			add2(L1, min(R1, L2-1), v[i]);
			add1(L2, min(R2, L1-1), v[i+1]);
			add4(max(L1, L2), min(R1, R2), v[i], v[i+1]);
			add2(max(L1, R2+1), R1, v[i]);
			add1(max(L2, R1+1), R2, v[i+1]);
		}
	}
	}
	vector<int> ans;
	for (int i = 0; i < n; i++){
		ans.push_back(a[i]);
	}
	return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 396 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1477 ms 11700 KB Output is correct
2 Correct 1460 ms 11772 KB Output is correct
3 Correct 1458 ms 11624 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 63 ms 7392 KB Output is correct
3 Correct 52 ms 5564 KB Output is correct
4 Correct 1391 ms 11584 KB Output is correct
5 Correct 1384 ms 11592 KB Output is correct
6 Correct 1404 ms 11576 KB Output is correct
7 Correct 1294 ms 11732 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 64 ms 7396 KB Output is correct
4 Correct 60 ms 4568 KB Output is correct
5 Correct 2420 ms 11628 KB Output is correct
6 Correct 2402 ms 11628 KB Output is correct
7 Correct 2407 ms 11640 KB Output is correct
8 Correct 2406 ms 11644 KB Output is correct
9 Correct 2538 ms 11588 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 396 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1477 ms 11700 KB Output is correct
7 Correct 1460 ms 11772 KB Output is correct
8 Correct 1458 ms 11624 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 63 ms 7392 KB Output is correct
11 Correct 52 ms 5564 KB Output is correct
12 Correct 1391 ms 11584 KB Output is correct
13 Correct 1384 ms 11592 KB Output is correct
14 Correct 1404 ms 11576 KB Output is correct
15 Correct 1294 ms 11732 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 64 ms 7396 KB Output is correct
19 Correct 60 ms 4568 KB Output is correct
20 Correct 2420 ms 11628 KB Output is correct
21 Correct 2402 ms 11628 KB Output is correct
22 Correct 2407 ms 11640 KB Output is correct
23 Correct 2406 ms 11644 KB Output is correct
24 Correct 2538 ms 11588 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 48 ms 4556 KB Output is correct
27 Correct 62 ms 7372 KB Output is correct
28 Correct 1457 ms 11608 KB Output is correct
29 Correct 1388 ms 11560 KB Output is correct
30 Correct 1390 ms 11636 KB Output is correct
31 Correct 1400 ms 11612 KB Output is correct
32 Correct 1378 ms 11588 KB Output is correct