oj.uz

답안 #738479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
738479 2023-05-08T20:27:44 Z bane 금 캐기 (IZhO14_divide) C++17
100 / 100
 124 ms 24688 KB 
#include<bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#define debug(x) cout << (#x) << " is " << (x) << '\n'
#else
#define debug(x) 42
#endif

#define int long long

const int maxN = (int)1e5;
int t= 0,n;
unordered_map<int,int>compress;
class Fenwick{
	public:
	int tree[6 * maxN];
	
	void init(){
		for (int i = 0 ; i < 6 * maxN; i++)tree[i] = (int)1e9;
	}
	
	void update(int pos, int val){
		while(pos <= t){
			tree[pos] = min(tree[pos], val);
			pos += pos & (-pos);
		}
	}
	
	int get(int pos){
		int ans =  (int)1e9;
		while(pos){
			ans = min(ans, tree[pos]);
			pos -= pos & (-pos);
		}
		return ans;
	}
};
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	vector<vector<int>>a(n,vector<int>(3));
	for (int i = 0; i < n; i++){
		cin >> a[i][0] >> a[i][1] >> a[i][2];
	}
	sort(a.begin(), a.end());
	int len = 0, energy = 0;
	vector<int>b;
	b.push_back(0);
	for (int i = 0; i < n; i++){
		len = a[i][0];
		energy += a[i][2];//Cr - Cl <= Er - El, Cr - Er <= Cl - El
		b.push_back(len - energy);
		b.push_back(len - energy + a[i][2]);
	}
	sort(b.rbegin(), b.rend());
	for (int i = 0; i < (int)b.size(); i++){
		if (!i || b[i] != b[i - 1])compress[b[i]] = ++t;
	}
	len = 0, energy = 0;
	int ans = 0;
	Fenwick tr;
	tr.init();
	int ps[n + 1];
	memset(ps, 0LL, sizeof(ps));
	for (int i = 0; i < n; i++){
		energy += a[i][2];
		len = a[i][0];
		ps[i + 1] += a[i][1] + ps[i];
		int ask = tr.get(compress[len - energy]);
		int res = ps[i+1] - (ask != (int)1e9 ? ps[ask] : ps[i]);
		tr.update(compress[len - energy + a[i][2]], i);
		ans = max(ans, res);
	}
	cout<<ans<<'\n';
	return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 5012 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5012 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 5012 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5012 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4928 KB Output is correct
15 Correct 3 ms 5020 KB Output is correct
16 Correct 3 ms 5024 KB Output is correct
17 Correct 4 ms 5152 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 3 ms 5152 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5204 KB Output is correct
22 Correct 4 ms 5332 KB Output is correct
23 Correct 6 ms 5844 KB Output is correct
24 Correct 7 ms 5916 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 5012 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 5012 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4928 KB Output is correct
15 Correct 3 ms 5020 KB Output is correct
16 Correct 3 ms 5024 KB Output is correct
17 Correct 4 ms 5152 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 3 ms 5152 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5204 KB Output is correct
22 Correct 4 ms 5332 KB Output is correct
23 Correct 6 ms 5844 KB Output is correct
24 Correct 7 ms 5916 KB Output is correct
25 Correct 6 ms 5844 KB Output is correct
26 Correct 10 ms 6688 KB Output is correct
27 Correct 10 ms 6736 KB Output is correct
28 Correct 58 ms 14368 KB Output is correct
29 Correct 49 ms 14660 KB Output is correct
30 Correct 112 ms 24688 KB Output is correct
31 Correct 108 ms 23596 KB Output is correct
32 Correct 124 ms 23636 KB Output is correct
33 Correct 105 ms 23484 KB Output is correct
34 Correct 96 ms 23156 KB Output is correct
35 Correct 106 ms 24012 KB Output is correct
36 Correct 105 ms 24084 KB Output is correct