Submission #74835371

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int,int>;
using PL = pair<ll,ll>;
template <class T>
using PQ = priority_queue<T>;
template <class T>
using PQG = priority_queue<T, vector<T>, greater<T>>;
using v = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vp = vector<P>;
using vpl = vector<PL>;
using vv = vector<vector<int>>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep1(i,n) for (int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define endl '\n'
template <class T>
bool chmax(T& a, const T& b) {return (a < b ? (a = b, true) : false);}
template <class T>
bool chmin(T& a, const T& b) {return (a > b ? (a = b, true) : false);}
const int INF = 2e9;
const ll LINF = 2e18;
const vector<int> di = {0,-1,1,0}, dj = {1,0,0,-1};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t, x;
  cin >> t >> x;
  int rec;
  cin >> rec;
  cout << 0 << " " << rec << "\n";
  rep(i,t) {
    int a;
    cin >> a;
    if(abs(rec-a) >= x) {
      rec = a;
      cout << i+1 << " " << rec << "\n";
    }
  }
  return 0;
}

Submission Info

Judge Result