oj.uz

답안 #959147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959147 2024-04-07T14:17:49 Z Spade1 푸드 코트 (JOI21_foodcourt) C++14
100 / 100
 503 ms 56108 KB 
#pragma once
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pld> vpld;
typedef vector<vi> vvi;

template<typename T> using pq = priority_queue<T>;
template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;

#define rep0(a) for (int i = 0; i < a; ++i)
#define rep1(i, a) for (int i = 0; i < a; ++i)
#define rep2(i, a, b) for (int i = a; i <= b; ++i)
#define rep3(i, a, b, c) for (int i = a; i <= b; i+=c) 
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define repd0(a) for (int i = a; i >= 1; --i)
#define repd1(i, a) for (int i = a; i >= 1; --i)
#define repd2(i, a, b) for (int i = b; i >= a; --i)
#define repd3(i, a, b, c) for (int i = b; i >= a; i-=c)
#define repd(...) overload4(__VA_ARGS__, repd3, repd2, repd1, repd0)(__VA_ARGS__)
#define trav(a, x) for (auto& a : x)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define lb lower_bound
#define ub upper_bound
#define all(x) (x).begin(), (x).end()
#define ins insert

template<typename T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MOD = 1e9 + 7;
const int INF = 0x3fffffff;
const ll LINF = 0x1fffffffffffffff;
const char nl = '\n';
const int MX = 3e5 + 3;

template<class T>
struct fenwick {
  int n;
  vector<T> t;
  fenwick (int n=0){init(n);}
  void init(int _n) {
    n=_n;
    t.assign(n+1, T{});
  }
  void update(int x, const T &v) {
    for(int i = x+1; i <= n; i+=i&-i) t[i] = t[i]+v;
  }
  void update(int l, int r, const T &v) {
    update(l, v); update(r+1, -v);
  }
  T query(int x) {
    T res{};
    for (int i = x+1; i > 0; i-=i&-i) res = res+t[i];
    return res;
  }
  T query(int l, int r) {
    return query(r) - query(l-1);
  }
  //find the first index that sums to >= k
  int find(const T &k) {
    int x = 0;
    T cur{};
    for (int i = 1<<(31-__builtin_clz(n)); i > 0; i>>=1)
      if (x+i <= n && cur+t[x+i] < k) x+=i, cur+=t[x];
    return x;
  }
};

template<class Node, class Tag>
struct LazySegTree{
  int n;
  vector<Node> t;
  vector<Tag> lz;
  LazySegTree() {}
  LazySegTree(int n, Node v=Node()) {init(n, v);}
  template<class T>
  LazySegTree(const vector<T> &a) {init(a);}
  void init(int n, Node v=Node()) {init(vector<Node>(n, v));}
  template<class T>
  void init(const vector<T> &a) {
    n=sz(a);
    t.assign(4<<(31-__builtin_clz(n)), Node());
    lz.assign(4<<(31-__builtin_clz(n)), Tag());
    function<void(int, int, int)> build=[&](int l, int r, int i){
      if (l==r) return void(t[i]=a[l-1]);
      int m=(l+r)/2;
      build(l,m,2*i);
      build(m+1,r,2*i+1);
      pull(i);
    };
    build(1,n,1);
  }
  void pull(int i) {
    t[i]=t[2*i]+t[2*i+1];
  }
  void apply(int l,int r,int i,const Tag &v) {
    t[i].apply(l,r,v);
    lz[i].apply(l,r,v);
  }
  void push(int l, int r, int i) {
    int m=(l+r)/2;
    apply(l,m,2*i, lz[i]);
    apply(m+1,r,2*i+1, lz[i]);
    lz[i]=Tag();
  }
  void modify(int l,int r,int x,int i,const Node &v) {
    if (x<l||x>r) return;
    if (l==r) return void(t[i]=v);
    int m=(l+r)/2;
    push(l,r,i);
    modify(l,m,2*i,x,v);
    modify(m+1,r,2*i+1,x,v);
    pull(i);
  }
  void modify(int x,const Node &v){ modify(1,n,x,1,v); }
  void update(int l,int r,int x,int y,int i,const Tag &v) {
    if (y<l||x>r) return;
    if (x<=l&&r<=y) return apply(l, r, i, v);
    int m=(l+r)/2;
    push(l,r,i);
    update(l,m,x,y,2*i,v);
    update(m+1,r,x,y,2*i+1,v);
    pull(i);
  }
  void update(int x,int y,const Tag &v) { update(1,n,x,y,1,v); }
  void update(int x,const Tag &v) { update(1,n,x,x,1,v); }
  Node query(int l,int r,int x,int y,int i) {
    if (y<l||x>r) return Node();
    if (x<=l&&r<=y) return t[i];
    int m=(l+r)/2;
    push(l,r,i);
    return query(l,m,x,y,2*i)+query(m+1,r,x,y,2*i+1);
  }
  Node query(int x,int y){ return query(1,n,x,y,1); }
  Node query(int x){ return query(1,n,x,x,1); }
};
struct Tag{
  ll val;
  Tag(ll _val=0):val(_val){}
  void apply(int l, int r, const Tag &v) { val+=v.val; }
};
struct Node{
  ll val;
  Node(ll _val=0):val(_val){}
  void apply(int l, int r, const Tag &v) { val+=v.val; }
  friend Node operator+(const Node &lhs, const Node &rhs) {
    return Node(min(lhs.val, rhs.val)); 
  }
};


