oj.uz

Submission #381234

# Submission time Handle Problem Language Result Execution time Memory
381234 2021-03-24T20:58:19 Z SavicS Divide and conquer (IZhO14_divide) C++14
17 / 100
 2 ms 384 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
array<int,3> niz[maxn];

int G[maxn];
int E[maxn];

ll bor[4*maxn];
void update(int v, int tl, int tr, int poz, ll vre) {
	if(tl == tr) {
		bor[v] = vre;
		return;
	}
	int mid = (tl + tr) / 2;
	if(poz <= mid)update(v * 2, tl, mid, poz, vre);
	else update(v * 2 + 1, mid + 1, tr, poz, vre);
	bor[v] = max(bor[v * 2], bor[v * 2 + 1]);
}

int k_th(int v, int tl, int tr, int x) {
	if(tl == tr)return tl;
	int mid = (tl + tr) / 2;
	if(bor[v * 2 + 1] >= x)return k_th(v * 2 + 1, mid + 1, tr, x);
	return k_th(v * 2, tl, mid, x);
}

int main() {
	ios::sync_with_stdio(false);
	cout.tie(nullptr);
	cin.tie(nullptr);
	cin >> n;
	ff(i,1,n)ff(j,0,2)cin >> niz[i][j];

	ff(i,1,n) {
		G[i] = G[i - 1] + niz[i][1];
		E[i] = E[i - 1] + niz[i][2];
		update(1,1,n,i,E[i] - niz[i][0]);
	}

	int rez = 0;
	ff(i,1,n) {
		int poz = k_th(1,1,n,E[i - 1] - niz[i][0]);
		rez = max(rez, G[poz] - G[i - 1]);
	}

	cout << rez << endl;
	return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 368 KB Output is correct
17 Incorrect 2 ms 364 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 368 KB Output is correct
17 Incorrect 2 ms 364 KB Output isn't correct
18 Halted 0 ms 0 KB -