oj.uz

답안 #108059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108059 2019-04-27T04:53:55 Z aer0park XCorr (KOI18_XCorr) C++14
0 / 100
 4 ms 512 KB 
#include <bits/stdc++.h>
#define f first
#define s second

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pi;

ll n,m,mx,mn,anw;
vector<pi> px,y;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(int i=0;i<n;i++)
	{
		ll a,b;cin>>a>>b;
		if(i==0)
			px.push_back({a,b});
		else
			px.push_back({a,px[i-1].s+b});
	}	
	cin>>m;
	for(int i=0;i<m;i++)
	{
		ll a,b;cin>>a>>b;
		y.push_back({a,b});
	}	
	cin>>mn>>mx;
	for(int i=0;i<m;i++)
	{
		ll nw=y[i].f,nv=y[i].s,a=0,b=0;
		if(nw+mn>=0)
			a=lower_bound(px.begin(),px.end(),pi(nw+mn,0))-px.begin();
		if(nw+mx>=0)
		{
			b=upper_bound(px.begin(),px.end(),pi(nw+mx,1e11))-px.begin();
			if(b==0&&px[b].first>nw+mx)
				continue;
			b-=1;
		}
		else
			continue;
		if(a!=0)
			anw+=nv*(px[b].second-px[a-1].second);
		if(a==0)
			anw+=nv*px[b].second;
	}
	cout<<anw;
	return 0;
}

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Incorrect 3 ms 512 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Incorrect 3 ms 512 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Incorrect 3 ms 512 KB Output isn't correct
3 Halted 0 ms 0 KB -