vll _index(MX), ans(MX, -1); vector<tuple<int, ll, ll>> ord[MX];
fenwick<ll> cnt(MX), del(MX);
LazySegTree<Node, Tag> s(MX);

void solve() {
  int n, m, q; cin >> n >> m >> q;
  rep (T, 1, q) {
    int t; cin >> t;
    if (t == 1) {
      ll l, r, c, k; cin >> l >> r >> c >> k;
      ord[l].pb({1, T, k}); ord[r+1].pb({1, T, -k});
      _index[T] = c;
    }
    if (t == 2) {
      ll l, r, k; cin >> l >> r >> k;
      ord[l].pb({2, T, k}); ord[r+1].pb({2, T, -k});
    }
    if (t == 3) {
      ll a, b; cin >> a >> b;
      ord[a].pb({3, T, b});
    }
  }
  rep(i, 1, n) {
    ll d = 0;
    for(auto [op, T, k] : ord[i]) {
      if (op == 1) cnt.update(T, k), s.update(T, q, k);  
      if (op == 2) del.update(T, k), s.update(T, q, -k);
      if (op == 3) {
        int idx = cnt.find(k + del.query(T) + s.query(1, T).val);
        ans[T] = (idx > T ? 0 : _index[idx]);
      }
    }
  }
  trav(a, ans) if (a != -1) cout << a << nl;
}

int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0); cin.tie(NULL);
  int t = 1;
//  cin >> t;
  while (t--) { solve(); }
  return 0;
}

Compilation message

