oj.uz

답안 #1017007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017007 2024-07-08T17:03:43 Z MilosMilutinovic Progression (NOI20_progression) C++14
100 / 100
 1259 ms 236372 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int MAX = 300300;
const long long inf = (long long) 1e18;
 
struct Value { 
  struct Node {
    long long sum;
    long long coeff;
    long long sum_set;
    long long coeff_set;
    long long sum_add;
    long long coeff_add;
    Node(long long _sum = 0, long long _coeff = 0) : sum(_sum), coeff(_coeff) {
      sum_set = coeff_set = inf;
      sum_add = coeff_add = 0;
    }
  };
 
  int n;
  Node st[8 * MAX];
 
  void Push(int id) {
    if (st[id].sum_set == inf) {
      st[id * 2].sum += st[id].sum_add;
      st[id * 2].coeff += st[id].coeff_add;
      st[id * 2 + 1].sum += st[id].sum_add;
      st[id * 2 + 1].coeff += st[id].coeff_add;
      st[id * 2].sum_add += st[id].sum_add;
      st[id * 2].coeff_add += st[id].coeff_add;
      st[id * 2 + 1].sum_add += st[id].sum_add;
      st[id * 2 + 1].coeff_add += st[id].coeff_add;
      st[id].sum_add = 0;
      st[id].coeff_add = 0;
    } else {
      st[id * 2].sum = st[id].sum_set + st[id].sum_add;
      st[id * 2].coeff = st[id].coeff_set + st[id].coeff_add;
      st[id * 2 + 1].sum = st[id].sum_set + st[id].sum_add;
      st[id * 2 + 1].coeff = st[id].coeff_set + st[id].coeff_add;
      st[id * 2].sum_set = st[id].sum_set;
      st[id * 2].coeff_set = st[id].coeff_set;
      st[id * 2].sum_add = st[id].sum_add;
      st[id * 2].coeff_add = st[id].coeff_add;
      st[id * 2 + 1].sum_set = st[id].sum_set;
      st[id * 2 + 1].coeff_set = st[id].coeff_set;
      st[id * 2 + 1].sum_add = st[id].sum_add;
      st[id * 2 + 1].coeff_add = st[id].coeff_add;
      st[id].sum_set = inf;
      st[id].coeff_set = inf;
      st[id].sum_add = 0;
      st[id].coeff_add = 0;
    }
  }
 
  void Add(int id, int l, int r, int ll, int rr, long long x, long long y) {
    if (ll <= l && r <= rr) {
      st[id].sum += x;
      st[id].coeff += y;
      st[id].sum_add += x;
      st[id].coeff_add += y;
      Push(id);
      return;
    }
    Push(id);
    int mid = (l + r) >> 1;
    if (rr <= mid) {
      Add(id * 2, l, mid, ll, rr, x, y);
    } else if (ll > mid) {
      Add(id * 2 + 1, mid + 1, r, ll, rr, x, y);
    } else {
      Add(id * 2, l, mid, ll, rr, x, y);
      Add(id * 2 + 1, mid + 1, r, ll, rr, x, y);
    }
    st[id].sum = st[id * 2].sum + st[id * 2 + 1].sum;
    st[id].coeff = st[id * 2].coeff + st[id * 2 + 1].coeff;
  }
 
  void Set(int id, int l, int r, int ll, int rr, long long x, long long y) {
    if (ll <= l && r <= rr) {
      st[id].sum = x;
      st[id].coeff = y;
      st[id].sum_set = x;
      st[id].coeff_set = y;
      st[id].sum_add = 0;
      st[id].coeff_add = 0;
      Push(id);
      return;
    }
    Push(id);
    int mid = (l + r) >> 1;
    if (rr <= mid) {
      Set(id * 2, l, mid, ll, rr, x, y);
    } else if (ll > mid) {
      Set(id * 2 + 1, mid + 1, r, ll, rr, x, y);
    } else {
      Set(id * 2, l, mid, ll, rr, x, y);
      Set(id * 2 + 1, mid + 1, r, ll, rr, x, y);
    }
    st[id].sum = st[id * 2].sum + st[id * 2 + 1].sum;
    st[id].coeff = st[id * 2].coeff + st[id * 2 + 1].coeff;
  }
 
