oj.uz

Submission #793007

# Submission time Handle Problem Language Result Execution time Memory
793007 2023-07-25T12:21:51 Z bane Pinball (JOI14_pinball) C++17
51 / 100
 1000 ms 458992 KB 
#include<bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "algo/debug.h"
#else 
#define debug(...) 42
#endif 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
int n, m;

struct Sparse{
	vector<long long>t{(long long)1e16};
	vector<long long>lazy{(long long)1e16};
	vector<int>L{-1},R{-1};

	inline void expand(int k, int l, int r){
		if (l != r){
			if (L[k] == -1){
				L.push_back(-1);
				R.push_back(-1);
				t.push_back((long long)1e16);
				lazy.push_back((long long)1e16);
				L[k] = (int)t.size() - 1;
			}
			if (R[k] == -1){
				L.push_back(-1);
				R.push_back(-1);
				t.push_back((long long)1e16);
				R[k] = (int)t.size() - 1;
				lazy.push_back((long long)1e16);
			}
		}
	}

	inline void propagate(int k, int l, int r){
		t[k] = min(t[k], lazy[k]);
		if (l != r){
			lazy[L[k]] = min(lazy[k], lazy[L[k]]);
			lazy[R[k]] = min(lazy[R[k]], lazy[k]);
		}
		lazy[k] = (long long)1e16;
	}

	inline void range_update(int a, int b, long long cost, int l = 1, int r = n, int k = 0){
		if (a > b)return;
		expand(k,l,r);
		propagate(k,l,r);
		//cout << k << " " << L[k] << " " << R[k] << endl;
		if (l >= a && r <= b){
			lazy[k] = cost;
			propagate(k,l,r);
			return;
		}
		if (l > b || r < a)return;
		int mid = (l+r) / 2;
		range_update(a,b,cost,l,mid,L[k]);
		range_update(a,b,cost,mid+1,r,R[k]);
	}

	inline long long query(int a, int l = 1, int r = n, int k = 0){
		if (a < 1)return 0LL;
		if (a > n)return 0LL;
		expand(k,l,r);
		propagate(k,l,r);
		if (l == r){
			return t[k];
		}
		int mid = (l+r) >> 1;
		if (a <= mid)
			return query(a,l,mid,L[k]);
		else
			return query(a,mid+1,r,R[k]);
	}
} st, st2;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> m >> n;
	long long ans = (long long)1e16;
	for (int i = 0; i < m; i++){
		long long a,b,c,d;
		cin >> a >> b >> c >> d;
		//it ends here
		long long CostLeft = st.query(a-1);	
		long long CostRight = st2.query(b+1);
		ans = min(ans, CostLeft + CostRight + d);
	//	cout << CostLeft << " " << CostRight << " " << c + 1 << endl;
		long long CoverLeft = CostLeft + d;
		long long CoverRight = CostRight + d;
		st.range_update(a,c-1,CoverLeft);
		st2.range_update(c+1,b, CoverRight);
	}
	cout << (ans == (long long)1e16 ? -1 : ans) << endl;
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1816 KB Output is correct
13 Correct 2 ms 1860 KB Output is correct
14 Correct 2 ms 1904 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1816 KB Output is correct
13 Correct 2 ms 1860 KB Output is correct
14 Correct 2 ms 1904 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 1580 KB Output is correct
17 Correct 6 ms 3748 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 7 ms 6424 KB Output is correct
20 Correct 5 ms 2868 KB Output is correct
21 Correct 2 ms 2120 KB Output is correct
22 Correct 6 ms 5920 KB Output is correct
23 Correct 8 ms 8588 KB Output is correct
24 Correct 9 ms 8748 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1816 KB Output is correct
13 Correct 2 ms 1860 KB Output is correct
14 Correct 2 ms 1904 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 1580 KB Output is correct
17 Correct 6 ms 3748 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 7 ms 6424 KB Output is correct
20 Correct 5 ms 2868 KB Output is correct
21 Correct 2 ms 2120 KB Output is correct
22 Correct 6 ms 5920 KB Output is correct
23 Correct 8 ms 8588 KB Output is correct
24 Correct 9 ms 8748 KB Output is correct
25 Correct 38 ms 11716 KB Output is correct
26 Correct 163 ms 60296 KB Output is correct
27 Correct 492 ms 140876 KB Output is correct
28 Correct 262 ms 3200 KB Output is correct
29 Correct 400 ms 147852 KB Output is correct
30 Correct 457 ms 34732 KB Output is correct
31 Correct 863 ms 263744 KB Output is correct
32 Correct 752 ms 189428 KB Output is correct
33 Correct 81 ms 48124 KB Output is correct
34 Correct 409 ms 203628 KB Output is correct
35 Correct 607 ms 388268 KB Output is correct
36 Execution timed out 1022 ms 458992 KB Time limit exceeded
37 Halted 0 ms 0 KB -