Submission #39858312

---

Source Code Expand

#include <iostream>
#define N 110000
#define ll long long
using namespace std;
struct node {
  ll l, r;
  int v;
} a[N], b[N];
int n, m;
ll c(node a, node b) {
  ll L = max(a.l, b.l), R = min(a.r, b.r);
  if (L <= R)
    return R - L + 1;
  else
    return 0;
}
int main() {
  ll L;
  cin >> L >> n >> m;
  ll tot = 0;
  for (int i = 1; i <= n; i++) {
    ll len;
    cin >> a[i].v >> len;
    a[i].l = tot + 1, a[i].r = tot + len;
    tot += len;
  }
  tot = 0;
  for (int i = 1; i <= m; i++) {
    ll len;
    cin >> b[i].v >> len;
    b[i].l = tot + 1, b[i].r = tot + len;
    tot += len;
  }
  ll ans = 0;
  for (int i = 1, j = 1; i <= n; i++) {
    if (a[i].v == b[j].v)
      ans += c(a[i], b[j]);
    while (j + 1 <= m && b[j].r <= a[i].r) {
      j++;
      if (a[i].v == b[j].v)
        ans += c(a[i], b[j]);
    }
  }
  cout << ans << '\n';
  return 0;
}

Submission Info

Judge Result