  long long Query(int id, int l, int r, int p) {
    if (l == r) {
      return st[id].sum + st[id].coeff * p;
    }
    Push(id);
    int mid = (l + r) >> 1;
    long long res;
    if (p <= mid) {
      res = Query(id * 2, l, mid, p);
    } else {
      res = Query(id * 2 + 1, mid + 1, r, p);
    }
    st[id].sum = st[id * 2].sum + st[id * 2 + 1].sum;
    st[id].coeff = st[id * 2].coeff + st[id * 2 + 1].coeff;
    return res;
  }
 
  long long Get(int i) {
    return Query(1, 0, n - 1, i);
  }
} val;
 
struct Solver {
  struct Node {
    int len;
    int mx;
    int mx_l;
    int mx_r;
    long long val_l;
    long long val_r;
    long long lzy_add;
    long long lzy_set;
    Node() {
      lzy_set = inf;
      lzy_add = 0;
    }
  };
 
  Node Merge(Node a, Node b) {
    Node nd;
    nd.len = a.len + b.len;
    nd.mx = max(a.mx, b.mx);
    nd.mx_l = a.mx_l;
    nd.mx_r = b.mx_r;
    if (a.val_r == b.val_l) {
      nd.mx = max(nd.mx, a.mx_r + b.mx_l);
      if (a.mx_l == a.len) {
        nd.mx_l = max(nd.mx_l, a.len + b.mx_l);
      }
      if (b.mx_r == b.len) {
        nd.mx_r = max(nd.mx_r, a.mx_r + b.len);
      }
    }
    nd.val_l = a.val_l;
    nd.val_r = b.val_r;
    return nd;
  }
 
  Node st[8 * MAX];
 
  void Push(int id) {
    if (st[id].lzy_set == inf) {
      st[id * 2].val_l += st[id].lzy_add;
      st[id * 2].val_r += st[id].lzy_add;
      st[id * 2 + 1].val_l += st[id].lzy_add;
      st[id * 2 + 1].val_r += st[id].lzy_add;
      st[id * 2].lzy_add += st[id].lzy_add;
      st[id * 2 + 1].lzy_add += st[id].lzy_add;
      st[id].lzy_add = 0;
    } else {
      st[id * 2].val_l = st[id].lzy_set + st[id].lzy_add;
      st[id * 2].val_r = st[id].lzy_set + st[id].lzy_add;
      st[id * 2 + 1].val_l = st[id].lzy_set + st[id].lzy_add;
      st[id * 2 + 1].val_r = st[id].lzy_set + st[id].lzy_add;
      st[id * 2].lzy_set = st[id].lzy_set;
      st[id * 2].lzy_add = st[id].lzy_add;
      st[id * 2 + 1].lzy_set = st[id].lzy_set;
      st[id * 2 + 1].lzy_add = st[id].lzy_add;
      st[id * 2].mx = st[id * 2].mx_l = st[id * 2].mx_r = st[id * 2].len;
      st[id * 2 + 1].mx = st[id * 2 + 1].mx_l = st[id * 2 + 1].mx_r = st[id * 2 + 1].len;
      st[id].lzy_set = inf;
      st[id].lzy_add = 0;
    }
  }
 
  void Build(int id, int l, int r) {
    if (l == r) {    
      st[id].val_l = st[id].val_r = 0;
      st[id].len = 1;
      st[id].mx = st[id].mx_l = st[id].mx_r = 1;
      return;
    }
    int mid = (l + r) >> 1;
    Build(id * 2, l, mid);
    Build(id * 2 + 1, mid + 1, r);
    st[id] = Merge(st[id * 2], st[id * 2 + 1]);
  }
 
  void Set(int id, int l, int r, int ll, int rr, long long x) {
    if (ll <= l && r <= rr) {
      st[id].mx = st[id].mx_l = st[id].mx_r = st[id].len;
      st[id].val_l = x;
      st[id].val_r = x;
      st[id].lzy_set = x;
      st[id].lzy_add = 0;
      Push(id);
      return;
    }
    Push(id);
    int mid = (l + r) >> 1;
    if (rr <= mid) {
      Set(id * 2, l, mid, ll, rr, x);
    } else if (ll > mid) {
      Set(id * 2 + 1, mid + 1, r, ll, rr, x);
    } else {
      Set(id * 2, l, mid, ll, rr, x);
      Set(id * 2 + 1, mid + 1, r, ll, rr, x);
    }
    st[id] = Merge(st[id * 2], st[id * 2 + 1]);
  }
 
