oj.uz

답안 #914062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914062 2024-01-21T01:47:31 Z cig32 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 1560 ms 179912 KB 
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define double long double
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
static void run_with_stack_size(void (*func)(void), size_t stsize) {
  char *stack, *send;
  stack = (char *)malloc(stsize);
  send = stack + stsize - 16;
  send = (char *)((uintptr_t)send / 16 * 16);
  asm volatile(
    "mov %%rsp, (%0)\n"
    "mov %0, %%rsp\n"
    :
    : "r"(send));
  func();
  asm volatile("mov (%0), %%rsp\n" : : "r"(send));
  free(stack);
}
struct segtree_basic {
  struct node {
    int lazyval, mi, ma, sum; char lazytag;
    int len; // not changing
  };
  int stok;
  vector<node> st;
  void bu(int l, int r, int idx) {
    st[idx].lazyval = st[idx].mi = st[idx].ma = st[idx].sum = 0;
    st[idx].lazytag = '?';
    st[idx].len = r - l + 1;
    if(l == r) {
      return;
    }
    int mid = (l + r) >> 1;
    bu(l, mid, 2*idx+1);
    bu(mid+1, r, 2*idx+2);
  }
  void push_down(int idx) {
    if(st[idx].lazytag == '?') return;
    if(st[idx].lazytag == ':') {
      st[2*idx+1].lazyval = st[idx].lazyval;
      st[2*idx+1].mi = st[idx].lazyval;
      st[2*idx+1].ma = st[idx].lazyval;
      st[2*idx+1].sum = st[idx].lazyval * st[2*idx+1].len;
      st[2*idx+1].lazytag = ':';
 
      st[2*idx+2].lazyval = st[idx].lazyval;
      st[2*idx+2].mi = st[idx].lazyval;
      st[2*idx+2].ma = st[idx].lazyval;
      st[2*idx+2].sum = st[idx].lazyval * st[2*idx+2].len;
      st[2*idx+2].lazytag = ':';
 
    }
    else {
      st[2*idx+1].lazyval += st[idx].lazyval;
      st[2*idx+1].mi += st[idx].lazyval;
      st[2*idx+1].ma += st[idx].lazyval;
      st[2*idx+1].sum += st[idx].lazyval * st[2*idx+1].len;
      st[2*idx+1].lazytag = (st[2*idx+1].lazytag == ':' ? ':' : '+');
 
      st[2*idx+2].lazyval += st[idx].lazyval;
      st[2*idx+2].mi += st[idx].lazyval;
      st[2*idx+2].ma += st[idx].lazyval;
      st[2*idx+2].sum += st[idx].lazyval * st[2*idx+2].len;
      st[2*idx+2].lazytag = (st[2*idx+2].lazytag == ':' ? ':' : '+');
    }
    st[idx].lazytag = '?';
    st[idx].lazyval = 0;
  }
  void push_up(int idx) {
    st[idx].mi = min(st[2*idx+1].mi, st[2*idx+2].mi);
    st[idx].ma = max(st[2*idx+1].ma, st[2*idx+2].ma);
    st[idx].sum = st[2*idx+1].sum + st[2*idx+2].sum;
  }
  void u1(int l, int r, int constl, int constr, int idx, int val) { // range := v
    if(l <= constl && constr <= r) {
      st[idx].lazyval = val;
      st[idx].mi = val;
      st[idx].ma = val;
      st[idx].sum = val * st[idx].len;
      st[idx].lazytag = ':';
      return;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) u1(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) u1(l, r, constl, mid, 2*idx+1, val);
    else {
      u1(l, r, constl, mid, 2*idx+1, val);
      u1(l, r, mid+1, constr, 2*idx+2, val);
    }
    push_up(idx);
  }
 
  void u2(int l, int r, int constl, int constr, int idx, int val) { // range += v
    if(l <= constl && constr <= r) {
      st[idx].lazyval += val;
      st[idx].mi += val;
      st[idx].ma += val;
      st[idx].sum += val * st[idx].len;
      st[idx].lazytag = (st[idx].lazytag == ':' ? ':' : '+');
      return;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) u2(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) u2(l, r, constl, mid, 2*idx+1, val);
    else {
      u2(l, r, constl, mid, 2*idx+1, val);
      u2(l, r, mid+1, constr, 2*idx+2, val);
    }
    push_up(idx);
  }
 
