oj.uz

Submission #546943

# Submission time Handle Problem Language Result Execution time Memory
546943 2022-04-09T03:59:15 Z NhatMinh0208 Fuel Station (NOI20_fuelstation) C++14
13 / 100
 190 ms 38400 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
// template<typename T>
// __attribute__((always_inline)) void chkmin(T& a, const T& b) {
//     a=(a<b)?a:b;
// }

// template<typename T>
// __attribute__((always_inline)) void chkmax(T& a, const T& b) {
//     a=(a>b)?a:b;
// }
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
ll star[300011];
struct seg {
	ll val[1050000];
	ll lz[1050000];
	void reset(int c, int l, int r) {
		lz[c]=0;
		if (l==r) {
			val[c]=star[l];
		}
		else {
			int mid=(l+r)/2;
			reset((c<<1),l,mid);
			reset((c<<1)+1,mid+1,r);
			val[c]=min(val[(c<<1)],val[(c<<1)+1]);
		}
	}
	void fl(int c) {
		val[(c<<1)]+=lz[c];
		val[(c<<1)+1]+=lz[c];
		lz[(c<<1)]+=lz[c];
		lz[(c<<1)+1]+=lz[c];
	}
	void upd(int c, int l, int r, int tl, int tr, ll x) {
		if (l>tr || r<tl) return;
		if (l>=tl && r<=tr) {
			val[c]+=x;
			lz[c]+=x;
		}
		else {
			fl(c);
			int mid=(l+r)/2;
			upd((c<<1),l,mid,tl,tr,x);
			upd((c<<1)+1,mid+1,r,tl,tr,x);
			val[c]=min(val[(c<<1)],val[(c<<1)+1]);
		}
	}
	ll get(int c, int l, int r, int tl, int tr) {
		if (l>tr || r<tl) return 0;
		if (l>=tl && r<=tr) {
			return val[c];
		}
		else {
			fl(c);
			int mid=(l+r)/2;
			ll a = get((c<<1),l,mid,tl,tr);
			ll b = get((c<<1)+1,mid+1,r,tl,tr);
			return min(a,b);
		}
	}
};
seg st;

vector<int> vec;
vector<piii(ll)> stats;
ll n,m,i,j,k,t,t1,u,v,a,b;
int main()
{
	fio;
	cin>>n>>m;
	for (i=1;i<=n;i++) {
		cin>>u>>a>>b;
		stats.push_back({u,{a,b}});
	}
	stats.push_back({n,{0,1e10}});
	sort(stats.begin(), stats.end());
	for (i=0;i<=n;i++) vec.push_back(i);
	sort(vec.begin(), vec.end(), [](int a, int b){
		return (stats[a].p3<stats[b].p3);
	});
	u=0;
	for (i=0;i<=n;i++) {
		star[i]=u-stats[i].p1;
		// cout<<star[i]<<' ';
		u+=stats[i].p2;
	}
	// cout<<endl;
	st.reset(1,0,n);
	for (i=0;i<=n;i++) {
		a=-st.val[1];
		if (i) a=max(a,stats[vec[i-1]].p3+1);
		if (a<=stats[vec[i]].p3) {
			return cout<<a,0;
		}
		st.upd(1,0,n,vec[i]+1,n,-stats[vec[i]].p2);
	}
}
// a;

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 37804 KB Output is correct
2 Correct 149 ms 37784 KB Output is correct
3 Correct 156 ms 37688 KB Output is correct
4 Correct 146 ms 37788 KB Output is correct
5 Correct 151 ms 38332 KB Output is correct
6 Correct 169 ms 37092 KB Output is correct
7 Correct 149 ms 37064 KB Output is correct
8 Correct 153 ms 37616 KB Output is correct
9 Correct 158 ms 38300 KB Output is correct
10 Correct 144 ms 37040 KB Output is correct
11 Correct 160 ms 37144 KB Output is correct
12 Correct 153 ms 37688 KB Output is correct
13 Correct 146 ms 37172 KB Output is correct
14 Correct 190 ms 37732 KB Output is correct
15 Correct 151 ms 37736 KB Output is correct
16 Correct 150 ms 38344 KB Output is correct
17 Correct 161 ms 38400 KB Output is correct
18 Correct 150 ms 37712 KB Output is correct
19 Correct 153 ms 37700 KB Output is correct
20 Correct 189 ms 37692 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -