#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> py,x;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
py.push_back({-1e10,0});
for(int i=0;i<n;i++)
{
ll a,b;cin>>a>>b;
x.push_back({a,b});
}
cin>>m;
for(int i=0;i<m;i++)
{
ll a,b;cin>>a>>b;
py.push_back({a,py[i].s+b});
}
cin>>mn>>mx;
for(int i=0;i<m;i++)
{
ll nw=x[i].f,nv=x[i].s,a=1,b=0;
if(nw+mx<0)
continue;
b=upper_bound(py.begin(),py.end(),pi(nw+mx,1e11))-py.begin();
if(nw+mn>=0)
a=lower_bound(py.begin(),py.end(),pi(nw+mn,-1e11))-py.begin();
anw+=nv*(py[b-1].s-py[a-1].s);
}
cout<<anw;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Incorrect |
4 ms |
512 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Incorrect |
4 ms |
512 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
512 KB |
Output is correct |
2 |
Incorrect |
4 ms |
512 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |