oj.uz

답안 #347110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347110 2021-01-11T20:06:00 Z YJU Two Dishes (JOI19_dishes) C++14
10 / 100
 10000 ms 47248 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e6+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
 
ll n,m,a[N],s[N],p[N],b[N],t[N],q[N],ans,f[N];
vector<ll> ea[N],lis;
set<ll> ms;
 
int main(){
	//ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	REP1(i,n)cin>>a[i]>>s[i]>>p[i],a[i]+=a[i-1];
	REP1(i,m)cin>>b[i]>>t[i]>>q[i],b[i]+=b[i-1];
	
	REP1(i,m){
		ea[lwb(a,a+n+1,t[i]-b[i]+1)-a+1].pb(i);
	}
	
	REP1(i,m)f[i]=(i==1?-INF:0)-q[i],ans+=q[i]/*,ms.insert(i),lis.pb(i)*/;
	
	REP1(i,n+1){
		
		for(auto j:ea[i])f[j]+=q[j],ans-=q[j]/*,lis.pb(j),ms.insert(j)*/;
		
		REP1(j,m){
			//cout<<f[j]<<(j==m?"\n":" ");
			if(f[j]<0){f[j+1]+=f[j];f[j]=0;}
		}
		
		//REP1(j,m)cout<<f[j]<<(j==m?"\n":" ");
		
		//lis.resize(unique(lis.begin(),lis.end())-lis.begin());
		
		//REP1(j,m)cout<<f[j]<<(j==m?"\n":" ");
		lis.clear();
		if(i==n+1)break;
		ll id=lwb(b+1,b+m+1,s[i]-a[i]+1)-b;
		if(s[i]-a[i]<b[0])id=0;
		f[0]+=p[i];f[id]-=p[i];
		/*lis.pb(1);lis.pb(id);
		ms.insert(1);ms.insert(id);*/
	}
	
	REP(i,m+1)ans+=f[i];
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10033 ms 39792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 24044 KB Output is correct
4 Correct 16 ms 23916 KB Output is correct
5 Correct 19 ms 23916 KB Output is correct
6 Correct 18 ms 23916 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 16 ms 23916 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 16 ms 23916 KB Output is correct
14 Correct 16 ms 23936 KB Output is correct
15 Correct 16 ms 23916 KB Output is correct
16 Correct 18 ms 23916 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 24044 KB Output is correct
4 Correct 16 ms 23916 KB Output is correct
5 Correct 19 ms 23916 KB Output is correct
6 Correct 18 ms 23916 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 16 ms 23916 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 16 ms 23916 KB Output is correct
14 Correct 16 ms 23936 KB Output is correct
15 Correct 16 ms 23916 KB Output is correct
16 Correct 18 ms 23916 KB Output is correct
17 Correct 33 ms 24044 KB Output is correct
18 Correct 24 ms 24044 KB Output is correct
19 Correct 24 ms 24300 KB Output is correct
20 Correct 24 ms 24044 KB Output is correct
21 Correct 26 ms 24044 KB Output is correct
22 Correct 23 ms 24044 KB Output is correct
23 Correct 23 ms 24044 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 24044 KB Output is correct
4 Correct 16 ms 23916 KB Output is correct
5 Correct 19 ms 23916 KB Output is correct
6 Correct 18 ms 23916 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 16 ms 23916 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 16 ms 23916 KB Output is correct
14 Correct 16 ms 23936 KB Output is correct
15 Correct 16 ms 23916 KB Output is correct
16 Correct 18 ms 23916 KB Output is correct
17 Correct 33 ms 24044 KB Output is correct
18 Correct 24 ms 24044 KB Output is correct
19 Correct 24 ms 24300 KB Output is correct
20 Correct 24 ms 24044 KB Output is correct
21 Correct 26 ms 24044 KB Output is correct
22 Correct 23 ms 24044 KB Output is correct
23 Correct 23 ms 24044 KB Output is correct
24 Execution timed out 10078 ms 47248 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 24044 KB Output is correct
4 Correct 16 ms 23916 KB Output is correct
5 Correct 19 ms 23916 KB Output is correct
6 Correct 18 ms 23916 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 16 ms 23916 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 16 ms 23916 KB Output is correct
14 Correct 16 ms 23936 KB Output is correct
15 Correct 16 ms 23916 KB Output is correct
16 Correct 18 ms 23916 KB Output is correct
17 Correct 33 ms 24044 KB Output is correct
18 Correct 24 ms 24044 KB Output is correct
19 Correct 24 ms 24300 KB Output is correct
20 Correct 24 ms 24044 KB Output is correct
21 Correct 26 ms 24044 KB Output is correct
22 Correct 23 ms 24044 KB Output is correct
23 Correct 23 ms 24044 KB Output is correct
24 Execution timed out 10078 ms 47248 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 24044 KB Output is correct
4 Correct 16 ms 23916 KB Output is correct
5 Correct 19 ms 23916 KB Output is correct
6 Correct 18 ms 23916 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 16 ms 23916 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 16 ms 23916 KB Output is correct
14 Correct 16 ms 23936 KB Output is correct
15 Correct 16 ms 23916 KB Output is correct
16 Correct 18 ms 23916 KB Output is correct
17 Correct 33 ms 24044 KB Output is correct
18 Correct 24 ms 24044 KB Output is correct
19 Correct 24 ms 24300 KB Output is correct
20 Correct 24 ms 24044 KB Output is correct
21 Correct 26 ms 24044 KB Output is correct
22 Correct 23 ms 24044 KB Output is correct
23 Correct 23 ms 24044 KB Output is correct
24 Execution timed out 10078 ms 47248 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10033 ms 39792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10033 ms 39792 KB Time limit exceeded
2 Halted 0 ms 0 KB -