  void Add(int id, int l, int r, int ll, int rr, long long x) {
    if (ll <= l && r <= rr) {
      st[id].val_l += x;
      st[id].val_r += x;
      st[id].lzy_add += x;
      Push(id);
      return;
    }
    Push(id);
    int mid = (l + r) >> 1;
    if (rr <= mid) {
      Add(id * 2, l, mid, ll, rr, x);
    } else if (ll > mid) {
      Add(id * 2 + 1, mid + 1, r, ll, rr, x);
    } else {
      Add(id * 2, l, mid, ll, rr, x);
      Add(id * 2 + 1, mid + 1, r, ll, rr, x);
    }
    st[id] = Merge(st[id * 2], st[id * 2 + 1]);
  }
 
  Node Query(int id, int l, int r, int ll, int rr) {
    if (ll <= l && r <= rr) {
      return st[id];
    }
    Push(id);
    int mid = (l + r) >> 1;
    Node ret;
    if (rr <= mid) {
      ret = Query(id * 2, l, mid, ll, rr);
    } else if (ll > mid) {
      ret = Query(id * 2 + 1, mid + 1, r, ll, rr);
    } else {
      ret = Merge(Query(id * 2, l, mid, ll, rr), Query(id * 2 + 1, mid + 1, r, ll, rr));
    }
    st[id] = Merge(st[id * 2], st[id * 2 + 1]);
    return ret;
  }
} st;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; i++) {
    int d;
    cin >> d;
    val.Set(1, 0, n - 1, i, i, d, 0);
  }
  val.n = n;
  st.Build(1, 0, n - 1);
  for (int i = 0; i + 1 < n; i++) {
    st.Set(1, 0, n - 1, i, i, val.Get(i) - val.Get(i + 1));
  }
  while (q--) {
    int op;
    cin >> op;
    if (op == 1) {
      int l, r, s, c;
      cin >> l >> r >> s >> c;
      --l; --r;
      val.Add(1, 0, n - 1, l, r, s - c * 1LL * l, c);
      if (l < r) {
        st.Add(1, 0, n - 1, l, r - 1, -c);
      } 
      if (l > 0) {
        st.Set(1, 0, n - 1, l - 1, l - 1, val.Get(l - 1) - val.Get(l));
      } 
      if (r + 1 < n) {
        st.Set(1, 0, n - 1, r, r, val.Get(r) - val.Get(r + 1));
      } 
    }
    if (op == 2) {
      int l, r, s, c;
      cin >> l >> r >> s >> c;
      --l; --r;
      val.Set(1, 0, n - 1, l, r, s - c * 1LL * l, c);
      if (l < r) {
        st.Set(1, 0, n - 1, l, r - 1, -c);
      }
      if (l > 0) {
        st.Set(1, 0, n - 1, l - 1, l - 1, val.Get(l - 1) - val.Get(l));
      } 
      if (r + 1 < n) {
        st.Set(1, 0, n - 1, r, r, val.Get(r) - val.Get(r + 1));
      } 
    }
    if (op == 3) {
      int l, r;
      cin >> l >> r;
      --l; --r;
      if (l == r) {
        cout << 1 << '\n';
      } else {
        cout << st.Query(1, 0, n - 1, l, r - 1).mx + 1 << '\n';
      }
    }
  }
  return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 447 ms 229460 KB Output is correct
