Submission #2599987

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <array>
#include <list>
#include <stack>
#include <valarray>

using namespace std;

typedef unsigned uint;
typedef long long Int;
typedef unsigned long long UInt;

const int INF = 1001001001;
const Int INFLL = 1001001001001001001LL;

template<typename T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<typename T> void chmin(T& a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T& a, T b) { if (a < b) a = b; }
int in() { int x; scanf("%d", &x); return x; }
double fin() { double x; scanf("%lf", &x); return x; }
Int lin() { Int x; scanf("%lld", &x); return x; }

Int Y, W, N, M, D, A[100050], B[100050], C[100050];
vector<Int> Bs[100050];

map<Int, int> MP;
Int res = 0;

inline Int prv(Int d) {
  auto it = MP.lower_bound(d);
  return (--it)->first;
}
inline Int nxt(Int d) {
  return MP.upper_bound(d)->first;
}

void add(Int d) {
  ++MP[d];
  if (MP[d] > 1) return;

  Int pr = prv(d);
  Int nx = nxt(d);
  if (nx - pr <= D + 1) return;

  ++res;
  if (nx - d <= D + 1) res += (nx - d - 1);
  if (d - pr <= D + 1) res += (d - pr - 1);
}

void rmv(Int d) {
  --MP[d];
  if (MP[d] > 0) return;

  Int pr = prv(d);
  Int nx = nxt(d);
  MP.erase(d);
  if (nx - pr <= D + 1) return;

  --res;
  if (nx - d <= D + 1) res -= (nx - d - 1);
  if (d - pr <= D + 1) res -= (d - pr - 1);  
}

int main() {
  Y = lin();
  W = lin();
  N = lin();
  M = lin();
  D = lin();
  for (int i = 0; i < N; ++i) {
    A[i] = lin() - 1;
  }
  for (int i = 0; i < M; ++i) {
    B[i] = lin() - 1;
    C[i] = lin() - 1;
    Bs[C[i]].push_back(B[i]);
  }

  MP[-INFLL] = 1;
  MP[INFLL] = 1;
  for (int i = 0; i < N; ++i) {
    add(A[i]);
  }
  for (int i = 0; i < M; ++i) {
    add(B[i] * W + C[i]);
  }

  for (int off = 0; off < W; ++off) {
    printf("%lld\n", res);
    for (int i = 0; i < N; ++i) {
      rmv(A[i] + off);
      add(A[i] + off + 1);
    }
    for (const Int b : Bs[off]) {
      rmv(b * W + off);
      add((b + 1) * W + off);
    }
  }

  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int in()’:
./Main.cpp:34:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 int in() { int x; scanf("%d", &x); return x; }
                                  ^
./Main.cpp: In function ‘double fin()’:
./Main.cpp:35:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 double fin() { double x; scanf("%lf", &x); return x; }
                                          ^
./Main.cpp: In function ‘Int lin()’:
./Main.cpp:36:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 Int lin() { Int x; scanf("%lld", &x); return x; }
                                     ^

Judge Result