foodcourt.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
foodcourt.cpp: In function 'void solve()':
foodcourt.cpp:196:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  196 |     for(auto [op, T, k] : ord[i]) {
      |              ^
foodcourt.cpp:195:8: warning: unused variable 'd' [-Wunused-variable]
  195 |     ll d = 0;
      |        ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35420 KB Output is correct
2 Correct 15 ms 35424 KB Output is correct
3 Correct 14 ms 35420 KB Output is correct
4 Correct 16 ms 35660 KB Output is correct
5 Correct 15 ms 35416 KB Output is correct
6 Correct 14 ms 35420 KB Output is correct
7 Correct 16 ms 35520 KB Output is correct
8 Correct 15 ms 35420 KB Output is correct
9 Correct 15 ms 35420 KB Output is correct
10 Correct 16 ms 35420 KB Output is correct
11 Correct 15 ms 35420 KB Output is correct
12 Correct 15 ms 35420 KB Output is correct
13 Correct 14 ms 35420 KB Output is correct
14 Correct 14 ms 35672 KB Output is correct
15 Correct 14 ms 35420 KB Output is correct
16 Correct 15 ms 35420 KB Output is correct
17 Correct 15 ms 35492 KB Output is correct
18 Correct 15 ms 35420 KB Output is correct
19 Correct 15 ms 35420 KB Output is correct
20 Correct 15 ms 35420 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35420 KB Output is correct
2 Correct 15 ms 35424 KB Output is correct
3 Correct 14 ms 35420 KB Output is correct
4 Correct 16 ms 35660 KB Output is correct
5 Correct 15 ms 35416 KB Output is correct
6 Correct 14 ms 35420 KB Output is correct
7 Correct 16 ms 35520 KB Output is correct
8 Correct 15 ms 35420 KB Output is correct
9 Correct 15 ms 35420 KB Output is correct
10 Correct 16 ms 35420 KB Output is correct
11 Correct 15 ms 35420 KB Output is correct
12 Correct 15 ms 35420 KB Output is correct
13 Correct 14 ms 35420 KB Output is correct
14 Correct 14 ms 35672 KB Output is correct
15 Correct 14 ms 35420 KB Output is correct
16 Correct 15 ms 35420 KB Output is correct
17 Correct 15 ms 35492 KB Output is correct
18 Correct 15 ms 35420 KB Output is correct
19 Correct 15 ms 35420 KB Output is correct
20 Correct 15 ms 35420 KB Output is correct
21 Correct 14 ms 35420 KB Output is correct
22 Correct 16 ms 35636 KB Output is correct
23 Correct 14 ms 35420 KB Output is correct
24 Correct 16 ms 35548 KB Output is correct
25 Correct 15 ms 35420 KB Output is correct
26 Correct 15 ms 35672 KB Output is correct
27 Correct 16 ms 35416 KB Output is correct
28 Correct 18 ms 35432 KB Output is correct
29 Correct 15 ms 35420 KB Output is correct
30 Correct 16 ms 35420 KB Output is correct
31 Correct 16 ms 35420 KB Output is correct
32 Correct 15 ms 35420 KB Output is correct
33 Correct 15 ms 35420 KB Output is correct
34 Correct 15 ms 35656 KB Output is correct
35 Correct 15 ms 35416 KB Output is correct
36 Correct 15 ms 35656 KB Output is correct
37 Correct 17 ms 35932 KB Output is correct
38 Correct 19 ms 35452 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 38136 KB Output is correct
2 Correct 90 ms 38416 KB Output is correct
3 Correct 103 ms 38140 KB Output is correct
4 Correct 83 ms 38100 KB Output is correct
5 Correct 86 ms 38408 KB Output is correct
6 Correct 86 ms 38392 KB Output is correct
7 Correct 45 ms 37864 KB Output is correct
8 Correct 51 ms 39024 KB Output is correct
9 Correct 98 ms 38700 KB Output is correct
10 Correct 85 ms 38400 KB Output is correct
11 Correct 86 ms 38188 KB Output is correct
12 Correct 93 ms 38220 KB Output is correct
13 Correct 73 ms 37476 KB Output is correct
14 Correct 96 ms 37948 KB Output is correct
15 Correct 94 ms 38564 KB Output is correct
16 Correct 91 ms 38668 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 386 ms 51564 KB Output is correct
2 Correct 277 ms 47660 KB Output is correct
3 Correct 441 ms 53212 KB Output is correct
4 Correct 267 ms 48080 KB Output is correct
5 Correct 282 ms 48704 KB Output is correct
6 Correct 400 ms 54316 KB Output is correct
7 Correct 179 ms 54056 KB Output is correct
8 Correct 203 ms 52172 KB Output is correct
9 Correct 383 ms 51916 KB Output is correct
10 Correct 368 ms 51944 KB Output is correct
11 Correct 442 ms 54108 KB Output is correct
12 Correct 436 ms 54056 KB Output is correct
13 Correct 422 ms 53976 KB Output is correct
14 Correct 411 ms 54040 KB Output is correct
15 Correct 438 ms 54056 KB Output is correct
16 Correct 402 ms 54060 KB Output is correct
17 Correct 441 ms 54064 KB Output is correct
18 Correct 406 ms 54060 KB Output is correct
19 Correct 448 ms 54052 KB Output is correct
20 Correct 446 ms 54028 KB Output is correct
21 Correct 452 ms 53912 KB Output is correct
22 Correct 431 ms 54056 KB Output is correct
23 Correct 418 ms 53984 KB Output is correct
24 Correct 469 ms 53968 KB Output is correct
25 Correct 332 ms 54760 KB Output is correct
26 Correct 363 ms 55508 KB Output is correct
27 Correct 392 ms 55072 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35420 KB Output is correct
2 Correct 15 ms 35424 KB Output is correct
3 Correct 14 ms 35420 KB Output is correct
4 Correct 16 ms 35660 KB Output is correct
5 Correct 15 ms 35416 KB Output is correct
6 Correct 14 ms 35420 KB Output is correct
7 Correct 16 ms 35520 KB Output is correct
8 Correct 15 ms 35420 KB Output is correct
9 Correct 15 ms 35420 KB Output is correct
10 Correct 16 ms 35420 KB Output is correct
11 Correct 15 ms 35420 KB Output is correct
12 Correct 15 ms 35420 KB Output is correct
13 Correct 14 ms 35420 KB Output is correct
14 Correct 14 ms 35672 KB Output is correct
15 Correct 14 ms 35420 KB Output is correct
16 Correct 15 ms 35420 KB Output is correct
17 Correct 15 ms 35492 KB Output is correct
18 Correct 15 ms 35420 KB Output is correct
19 Correct 15 ms 35420 KB Output is correct
20 Correct 15 ms 35420 KB Output is correct
21 Correct 86 ms 38136 KB Output is correct
22 Correct 90 ms 38416 KB Output is correct
23 Correct 103 ms 38140 KB Output is correct
24 Correct 83 ms 38100 KB Output is correct
25 Correct 86 ms 38408 KB Output is correct
26 Correct 86 ms 38392 KB Output is correct
27 Correct 45 ms 37864 KB Output is correct
28 Correct 51 ms 39024 KB Output is correct
29 Correct 98 ms 38700 KB Output is correct
30 Correct 85 ms 38400 KB Output is correct
31 Correct 86 ms 38188 KB Output is correct
32 Correct 93 ms 38220 KB Output is correct
33 Correct 73 ms 37476 KB Output is correct
34 Correct 96 ms 37948 KB Output is correct
35 Correct 94 ms 38564 KB Output is correct
36 Correct 91 ms 38668 KB Output is correct
37 Correct 82 ms 37420 KB Output is correct
38 Correct 77 ms 37180 KB Output is correct
39 Correct 43 ms 37692 KB Output is correct
40 Correct 52 ms 38696 KB Output is correct
41 Correct 100 ms 38224 KB Output is correct
42 Correct 85 ms 38184 KB Output is correct
43 Correct 87 ms 38188 KB Output is correct
44 Correct 99 ms 38384 KB Output is correct
45 Correct 103 ms 38440 KB Output is correct
46 Correct 88 ms 38200 KB Output is correct
47 Correct 68 ms 38092 KB Output is correct
48 Correct 81 ms 38440 KB Output is correct
49 Correct 70 ms 36824 KB Output is correct
50 Correct 86 ms 37520 KB Output is correct
51 Correct 95 ms 38320 KB Output is correct
52 Correct 91 ms 38188 KB Output is correct
53 Correct 82 ms 37348 KB Output is correct
54 Correct 102 ms 38652 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 37676 KB Output is correct
2 Correct 82 ms 38168 KB Output is correct
3 Correct 91 ms 38204 KB Output is correct
4 Correct 72 ms 36896 KB Output is correct
5 Correct 72 ms 37476 KB Output is correct
6 Correct 82 ms 38184 KB Output is correct
7 Correct 47 ms 38184 KB Output is correct
8 Correct 53 ms 38184 KB Output is correct
9 Correct 67 ms 37932 KB Output is correct
10 Correct 63 ms 36940 KB Output is correct
11 Correct 85 ms 37932 KB Output is correct
12 Correct 84 ms 38044 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35420 KB Output is correct
2 Correct 15 ms 35424 KB Output is correct
3 Correct 14 ms 35420 KB Output is correct
4 Correct 16 ms 35660 KB Output is correct
5 Correct 15 ms 35416 KB Output is correct
6 Correct 14 ms 35420 KB Output is correct
7 Correct 16 ms 35520 KB Output is correct
8 Correct 15 ms 35420 KB Output is correct
9 Correct 15 ms 35420 KB Output is correct
10 Correct 16 ms 35420 KB Output is correct
11 Correct 15 ms 35420 KB Output is correct
12 Correct 15 ms 35420 KB Output is correct
13 Correct 14 ms 35420 KB Output is correct
14 Correct 14 ms 35672 KB Output is correct
15 Correct 14 ms 35420 KB Output is correct
16 Correct 15 ms 35420 KB Output is correct
17 Correct 15 ms 35492 KB Output is correct
18 Correct 15 ms 35420 KB Output is correct
19 Correct 15 ms 35420 KB Output is correct
20 Correct 15 ms 35420 KB Output is correct
21 Correct 14 ms 35420 KB Output is correct
22 Correct 16 ms 35636 KB Output is correct
23 Correct 14 ms 35420 KB Output is correct
24 Correct 16 ms 35548 KB Output is correct
25 Correct 15 ms 35420 KB Output is correct
26 Correct 15 ms 35672 KB Output is correct
27 Correct 16 ms 35416 KB Output is correct
28 Correct 18 ms 35432 KB Output is correct
29 Correct 15 ms 35420 KB Output is correct
30 Correct 16 ms 35420 KB Output is correct
31 Correct 16 ms 35420 KB Output is correct
32 Correct 15 ms 35420 KB Output is correct
33 Correct 15 ms 35420 KB Output is correct
34 Correct 15 ms 35656 KB Output is correct
35 Correct 15 ms 35416 KB Output is correct
36 Correct 15 ms 35656 KB Output is correct
37 Correct 17 ms 35932 KB Output is correct
38 Correct 19 ms 35452 KB Output is correct
39 Correct 86 ms 38136 KB Output is correct
40 Correct 90 ms 38416 KB Output is correct
41 Correct 103 ms 38140 KB Output is correct
42 Correct 83 ms 38100 KB Output is correct
43 Correct 86 ms 38408 KB Output is correct
44 Correct 86 ms 38392 KB Output is correct
45 Correct 45 ms 37864 KB Output is correct
46 Correct 51 ms 39024 KB Output is correct
47 Correct 98 ms 38700 KB Output is correct
48 Correct 85 ms 38400 KB Output is correct
49 Correct 86 ms 38188 KB Output is correct
50 Correct 93 ms 38220 KB Output is correct
51 Correct 73 ms 37476 KB Output is correct
52 Correct 96 ms 37948 KB Output is correct
53 Correct 94 ms 38564 KB Output is correct
54 Correct 91 ms 38668 KB Output is correct
55 Correct 82 ms 37420 KB Output is correct
56 Correct 77 ms 37180 KB Output is correct
57 Correct 43 ms 37692 KB Output is correct
58 Correct 52 ms 38696 KB Output is correct
59 Correct 100 ms 38224 KB Output is correct
60 Correct 85 ms 38184 KB Output is correct
61 Correct 87 ms 38188 KB Output is correct
62 Correct 99 ms 38384 KB Output is correct
63 Correct 103 ms 38440 KB Output is correct
64 Correct 88 ms 38200 KB Output is correct
65 Correct 68 ms 38092 KB Output is correct
66 Correct 81 ms 38440 KB Output is correct
67 Correct 70 ms 36824 KB Output is correct
68 Correct 86 ms 37520 KB Output is correct
69 Correct 95 ms 38320 KB Output is correct
70 Correct 91 ms 38188 KB Output is correct
71 Correct 82 ms 37348 KB Output is correct
72 Correct 102 ms 38652 KB Output is correct
73 Correct 75 ms 37676 KB Output is correct
74 Correct 82 ms 38168 KB Output is correct
75 Correct 91 ms 38204 KB Output is correct
76 Correct 72 ms 36896 KB Output is correct
77 Correct 72 ms 37476 KB Output is correct
78 Correct 82 ms 38184 KB Output is correct
79 Correct 47 ms 38184 KB Output is correct
80 Correct 53 ms 38184 KB Output is correct
81 Correct 67 ms 37932 KB Output is correct
82 Correct 63 ms 36940 KB Output is correct
83 Correct 85 ms 37932 KB Output is correct
84 Correct 84 ms 38044 KB Output is correct
85 Correct 83 ms 37932 KB Output is correct
86 Correct 141 ms 38616 KB Output is correct
87 Correct 83 ms 37968 KB Output is correct
88 Correct 94 ms 38700 KB Output is correct
89 Correct 68 ms 36916 KB Output is correct
90 Correct 95 ms 38752 KB Output is correct
91 Correct 82 ms 37820 KB Output is correct
92 Correct 72 ms 37576 KB Output is correct
93 Correct 102 ms 38700 KB Output is correct
94 Correct 111 ms 38728 KB Output is correct
95 Correct 95 ms 38640 KB Output is correct
96 Correct 95 ms 38644 KB Output is correct
97 Correct 120 ms 38712 KB Output is correct
98 Correct 79 ms 37988 KB Output is correct
99 Correct 67 ms 38980 KB Output is correct
100 Correct 70 ms 37680 KB Output is correct
101 Correct 85 ms 39056 KB Output is correct
102 Correct 88 ms 38960 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35420 KB Output is correct
2 Correct 15 ms 35424 KB Output is correct
3 Correct 14 ms 35420 KB Output is correct
4 Correct 16 ms 35660 KB Output is correct
5 Correct 15 ms 35416 KB Output is correct
6 Correct 14 ms 35420 KB Output is correct
7 Correct 16 ms 35520 KB Output is correct
8 Correct 15 ms 35420 KB Output is correct
9 Correct 15 ms 35420 KB Output is correct
10 Correct 16 ms 35420 KB Output is correct
11 Correct 15 ms 35420 KB Output is correct
12 Correct 15 ms 35420 KB Output is correct
13 Correct 14 ms 35420 KB Output is correct
14 Correct 14 ms 35672 KB Output is correct
15 Correct 14 ms 35420 KB Output is correct
16 Correct 15 ms 35420 KB Output is correct
17 Correct 15 ms 35492 KB Output is correct
18 Correct 15 ms 35420 KB Output is correct
19 Correct 15 ms 35420 KB Output is correct
20 Correct 15 ms 35420 KB Output is correct
21 Correct 14 ms 35420 KB Output is correct
22 Correct 16 ms 35636 KB Output is correct
23 Correct 14 ms 35420 KB Output is correct
24 Correct 16 ms 35548 KB Output is correct
25 Correct 15 ms 35420 KB Output is correct
26 Correct 15 ms 35672 KB Output is correct
27 Correct 16 ms 35416 KB Output is correct
28 Correct 18 ms 35432 KB Output is correct
29 Correct 15 ms 35420 KB Output is correct
30 Correct 16 ms 35420 KB Output is correct
31 Correct 16 ms 35420 KB Output is correct
32 Correct 15 ms 35420 KB Output is correct
33 Correct 15 ms 35420 KB Output is correct
34 Correct 15 ms 35656 KB Output is correct
35 Correct 15 ms 35416 KB Output is correct
36 Correct 15 ms 35656 KB Output is correct
37 Correct 17 ms 35932 KB Output is correct
38 Correct 19 ms 35452 KB Output is correct
39 Correct 86 ms 38136 KB Output is correct
40 Correct 90 ms 38416 KB Output is correct
41 Correct 103 ms 38140 KB Output is correct
42 Correct 83 ms 38100 KB Output is correct
43 Correct 86 ms 38408 KB Output is correct
44 Correct 86 ms 38392 KB Output is correct
45 Correct 45 ms 37864 KB Output is correct
46 Correct 51 ms 39024 KB Output is correct
47 Correct 98 ms 38700 KB Output is correct
48 Correct 85 ms 38400 KB Output is correct
49 Correct 86 ms 38188 KB Output is correct
50 Correct 93 ms 38220 KB Output is correct
51 Correct 73 ms 37476 KB Output is correct
52 Correct 96 ms 37948 KB Output is correct
53 Correct 94 ms 38564 KB Output is correct
54 Correct 91 ms 38668 KB Output is correct
55 Correct 386 ms 51564 KB Output is correct
56 Correct 277 ms 47660 KB Output is correct
57 Correct 441 ms 53212 KB Output is correct
58 Correct 267 ms 48080 KB Output is correct
59 Correct 282 ms 48704 KB Output is correct
60 Correct 400 ms 54316 KB Output is correct
61 Correct 179 ms 54056 KB Output is correct
62 Correct 203 ms 52172 KB Output is correct
63 Correct 383 ms 51916 KB Output is correct
64 Correct 368 ms 51944 KB Output is correct
65 Correct 442 ms 54108 KB Output is correct
66 Correct 436 ms 54056 KB Output is correct
67 Correct 422 ms 53976 KB Output is correct
68 Correct 411 ms 54040 KB Output is correct
69 Correct 438 ms 54056 KB Output is correct
70 Correct 402 ms 54060 KB Output is correct
71 Correct 441 ms 54064 KB Output is correct
72 Correct 406 ms 54060 KB Output is correct
73 Correct 448 ms 54052 KB Output is correct
74 Correct 446 ms 54028 KB Output is correct
75 Correct 452 ms 53912 KB Output is correct
76 Correct 431 ms 54056 KB Output is correct
77 Correct 418 ms 53984 KB Output is correct
78 Correct 469 ms 53968 KB Output is correct
79 Correct 332 ms 54760 KB Output is correct
80 Correct 363 ms 55508 KB Output is correct
81 Correct 392 ms 55072 KB Output is correct
82 Correct 82 ms 37420 KB Output is correct
83 Correct 77 ms 37180 KB Output is correct
84 Correct 43 ms 37692 KB Output is correct
85 Correct 52 ms 38696 KB Output is correct
86 Correct 100 ms 38224 KB Output is correct
87 Correct 85 ms 38184 KB Output is correct
88 Correct 87 ms 38188 KB Output is correct
89 Correct 99 ms 38384 KB Output is correct
90 Correct 103 ms 38440 KB Output is correct
91 Correct 88 ms 38200 KB Output is correct
92 Correct 68 ms 38092 KB Output is correct
93 Correct 81 ms 38440 KB Output is correct
94 Correct 70 ms 36824 KB Output is correct
95 Correct 86 ms 37520 KB Output is correct
96 Correct 95 ms 38320 KB Output is correct
97 Correct 91 ms 38188 KB Output is correct
98 Correct 82 ms 37348 KB Output is correct
99 Correct 102 ms 38652 KB Output is correct
100 Correct 75 ms 37676 KB Output is correct
101 Correct 82 ms 38168 KB Output is correct
102 Correct 91 ms 38204 KB Output is correct
103 Correct 72 ms 36896 KB Output is correct
104 Correct 72 ms 37476 KB Output is correct
105 Correct 82 ms 38184 KB Output is correct
106 Correct 47 ms 38184 KB Output is correct
107 Correct 53 ms 38184 KB Output is correct
108 Correct 67 ms 37932 KB Output is correct
109 Correct 63 ms 36940 KB Output is correct
110 Correct 85 ms 37932 KB Output is correct
111 Correct 84 ms 38044 KB Output is correct
112 Correct 83 ms 37932 KB Output is correct
113 Correct 141 ms 38616 KB Output is correct
114 Correct 83 ms 37968 KB Output is correct
115 Correct 94 ms 38700 KB Output is correct
116 Correct 68 ms 36916 KB Output is correct
117 Correct 95 ms 38752 KB Output is correct
118 Correct 82 ms 37820 KB Output is correct
119 Correct 72 ms 37576 KB Output is correct
120 Correct 102 ms 38700 KB Output is correct
121 Correct 111 ms 38728 KB Output is correct
122 Correct 95 ms 38640 KB Output is correct
123 Correct 95 ms 38644 KB Output is correct
124 Correct 120 ms 38712 KB Output is correct
125 Correct 79 ms 37988 KB Output is correct
126 Correct 67 ms 38980 KB Output is correct
127 Correct 70 ms 37680 KB Output is correct
128 Correct 85 ms 39056 KB Output is correct
129 Correct 88 ms 38960 KB Output is correct
130 Correct 410 ms 53844 KB Output is correct
131 Correct 292 ms 48172 KB Output is correct
132 Correct 451 ms 53776 KB Output is correct
133 Correct 377 ms 54064 KB Output is correct
134 Correct 357 ms 51600 KB Output is correct
135 Correct 422 ms 55080 KB Output is correct
136 Correct 396 ms 52980 KB Output is correct
137 Correct 382 ms 53032 KB Output is correct
138 Correct 437 ms 54824 KB Output is correct
139 Correct 433 ms 54768 KB Output is correct
140 Correct 469 ms 54700 KB Output is correct
141 Correct 425 ms 54708 KB Output is correct
142 Correct 444 ms 54656 KB Output is correct
143 Correct 475 ms 54572 KB Output is correct
144 Correct 400 ms 54748 KB Output is correct
145 Correct 435 ms 54712 KB Output is correct
146 Correct 458 ms 54684 KB Output is correct
147 Correct 425 ms 54868 KB Output is correct
148 Correct 503 ms 54664 KB Output is correct
149 Correct 407 ms 54640 KB Output is correct
150 Correct 216 ms 55432 KB Output is correct
151 Correct 343 ms 56008 KB Output is correct
152 Correct 353 ms 56108 KB Output is correct
153 Correct 380 ms 56108 KB Output is correct