oj.uz

Submission #82859

# Submission time Handle Problem Language Result Execution time Memory
82859 2018-11-02T08:54:59 Z chunghan None (KOI18_XCorr) C++17
0 / 100
 4 ms 712 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long int lld;
typedef pair<int, lld> pil;

int N, M;
lld presum[300005], Xi[300005], X[300005], Yi[300005], Y[300005];
lld rst, a, b;

void input() {
    cin >> N;
    for(int i = 1; i <= N; i++) cin >> Xi[i] >> X[i];
    cin >> M;
    for(int i = 1; i <= M; i++) cin >> Yi[i] >> Y[i];
    cin >> a >> b;
}

void f() {
    for(int i = 1; i <= M; i++) presum[i] = Y[i] + presum[i-1];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    input();
    f();
    int rst = 0;
    for(int i = 1; i <= N; i++) {
        int tmp = presum[upper_bound(Yi+1, Yi+M+1, Xi[i] + b) - Yi - 1] - presum[lower_bound(Yi+1, Yi+M+1, Xi[i]+a) - Yi - 1];
        rst += tmp*X[i];
    }
    cout << rst;
    return 0;
}

Subtask #1
0 / 19.0

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

Subtask #2
0 / 42.0

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

Subtask #3
0 / 39.0

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