2 Correct 131 ms 228180 KB Output is correct
3 Correct 125 ms 227948 KB Output is correct
4 Correct 130 ms 227964 KB Output is correct
5 Correct 144 ms 228180 KB Output is correct
6 Correct 124 ms 228164 KB Output is correct
7 Correct 132 ms 228052 KB Output is correct
8 Correct 54 ms 225884 KB Output is correct
9 Correct 57 ms 225868 KB Output is correct
10 Correct 54 ms 226072 KB Output is correct
11 Correct 456 ms 231200 KB Output is correct
12 Correct 466 ms 230992 KB Output is correct
13 Correct 457 ms 231252 KB Output is correct
14 Correct 484 ms 231168 KB Output is correct
15 Correct 467 ms 230996 KB Output is correct
16 Correct 453 ms 230984 KB Output is correct
17 Correct 472 ms 231004 KB Output is correct
18 Correct 467 ms 230992 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 225876 KB Output is correct
2 Correct 53 ms 225996 KB Output is correct
3 Correct 54 ms 225876 KB Output is correct
4 Correct 58 ms 225876 KB Output is correct
5 Correct 53 ms 225876 KB Output is correct
6 Correct 58 ms 225876 KB Output is correct
7 Correct 53 ms 225872 KB Output is correct
8 Correct 57 ms 225920 KB Output is correct
9 Correct 56 ms 225872 KB Output is correct
10 Correct 53 ms 225868 KB Output is correct
11 Correct 56 ms 225876 KB Output is correct
12 Correct 74 ms 225876 KB Output is correct
13 Correct 55 ms 225880 KB Output is correct
14 Correct 53 ms 225876 KB Output is correct
15 Correct 56 ms 225876 KB Output is correct
16 Correct 55 ms 225876 KB Output is correct
17 Correct 59 ms 225876 KB Output is correct
18 Correct 54 ms 226096 KB Output is correct
19 Correct 52 ms 225876 KB Output is correct
20 Correct 58 ms 226020 KB Output is correct
21 Correct 55 ms 225872 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 227084 KB Output is correct
2 Correct 113 ms 226640 KB Output is correct
3 Correct 112 ms 226472 KB Output is correct
4 Correct 104 ms 226640 KB Output is correct
5 Correct 112 ms 226600 KB Output is correct
6 Correct 111 ms 226620 KB Output is correct
7 Correct 116 ms 226644 KB Output is correct
8 Correct 51 ms 225876 KB Output is correct
9 Correct 52 ms 225864 KB Output is correct
10 Correct 54 ms 225876 KB Output is correct
11 Correct 506 ms 226860 KB Output is correct
12 Correct 469 ms 227176 KB Output is correct
13 Correct 499 ms 226900 KB Output is correct
14 Correct 497 ms 226896 KB Output is correct
15 Correct 474 ms 226900 KB Output is correct
16 Correct 485 ms 227412 KB Output is correct
17 Correct 477 ms 227456 KB Output is correct
18 Correct 563 ms 227372 KB Output is correct
19 Correct 441 ms 226608 KB Output is correct
20 Correct 474 ms 226684 KB Output is correct
21 Correct 484 ms 226636 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 847 ms 226128 KB Output is correct
2 Correct 167 ms 226128 KB Output is correct
3 Correct 183 ms 226112 KB Output is correct
4 Correct 165 ms 226128 KB Output is correct
5 Correct 171 ms 226104 KB Output is correct
6 Correct 179 ms 226272 KB Output is correct
7 Correct 179 ms 226128 KB Output is correct
8 Correct 54 ms 226052 KB Output is correct
9 Correct 55 ms 225876 KB Output is correct
10 Correct 56 ms 225876 KB Output is correct
11 Correct 881 ms 226392 KB Output is correct
12 Correct 857 ms 226144 KB Output is correct
13 Correct 903 ms 226384 KB Output is correct
14 Correct 867 ms 226388 KB Output is correct
15 Correct 846 ms 226092 KB Output is correct
16 Correct 975 ms 226300 KB Output is correct
17 Correct 904 ms 226392 KB Output is correct
18 Correct 886 ms 226388 KB Output is correct
19 Correct 870 ms 226128 KB Output is correct
20 Correct 862 ms 226132 KB Output is correct
21 Correct 869 ms 226132 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 227084 KB Output is correct
2 Correct 113 ms 226640 KB Output is correct
3 Correct 112 ms 226472 KB Output is correct
4 Correct 104 ms 226640 KB Output is correct
5 Correct 112 ms 226600 KB Output is correct
6 Correct 111 ms 226620 KB Output is correct
7 Correct 116 ms 226644 KB Output is correct
8 Correct 51 ms 225876 KB Output is correct
9 Correct 52 ms 225864 KB Output is correct
10 Correct 54 ms 225876 KB Output is correct
11 Correct 506 ms 226860 KB Output is correct
12 Correct 469 ms 227176 KB Output is correct
13 Correct 499 ms 226900 KB Output is correct
14 Correct 497 ms 226896 KB Output is correct
15 Correct 474 ms 226900 KB Output is correct
16 Correct 485 ms 227412 KB Output is correct
17 Correct 477 ms 227456 KB Output is correct
18 Correct 563 ms 227372 KB Output is correct
19 Correct 441 ms 226608 KB Output is correct
20 Correct 474 ms 226684 KB Output is correct
21 Correct 484 ms 226636 KB Output is correct
22 Correct 1024 ms 226384 KB Output is correct
23 Correct 176 ms 226384 KB Output is correct
24 Correct 172 ms 226372 KB Output is correct
25 Correct 165 ms 226368 KB Output is correct
26 Correct 169 ms 226388 KB Output is correct
27 Correct 175 ms 226388 KB Output is correct
28 Correct 173 ms 226352 KB Output is correct
29 Correct 54 ms 225980 KB Output is correct
30 Correct 54 ms 225920 KB Output is correct
31 Correct 65 ms 225940 KB Output is correct
32 Correct 1038 ms 226440 KB Output is correct
33 Correct 1041 ms 226388 KB Output is correct
34 Correct 1068 ms 226388 KB Output is correct
35 Correct 1024 ms 226356 KB Output is correct
36 Correct 808 ms 226640 KB Output is correct
37 Correct 819 ms 226604 KB Output is correct
38 Correct 818 ms 226740 KB Output is correct
39 Correct 1008 ms 226364 KB Output is correct
40 Correct 1047 ms 226388 KB Output is correct
41 Correct 1033 ms 226388 KB Output is correct
42 Correct 1110 ms 226484 KB Output is correct
43 Correct 1025 ms 226440 KB Output is correct
44 Correct 967 ms 226252 KB Output is correct
45 Correct 1018 ms 226368 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 447 ms 229460 KB Output is correct
2 Correct 131 ms 228180 KB Output is correct
3 Correct 125 ms 227948 KB Output is correct
4 Correct 130 ms 227964 KB Output is correct
5 Correct 144 ms 228180 KB Output is correct
6 Correct 124 ms 228164 KB Output is correct
7 Correct 132 ms 228052 KB Output is correct
8 Correct 54 ms 225884 KB Output is correct
9 Correct 57 ms 225868 KB Output is correct
10 Correct 54 ms 226072 KB Output is correct
11 Correct 456 ms 231200 KB Output is correct
12 Correct 466 ms 230992 KB Output is correct
13 Correct 457 ms 231252 KB Output is correct
14 Correct 484 ms 231168 KB Output is correct
15 Correct 467 ms 230996 KB Output is correct
16 Correct 453 ms 230984 KB Output is correct
17 Correct 472 ms 231004 KB Output is correct
18 Correct 467 ms 230992 KB Output is correct
19 Correct 55 ms 225876 KB Output is correct
20 Correct 53 ms 225996 KB Output is correct
21 Correct 54 ms 225876 KB Output is correct
22 Correct 58 ms 225876 KB Output is correct
23 Correct 53 ms 225876 KB Output is correct
24 Correct 58 ms 225876 KB Output is correct
25 Correct 53 ms 225872 KB Output is correct
26 Correct 57 ms 225920 KB Output is correct
27 Correct 56 ms 225872 KB Output is correct
28 Correct 53 ms 225868 KB Output is correct
29 Correct 56 ms 225876 KB Output is correct
30 Correct 74 ms 225876 KB Output is correct
31 Correct 55 ms 225880 KB Output is correct
32 Correct 53 ms 225876 KB Output is correct
33 Correct 56 ms 225876 KB Output is correct
34 Correct 55 ms 225876 KB Output is correct
35 Correct 59 ms 225876 KB Output is correct
36 Correct 54 ms 226096 KB Output is correct
37 Correct 52 ms 225876 KB Output is correct
38 Correct 58 ms 226020 KB Output is correct
39 Correct 55 ms 225872 KB Output is correct
40 Correct 496 ms 227084 KB Output is correct
41 Correct 113 ms 226640 KB Output is correct
42 Correct 112 ms 226472 KB Output is correct
43 Correct 104 ms 226640 KB Output is correct
44 Correct 112 ms 226600 KB Output is correct
45 Correct 111 ms 226620 KB Output is correct
46 Correct 116 ms 226644 KB Output is correct
47 Correct 51 ms 225876 KB Output is correct
48 Correct 52 ms 225864 KB Output is correct
49 Correct 54 ms 225876 KB Output is correct
50 Correct 506 ms 226860 KB Output is correct
51 Correct 469 ms 227176 KB Output is correct
52 Correct 499 ms 226900 KB Output is correct
53 Correct 497 ms 226896 KB Output is correct
54 Correct 474 ms 226900 KB Output is correct
55 Correct 485 ms 227412 KB Output is correct
56 Correct 477 ms 227456 KB Output is correct
57 Correct 563 ms 227372 KB Output is correct
58 Correct 441 ms 226608 KB Output is correct
59 Correct 474 ms 226684 KB Output is correct
60 Correct 484 ms 226636 KB Output is correct
61 Correct 847 ms 226128 KB Output is correct
62 Correct 167 ms 226128 KB Output is correct
63 Correct 183 ms 226112 KB Output is correct
64 Correct 165 ms 226128 KB Output is correct
65 Correct 171 ms 226104 KB Output is correct
66 Correct 179 ms 226272 KB Output is correct
67 Correct 179 ms 226128 KB Output is correct
68 Correct 54 ms 226052 KB Output is correct
69 Correct 55 ms 225876 KB Output is correct
70 Correct 56 ms 225876 KB Output is correct
71 Correct 881 ms 226392 KB Output is correct
72 Correct 857 ms 226144 KB Output is correct
73 Correct 903 ms 226384 KB Output is correct
74 Correct 867 ms 226388 KB Output is correct
75 Correct 846 ms 226092 KB Output is correct
76 Correct 975 ms 226300 KB Output is correct
77 Correct 904 ms 226392 KB Output is correct
78 Correct 886 ms 226388 KB Output is correct
79 Correct 870 ms 226128 KB Output is correct
80 Correct 862 ms 226132 KB Output is correct
81 Correct 869 ms 226132 KB Output is correct
82 Correct 1024 ms 226384 KB Output is correct
83 Correct 176 ms 226384 KB Output is correct
84 Correct 172 ms 226372 KB Output is correct
85 Correct 165 ms 226368 KB Output is correct
86 Correct 169 ms 226388 KB Output is correct
87 Correct 175 ms 226388 KB Output is correct
88 Correct 173 ms 226352 KB Output is correct
89 Correct 54 ms 225980 KB Output is correct
90 Correct 54 ms 225920 KB Output is correct
91 Correct 65 ms 225940 KB Output is correct
92 Correct 1038 ms 226440 KB Output is correct
93 Correct 1041 ms 226388 KB Output is correct
94 Correct 1068 ms 226388 KB Output is correct
95 Correct 1024 ms 226356 KB Output is correct
96 Correct 808 ms 226640 KB Output is correct
97 Correct 819 ms 226604 KB Output is correct
98 Correct 818 ms 226740 KB Output is correct
99 Correct 1008 ms 226364 KB Output is correct
100 Correct 1047 ms 226388 KB Output is correct
101 Correct 1033 ms 226388 KB Output is correct
102 Correct 1110 ms 226484 KB Output is correct
103 Correct 1025 ms 226440 KB Output is correct
104 Correct 967 ms 226252 KB Output is correct
105 Correct 1018 ms 226368 KB Output is correct
106 Correct 1200 ms 236316 KB Output is correct
107 Correct 207 ms 229460 KB Output is correct
108 Correct 206 ms 229460 KB Output is correct
109 Correct 218 ms 229456 KB Output is correct
110 Correct 55 ms 225916 KB Output is correct
111 Correct 57 ms 225872 KB Output is correct
112 Correct 54 ms 225876 KB Output is correct
113 Correct 1037 ms 235432 KB Output is correct
114 Correct 1034 ms 235332 KB Output is correct
115 Correct 1040 ms 235356 KB Output is correct
116 Correct 1012 ms 235344 KB Output is correct
117 Correct 1174 ms 236204 KB Output is correct
118 Correct 1004 ms 235348 KB Output is correct
119 Correct 1030 ms 235344 KB Output is correct
120 Correct 466 ms 234024 KB Output is correct
121 Correct 482 ms 233884 KB Output is correct
122 Correct 472 ms 233844 KB Output is correct
123 Correct 463 ms 233040 KB Output is correct
124 Correct 456 ms 233044 KB Output is correct
125 Correct 504 ms 233044 KB Output is correct
126 Correct 1147 ms 233040 KB Output is correct
127 Correct 1165 ms 233040 KB Output is correct
128 Correct 1206 ms 236340 KB Output is correct
129 Correct 1259 ms 232848 KB Output is correct
130 Correct 814 ms 233088 KB Output is correct
131 Correct 806 ms 233060 KB Output is correct
132 Correct 821 ms 233044 KB Output is correct
133 Correct 1223 ms 236372 KB Output is correct
134 Correct 1173 ms 236212 KB Output is correct
135 Correct 1172 ms 236216 KB Output is correct
136 Correct 200 ms 229460 KB Output is correct
137 Correct 229 ms 229456 KB Output is correct
138 Correct 200 ms 229460 KB Output is correct