  int qu1(int l, int r, int constl, int constr, int idx) { // range min
    if(l <= constl && constr <= r) return st[idx].mi;
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu1(l, r, mid+1, constr, 2*idx+2);
    else if(constr < l || r < mid + 1) return qu1(l, r, constl, mid, 2*idx+1);
    else {
      return min(qu1(l, r, constl, mid, 2*idx+1), qu1(l, r, mid+1, constr, 2*idx+2));
    }
  }
 
  int qu2(int l, int r, int constl, int constr, int idx) { // range max
    if(l <= constl && constr <= r) return st[idx].ma;
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu2(l, r, mid+1, constr, 2*idx+2); 
    else if(constr < l || r < mid + 1) return qu2(l, r, constl, mid, 2*idx+1);
    else {
      return max(qu2(l, r, constl, mid, 2*idx+1), qu2(l, r, mid+1, constr, 2*idx+2));
    }
  }
  int qu3(int l, int r, int constl, int constr, int idx) { // range sum
    if(l <= constl && constr <= r) return st[idx].sum;
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu3(l, r, mid+1, constr, 2*idx+2);
    else if(constr < l || r < mid + 1) return qu3(l, r, constl, mid, 2*idx+1);
    else {
      return qu3(l, r, constl, mid, 2*idx+1) + qu3(l, r, mid+1, constr, 2*idx+2);
    }
  }
  int qu4(int l, int r, int constl, int constr, int idx, int val) { // first at least v
    if(l <= constl && constr <= r) {
      if(st[idx].ma < val) return -1;
      while(constl < constr) {
        int mid = (constl + constr) >> 1;
        push_down(idx);
        if(st[2*idx+1].ma >= val) constr = mid, idx = 2*idx + 1;
        else constl = mid+1, idx = 2*idx + 2;
      }
      return constl;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu4(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) return qu4(l, r, constl, mid, 2*idx+1, val);
    else {
      int lchild = qu4(l, r, constl, mid, 2*idx+1, val);
      if(lchild != -1) return lchild;
      return qu4(l, r, mid+1, constr, 2*idx+2, val);
    }
  }
  int qu5(int l, int r, int constl, int constr, int idx, int val) { // first at most v
    if(l <= constl && constr <= r) {
      if(st[idx].mi > val) return -1;
      while(constl < constr) {
        int mid = (constl + constr) >> 1;
        push_down(idx);
        if(st[2*idx+1].mi <= val) constr = mid, idx = 2*idx + 1;
        else constl = mid+1, idx = 2*idx + 2;
      }
      return constl;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu5(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) return qu5(l, r, constl, mid, 2*idx+1, val);
    else {
      int lchild = qu5(l, r, constl, mid, 2*idx+1, val);
      if(lchild != -1) return lchild;
      return qu5(l, r, mid+1, constr, 2*idx+2, val);
    }
  }
  int qu6(int l, int r, int constl, int constr, int idx, int val) { // last at least v
    if(l <= constl && constr <= r) {
      if(st[idx].ma < val) return -1;
      while(constl < constr) {
        int mid = (constl + constr) >> 1;
        push_down(idx);
        if(st[2*idx+2].ma >= val) constl = mid+1, idx = 2*idx + 2;
        else constr = mid, idx = 2*idx + 1;
      }
      return constl;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu6(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) return qu6(l, r, constl, mid, 2*idx+1, val);
    else {
      int rchild = qu6(l, r, mid+1, constr, 2*idx+2, val);
      if(rchild != -1) return rchild;
      return qu6(l, r, constl, mid, 2*idx+1, val);
    }
  }
  int qu7(int l, int r, int constl, int constr, int idx, int val) { // last at most v
    if(l <= constl && constr <= r) {
      if(st[idx].mi > val) return -1;
      while(constl < constr) {
        int mid = (constl + constr) >> 1;
        push_down(idx);
        if(st[2*idx+2].mi <= val) constl = mid+1, idx = 2*idx + 2;
        else constr = mid, idx = 2*idx + 1;
      }
      return constl;
    }
    int mid = (constl + constr) >> 1;
    push_down(idx);
    if(mid < l || r < constl) return qu7(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr < l || r < mid + 1) return qu7(l, r, constl, mid, 2*idx+1, val);
    else {
      int rchild = qu7(l, r, mid+1, constr, 2*idx+2, val);
      if(rchild != -1) return rchild;
      return qu7(l, r, constl, mid, 2*idx+1, val);
    }
  }
  public:
  void resize(int k) {
    st.resize(4*k + 10);
    stok = k;
    bu(0, k, 0);
  }
  void range_assign(int l, int r, int v) { u1(l, r, 0, stok, 0, v); }
 
  void range_add(int l, int r, int v) { u2(l, r, 0, stok, 0, v); }
 
  int query_min(int l, int r) { return qu1(l, r, 0, stok, 0); }
 
  int query_max(int l, int r) { return qu2(l, r, 0, stok, 0); }
 
  int query_sum(int l, int r) { return qu3(l, r, 0, stok, 0); }
 
  int query_firstAtLeast(int l, int r, int v) { return qu4(l, r, 0, stok, 0, v); }
 
  int query_firstAtMost(int l, int r, int v) { return qu5(l, r, 0, stok, 0, v); }
 
  int query_lastAtLeast(int l, int r, int v) { return qu6(l, r, 0, stok, 0, v); } 
 
  int query_lastAtMost(int l, int r, int v) { return qu7(l, r, 0, stok, 0, v); }
};

struct segtree_small {
  struct node {
    int mn = 0, mx = 0;
  };
  vector<node> st;
  int stok;
  void u(int l, int r, int tar, int idx, int val) {
    if(l == r) {
      st[idx].mn = val;
      st[idx].mx = val;
      return;
    }
    int mid = (l + r) >> 1;
    if(tar <= mid) u(l, mid, tar, (idx<<1) + 1, val);
    else u(mid+1, r, tar, (idx<<1) + 2, val);
    st[idx].mn = min(st[(idx<<1) + 1].mn, st[(idx<<1) + 2].mn);
    st[idx].mx = max(st[(idx<<1) + 1].mx, st[(idx<<1) + 2].mx);
  }
  int qu1(int l, int r, int constl, int constr, int idx) {
    if(l <= constl && constr <= r) return st[idx].mn;
    int mid = (constl + constr) >> 1;
    if(mid < l || r < constl) return qu1(l, r, mid+1, constr, (idx<<1) + 2);
    else if(constr < l || r < mid+1) return qu1(l, r, constl, mid, (idx<<1) + 1);
    else return min(qu1(l, r, constl, mid, (idx<<1) + 1), qu1(l, r, mid+1, constr, (idx<<1) + 2));
  }
  int qu2(int l, int r, int constl, int constr, int idx) {
    if(l <= constl && constr <= r) return st[idx].mx;
    int mid = (constl + constr) >> 1;
    if(mid < l || r < constl) return qu2(l, r, mid+1, constr, (idx<<1) + 2);
    else if(constr < l || r < mid+1) return qu2(l, r, constl, mid, (idx<<1) + 1);
    else return max(qu2(l, r, constl, mid, (idx<<1) + 1), qu2(l, r, mid+1, constr, (idx<<1) + 2));
  }
  public:
  void resize(int k) {
    st.resize(4*k + 10);
    stok = k;
  }
  void upd(int i, int v) {
    u(0, stok, i, 0, v);
  }
  int query_min(int l, int r) {
    return qu1(l, r, 0, stok, 0);
  }
  int query_max(int l, int r) {
    return qu2(l, r, 0, stok, 0);
  }
};
bool cmp(pair<int, int> x, pair<int, int> y) {
  return x.second < y.second;
}

int msto[18][MAXN], psto[18][MAXN];

int M_query(int l, int r) {
  int k = 32 - __builtin_clz(r - l + 1) - 1;
  return max(msto[k][l], msto[k][r - (1<<k) + 1]);
}
int P_query(int l, int r) {
  int k = 32 - __builtin_clz(r - l + 1) - 1;
  return min(psto[k][l], psto[k][r - (1<<k) + 1]);
}
void solve(int tc) {
  int n, k, m;
  cin >> n >> k >> m;
  segtree_basic M, P;
  M.resize(n);
  P.resize(n);
  for(int i=1; i<=n; i++) {
    M.range_add(i, i, i);
    P.range_add(i, i, i);
  }
  vector<pair<int, int>> updates;
  for(int i=1; i<=m; i++) {
    int a, b;
    cin >> a >> b;
    updates.push_back({a, b});
  }
  sort(updates.begin(), updates.end(), cmp);
  for(pair<int, int> x: updates) {
    int a = x.first, b = x.second;
    if(a > b) continue;
    int l = a, r = min(b, a + k - 1);
    M.range_assign(l, r, b);
  }
  reverse(updates.begin(), updates.end());
  for(pair<int, int> x: updates) {
    int a = x.first, b = x.second;
    if(a < b) continue;
    int l = max(b, a - k + 1), r = a;
    P.range_assign(l, r, b);
  }
  pair<int, int> st[18][n+1];
  for(int i=1; i<=n; i++) {
    int v = M.query_sum(i, i);
    st[0][i].second = v;
    v = P.query_sum(i, i);
    st[0][i].first = v;
  }
  segtree_small susopen[18][2];
  for(int i=0; i<18; i++) {
    for(int j=0; j<2; j++) {
      susopen[i][j].resize(n);

    }
  }
  for(int i=1; i<=n; i++) {
    susopen[0][0].upd(i, st[0][i].first);
    susopen[0][1].upd(i, st[0][i].second);
  }
  for(int i=1; i<18; i++) {
    for(int j=1; j<=n; j++) {
      pair<int, int> bruh = st[i-1][j];
      int l = bruh.first, r = bruh.second;
      int newl = susopen[i-1][0].query_min(l, r);
      int newr = susopen[i-1][1].query_max(l, r);
      st[i][j].second = newr;
      susopen[i][1].upd(j, newr);
      st[i][j].first = newl;
      susopen[i][0].upd(j, newl);
    }
  }

  for(int i=1; i<=n; i++) {
    msto[0][i] = M.query_sum(i, i);
    psto[0][i] = P.query_sum(i, i);
  }
  for(int i=1; i<18; i++) {
    for(int j=1; j+(1<<i)-1<=n; j++) {
      msto[i][j] = max(msto[i-1][j], msto[i-1][j+(1<<(i-1))]);
      psto[i][j] = min(psto[i-1][j], psto[i-1][j+(1<<(i-1))]);
    }
  }
  int q;
  cin >> q;
  while(q--) {
    int s, t;
    cin >> s >> t;
    if((M_query(s, s) >= t && s < t) || (P_query(s, s) <= t && s > t)) {
      cout << "1\n"; continue;
    }
    int l = s, r = s, S = 0;
    for(int i=17; i>=0; i--) {
      int m1 = susopen[i][0].query_min(l, r);
      int m2 = susopen[i][1].query_max(l, r);
      int getl = P_query(m1, m2);
      int getr = M_query(m1, m2);
      if((s < t && getr < t) || (s > t && getl > t)) {
        S += (1 << i);
        l = m1;
        r = m2;
      }
    }
    S++;
    int m1 = susopen[0][0].query_min(l, r);
    int m2 = susopen[0][1].query_max(l, r);
    l = m1;
    r = m2;
    int getr = M_query(l, r);
    int getl = P_query(l, r);
    if((s < t && getr < t) || (s > t && getl > t)) S = 1e9;
    cout << (S >= 1e7 ? -1 : S + 1) << '\n';
  }

  //cout << st[0][9].first << ' ' << st[0][9].second << '\n';
  //cout << st[1][9].first << ' ' << st[1][9].second << '\n';
}
void uwu() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
int32_t main() {
  #ifdef ONLINE_JUDGE
  uwu();
  #endif
  #ifndef ONLINE_JUDGE
  run_with_stack_size(uwu, 1024 * 1024 * 1024); // run with a 1 GiB stack
  #endif
}
/*
g++ A.cpp -std=c++17 -O2 -o A
./A < input.txt
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 15192 KB Output is correct
2 Correct 5 ms 15196 KB Output is correct
3 Correct 5 ms 15196 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 4 ms 15196 KB Output is correct
6 Correct 4 ms 15448 KB Output is correct
7 Correct 4 ms 15196 KB Output is correct
8 Correct 4 ms 15196 KB Output is correct
9 Correct 4 ms 15192 KB Output is correct
10 Correct 1 ms 6652 KB Output is correct
11 Correct 4 ms 15196 KB Output is correct
12 Correct 4 ms 15192 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 15192 KB Output is correct
2 Correct 5 ms 15196 KB Output is correct
3 Correct 5 ms 15196 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 4 ms 15196 KB Output is correct
6 Correct 4 ms 15448 KB Output is correct
7 Correct 4 ms 15196 KB Output is correct
8 Correct 4 ms 15196 KB Output is correct
9 Correct 4 ms 15192 KB Output is correct
10 Correct 1 ms 6652 KB Output is correct
11 Correct 4 ms 15196 KB Output is correct
12 Correct 4 ms 15192 KB Output is correct
13 Correct 21 ms 21852 KB Output is correct
14 Correct 23 ms 24152 KB Output is correct
15 Correct 15 ms 21852 KB Output is correct
16 Correct 18 ms 21852 KB Output is correct
17 Correct 20 ms 21876 KB Output is correct
18 Correct 13 ms 21852 KB Output is correct
19 Correct 13 ms 21596 KB Output is correct
20 Correct 13 ms 21852 KB Output is correct
21 Correct 13 ms 21852 KB Output is correct
22 Correct 15 ms 23644 KB Output is correct
23 Correct 19 ms 23900 KB Output is correct
24 Correct 19 ms 22364 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 835 ms 173716 KB Output is correct
2 Correct 825 ms 175676 KB Output is correct
3 Correct 869 ms 174356 KB Output is correct
4 Correct 794 ms 175288 KB Output is correct
5 Correct 677 ms 176592 KB Output is correct
6 Correct 828 ms 174720 KB Output is correct
7 Correct 714 ms 175764 KB Output is correct
8 Correct 691 ms 172364 KB Output is correct
9 Correct 687 ms 174360 KB Output is correct
10 Correct 763 ms 176332 KB Output is correct
11 Correct 743 ms 176096 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1006 ms 174908 KB Output is correct
2 Correct 1081 ms 176704 KB Output is correct
3 Correct 1225 ms 175564 KB Output is correct
4 Correct 737 ms 175132 KB Output is correct
5 Correct 786 ms 175148 KB Output is correct
6 Correct 765 ms 174884 KB Output is correct
7 Correct 935 ms 176028 KB Output is correct
8 Correct 1202 ms 176056 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1129 ms 176568 KB Output is correct
2 Correct 1560 ms 175068 KB Output is correct
3 Correct 1507 ms 176340 KB Output is correct
4 Correct 1388 ms 174812 KB Output is correct
5 Correct 1057 ms 175836 KB Output is correct
6 Correct 1051 ms 174088 KB Output is correct
7 Correct 695 ms 175292 KB Output is correct
8 Correct 4 ms 15192 KB Output is correct
9 Correct 15 ms 21848 KB Output is correct
10 Correct 840 ms 177628 KB Output is correct
11 Correct 765 ms 176752 KB Output is correct
12 Correct 781 ms 175308 KB Output is correct
13 Correct 779 ms 177632 KB Output is correct
14 Correct 5 ms 15196 KB Output is correct
15 Correct 19 ms 21852 KB Output is correct
16 Correct 817 ms 177396 KB Output is correct
17 Correct 1387 ms 179912 KB Output is correct
18 Correct 1221 ms 179456 KB Output is correct
19 Correct 1073 ms 177892 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 15192 KB Output is correct
2 Correct 5 ms 15196 KB Output is correct
3 Correct 5 ms 15196 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 4 ms 15196 KB Output is correct
6 Correct 4 ms 15448 KB Output is correct
7 Correct 4 ms 15196 KB Output is correct
8 Correct 4 ms 15196 KB Output is correct
9 Correct 4 ms 15192 KB Output is correct
10 Correct 1 ms 6652 KB Output is correct
11 Correct 4 ms 15196 KB Output is correct
12 Correct 4 ms 15192 KB Output is correct
13 Correct 21 ms 21852 KB Output is correct
14 Correct 23 ms 24152 KB Output is correct
15 Correct 15 ms 21852 KB Output is correct
16 Correct 18 ms 21852 KB Output is correct
17 Correct 20 ms 21876 KB Output is correct
18 Correct 13 ms 21852 KB Output is correct
19 Correct 13 ms 21596 KB Output is correct
20 Correct 13 ms 21852 KB Output is correct
21 Correct 13 ms 21852 KB Output is correct
22 Correct 15 ms 23644 KB Output is correct
23 Correct 19 ms 23900 KB Output is correct
24 Correct 19 ms 22364 KB Output is correct
25 Correct 835 ms 173716 KB Output is correct
26 Correct 825 ms 175676 KB Output is correct
27 Correct 869 ms 174356 KB Output is correct
28 Correct 794 ms 175288 KB Output is correct
29 Correct 677 ms 176592 KB Output is correct
30 Correct 828 ms 174720 KB Output is correct
31 Correct 714 ms 175764 KB Output is correct
32 Correct 691 ms 172364 KB Output is correct
33 Correct 687 ms 174360 KB Output is correct
34 Correct 763 ms 176332 KB Output is correct
35 Correct 743 ms 176096 KB Output is correct
36 Correct 1006 ms 174908 KB Output is correct
37 Correct 1081 ms 176704 KB Output is correct
38 Correct 1225 ms 175564 KB Output is correct
39 Correct 737 ms 175132 KB Output is correct
40 Correct 786 ms 175148 KB Output is correct
41 Correct 765 ms 174884 KB Output is correct
42 Correct 935 ms 176028 KB Output is correct
43 Correct 1202 ms 176056 KB Output is correct
44 Correct 1129 ms 176568 KB Output is correct
45 Correct 1560 ms 175068 KB Output is correct
46 Correct 1507 ms 176340 KB Output is correct
47 Correct 1388 ms 174812 KB Output is correct
48 Correct 1057 ms 175836 KB Output is correct
49 Correct 1051 ms 174088 KB Output is correct
50 Correct 695 ms 175292 KB Output is correct
51 Correct 4 ms 15192 KB Output is correct
52 Correct 15 ms 21848 KB Output is correct
53 Correct 840 ms 177628 KB Output is correct
54 Correct 765 ms 176752 KB Output is correct
55 Correct 781 ms 175308 KB Output is correct
56 Correct 779 ms 177632 KB Output is correct
57 Correct 5 ms 15196 KB Output is correct
58 Correct 19 ms 21852 KB Output is correct
59 Correct 817 ms 177396 KB Output is correct
60 Correct 1387 ms 179912 KB Output is correct
61 Correct 1221 ms 179456 KB Output is correct
62 Correct 1073 ms 177892 KB Output is correct
63 Correct 1286 ms 176536 KB Output is correct
64 Correct 1453 ms 176876 KB Output is correct
65 Correct 1265 ms 175484 KB Output is correct
66 Correct 809 ms 179000 KB Output is correct
67 Correct 1338 ms 179740 KB Output is correct
68 Correct 980 ms 177168 KB Output is correct
69 Correct 793 ms 178728 KB Output is correct
70 Correct 1067 ms 178464 KB Output is correct
71 Correct 1309 ms 178568 KB Output is correct