oj.uz

답안 #543457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543457 2022-03-30T16:24:44 Z SmolBrain Fuel Station (NOI20_fuelstation) C++17
100 / 100
 470 ms 52380 KB 
// Om Namah Shivaya
// GM in 125 days

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct segtree {
    /*=======================================================*/

    struct data {
        ll sum, mnpref;
    };

    data neutral = {0, inf2};

    void merge(data &curr, data &left, data &right) {
        curr.sum = left.sum + right.sum;
        curr.mnpref = min(left.mnpref, left.sum + right.mnpref);
    }

    void create(int x, int lx, int rx, T v) {
        tr[x] = {v, v};
    }

    void modify(int x, int lx, int rx, T v) {
        tr[x].sum += v;
        tr[x].mnpref = tr[x].sum;
    }

    /*=======================================================*/

    int siz = 1;
    vector<data> tr;

    segtree(int n) {
        init(n);
    }

    segtree() {

    };

    void init(int n) {
        while (siz < n) siz *= 2;
        tr.assign(2 * siz, neutral);
    }

    void build(vector<T> &a, int n, int x, int lx, int rx) {
        if (rx - lx == 1) {
            if (lx < n) {
                create(x, lx, rx, a[lx]);
            }

            return;
        }

        int mid = (lx + rx) / 2;

        build(a, n, 2 * x + 1, lx, mid);
        build(a, n, 2 * x + 2, mid, rx);

        merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
    }

    void build(vector<T> &a, int n) {
        build(a, n, 0, 0, siz);
    }

    void pupd(int i, T v, int x, int lx, int rx) {
        if (rx - lx == 1) {
            modify(x, lx, rx, v);
            return;
        }

        int mid = (lx + rx) / 2;

        if (i < mid) {
            pupd(i, v, 2 * x + 1, lx, mid);
        }
        else {
            pupd(i, v, 2 * x + 2, mid, rx);
        }

        merge(tr[x], tr[2 * x + 1], tr[2 * x + 2]);
    }

    void pupd(int i, T v) {
        pupd(i, v, 0, 0, siz);
    }

    data query(int l, int r, int x, int lx, int rx) {
        if (lx >= r or rx <= l) return neutral;
        if (lx >= l and rx <= r) return tr[x];

        int mid = (lx + rx) / 2;

        data curr;
        data left = query(l, r, 2 * x + 1, lx, mid);
        data right = query(l, r, 2 * x + 2, mid, rx);

        merge(curr, left, right);
        return curr;
    }

    data query(int l, int r) {
        return query(l, r + 1, 0, 0, siz);
    }
};

void solve(int test_case)
{
    ll n, d; cin >> n >> d;
    vector<array<ll, 3>> a(n);
    rep(i, n) rep(j, 3) cin >> a[i][j];

    sort(all(a));

    vector<ll> diff(n + 5);
    diff[0] = a[0][0];
    rep1(i, n - 1) diff[i] = a[i][0] - a[i - 1][0];
    diff[n] = d - a[n - 1][0];

    auto check = [&](ll f) {
        ll prev = 0, fuel = f;

        rep(i, n) {
            auto [x, add, mx] = a[i];
            ll dis = x - prev;
            fuel -= dis;

            if (fuel < 0) {
                return false;
            }

            if (f <= mx) {
                fuel += add;
            }

            prev = x;
        }

        ll dis = d - prev;
        fuel -= dis;

        if (fuel < 0) return false;

        return true;
    };

    vector<ll> b(n);
    rep(i, n) b[i] = a[i][0];
    b.pb(d);
    sort(all(b));
    auto it = unique(all(b));
    b.resize(it - b.begin());

    segtree<ll> st(2 * n + 15);
    rep(i, n + 1) {
        ll x = 0;
        if (i < n) x = a[i][0];
        else x = d;
        x = lower_bound(all(b), x) - b.begin() + 1;
        st.pupd(2 * x, -diff[i]);
    }

    ll ans = d;

    vector<array<ll, 3>> c(n);
    rep(i, n) {
        auto [x, toadd, mx] = a[i];
        x = lower_bound(all(b), x) - b.begin() + 1;
        c[i] = {mx, x, toadd};
    }

    sort(rall(c));

    rep(i, n) {
        auto [mx, x, toadd] = c[i];
        st.pupd(2 * x + 1, toadd);

        ll f = mx;
        st.pupd(0, f);

        ll mnpref = st.query(0, 2 * n + 5).mnpref;

        if(mnpref >= 0){
            ll cansub = mnpref;
            amin(ans, f - cansub);
        }

        st.pupd(0, -f);
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

FuelStation.cpp: In function 'void solve(int)':
FuelStation.cpp:190:10: warning: variable 'check' set but not used [-Wunused-but-set-variable]
  190 |     auto check = [&](ll f) {
      |          ^~~~~
FuelStation.cpp: In function 'void usaco(std::string)':
FuelStation.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
FuelStation.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 316 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 340 ms 52264 KB Output is correct
2 Correct 348 ms 52196 KB Output is correct
3 Correct 346 ms 52128 KB Output is correct
4 Correct 348 ms 52128 KB Output is correct
5 Correct 345 ms 52192 KB Output is correct
6 Correct 345 ms 52260 KB Output is correct
7 Correct 340 ms 52248 KB Output is correct
8 Correct 335 ms 52204 KB Output is correct
9 Correct 360 ms 52316 KB Output is correct
10 Correct 335 ms 52128 KB Output is correct
11 Correct 344 ms 52204 KB Output is correct
12 Correct 354 ms 52208 KB Output is correct
13 Correct 343 ms 52200 KB Output is correct
14 Correct 374 ms 52196 KB Output is correct
15 Correct 339 ms 52204 KB Output is correct
16 Correct 366 ms 52120 KB Output is correct
17 Correct 329 ms 52136 KB Output is correct
18 Correct 347 ms 52192 KB Output is correct
19 Correct 347 ms 52196 KB Output is correct
20 Correct 362 ms 52116 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 9 ms 2132 KB Output is correct
3 Correct 12 ms 2132 KB Output is correct
4 Correct 10 ms 2260 KB Output is correct
5 Correct 12 ms 2132 KB Output is correct
6 Correct 11 ms 2076 KB Output is correct
7 Correct 10 ms 2132 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 11 ms 2132 KB Output is correct
15 Correct 10 ms 2124 KB Output is correct
16 Correct 10 ms 2100 KB Output is correct
17 Correct 10 ms 2132 KB Output is correct
18 Correct 11 ms 2132 KB Output is correct
19 Correct 10 ms 2244 KB Output is correct
20 Correct 9 ms 2104 KB Output is correct
21 Correct 10 ms 2104 KB Output is correct
22 Correct 10 ms 2196 KB Output is correct
23 Correct 10 ms 2196 KB Output is correct
24 Correct 11 ms 2132 KB Output is correct
25 Correct 14 ms 2132 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 9 ms 2132 KB Output is correct
3 Correct 12 ms 2132 KB Output is correct
4 Correct 10 ms 2260 KB Output is correct
5 Correct 12 ms 2132 KB Output is correct
6 Correct 11 ms 2076 KB Output is correct
7 Correct 10 ms 2132 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 11 ms 2132 KB Output is correct
15 Correct 10 ms 2124 KB Output is correct
16 Correct 10 ms 2100 KB Output is correct
17 Correct 10 ms 2132 KB Output is correct
18 Correct 11 ms 2132 KB Output is correct
19 Correct 10 ms 2244 KB Output is correct
20 Correct 9 ms 2104 KB Output is correct
21 Correct 10 ms 2104 KB Output is correct
22 Correct 10 ms 2196 KB Output is correct
23 Correct 10 ms 2196 KB Output is correct
24 Correct 11 ms 2132 KB Output is correct
25 Correct 14 ms 2132 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 353 ms 52260 KB Output is correct
28 Correct 369 ms 52204 KB Output is correct
29 Correct 352 ms 52148 KB Output is correct
30 Correct 339 ms 52324 KB Output is correct
31 Correct 367 ms 52128 KB Output is correct
32 Correct 340 ms 52328 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 337 ms 52144 KB Output is correct
40 Correct 366 ms 52196 KB Output is correct
41 Correct 330 ms 52144 KB Output is correct
42 Correct 387 ms 52208 KB Output is correct
43 Correct 341 ms 52204 KB Output is correct
44 Correct 388 ms 52240 KB Output is correct
45 Correct 330 ms 52380 KB Output is correct
46 Correct 345 ms 52200 KB Output is correct
47 Correct 346 ms 52200 KB Output is correct
48 Correct 376 ms 52116 KB Output is correct
49 Correct 361 ms 52256 KB Output is correct
50 Correct 334 ms 52200 KB Output is correct
51 Correct 404 ms 52132 KB Output is correct
52 Correct 328 ms 52248 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 9 ms 2132 KB Output is correct
18 Correct 12 ms 2132 KB Output is correct
19 Correct 10 ms 2260 KB Output is correct
20 Correct 12 ms 2132 KB Output is correct
21 Correct 11 ms 2076 KB Output is correct
22 Correct 10 ms 2132 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 11 ms 2132 KB Output is correct
30 Correct 10 ms 2124 KB Output is correct
31 Correct 10 ms 2100 KB Output is correct
32 Correct 10 ms 2132 KB Output is correct
33 Correct 11 ms 2132 KB Output is correct
34 Correct 10 ms 2244 KB Output is correct
35 Correct 9 ms 2104 KB Output is correct
36 Correct 10 ms 2104 KB Output is correct
37 Correct 10 ms 2196 KB Output is correct
38 Correct 10 ms 2196 KB Output is correct
39 Correct 11 ms 2132 KB Output is correct
40 Correct 14 ms 2132 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 9 ms 2132 KB Output is correct
43 Correct 11 ms 2104 KB Output is correct
44 Correct 11 ms 2108 KB Output is correct
45 Correct 11 ms 2096 KB Output is correct
46 Correct 11 ms 2112 KB Output is correct
47 Correct 14 ms 2120 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 11 ms 2132 KB Output is correct
55 Correct 12 ms 2132 KB Output is correct
56 Correct 12 ms 2132 KB Output is correct
57 Correct 12 ms 2080 KB Output is correct
58 Correct 11 ms 2132 KB Output is correct
59 Correct 11 ms 2100 KB Output is correct
60 Correct 10 ms 2132 KB Output is correct
61 Correct 11 ms 2132 KB Output is correct
62 Correct 11 ms 2196 KB Output is correct
63 Correct 12 ms 2116 KB Output is correct
64 Correct 11 ms 2132 KB Output is correct
65 Correct 13 ms 2120 KB Output is correct

Subtask #7
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 340 ms 52264 KB Output is correct
17 Correct 348 ms 52196 KB Output is correct
18 Correct 346 ms 52128 KB Output is correct
19 Correct 348 ms 52128 KB Output is correct
20 Correct 345 ms 52192 KB Output is correct
21 Correct 345 ms 52260 KB Output is correct
22 Correct 340 ms 52248 KB Output is correct
23 Correct 335 ms 52204 KB Output is correct
24 Correct 360 ms 52316 KB Output is correct
25 Correct 335 ms 52128 KB Output is correct
26 Correct 344 ms 52204 KB Output is correct
27 Correct 354 ms 52208 KB Output is correct
28 Correct 343 ms 52200 KB Output is correct
29 Correct 374 ms 52196 KB Output is correct
30 Correct 339 ms 52204 KB Output is correct
31 Correct 366 ms 52120 KB Output is correct
32 Correct 329 ms 52136 KB Output is correct
33 Correct 347 ms 52192 KB Output is correct
34 Correct 347 ms 52196 KB Output is correct
35 Correct 362 ms 52116 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 9 ms 2132 KB Output is correct
38 Correct 12 ms 2132 KB Output is correct
39 Correct 10 ms 2260 KB Output is correct
40 Correct 12 ms 2132 KB Output is correct
41 Correct 11 ms 2076 KB Output is correct
42 Correct 10 ms 2132 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 11 ms 2132 KB Output is correct
50 Correct 10 ms 2124 KB Output is correct
51 Correct 10 ms 2100 KB Output is correct
52 Correct 10 ms 2132 KB Output is correct
53 Correct 11 ms 2132 KB Output is correct
54 Correct 10 ms 2244 KB Output is correct
55 Correct 9 ms 2104 KB Output is correct
56 Correct 10 ms 2104 KB Output is correct
57 Correct 10 ms 2196 KB Output is correct
58 Correct 10 ms 2196 KB Output is correct
59 Correct 11 ms 2132 KB Output is correct
60 Correct 14 ms 2132 KB Output is correct
61 Correct 1 ms 316 KB Output is correct
62 Correct 353 ms 52260 KB Output is correct
63 Correct 369 ms 52204 KB Output is correct
64 Correct 352 ms 52148 KB Output is correct
65 Correct 339 ms 52324 KB Output is correct
66 Correct 367 ms 52128 KB Output is correct
67 Correct 340 ms 52328 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 320 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 337 ms 52144 KB Output is correct
75 Correct 366 ms 52196 KB Output is correct
76 Correct 330 ms 52144 KB Output is correct
77 Correct 387 ms 52208 KB Output is correct
78 Correct 341 ms 52204 KB Output is correct
79 Correct 388 ms 52240 KB Output is correct
80 Correct 330 ms 52380 KB Output is correct
81 Correct 345 ms 52200 KB Output is correct
82 Correct 346 ms 52200 KB Output is correct
83 Correct 376 ms 52116 KB Output is correct
84 Correct 361 ms 52256 KB Output is correct
85 Correct 334 ms 52200 KB Output is correct
86 Correct 404 ms 52132 KB Output is correct
87 Correct 328 ms 52248 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 1 ms 212 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 1 ms 212 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 324 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 1 ms 212 KB Output is correct
98 Correct 1 ms 212 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 1 ms 212 KB Output is correct
104 Correct 9 ms 2132 KB Output is correct
105 Correct 11 ms 2104 KB Output is correct
106 Correct 11 ms 2108 KB Output is correct
107 Correct 11 ms 2096 KB Output is correct
108 Correct 11 ms 2112 KB Output is correct
109 Correct 14 ms 2120 KB Output is correct
110 Correct 1 ms 212 KB Output is correct
111 Correct 1 ms 212 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 1 ms 212 KB Output is correct
115 Correct 1 ms 212 KB Output is correct
116 Correct 11 ms 2132 KB Output is correct
117 Correct 12 ms 2132 KB Output is correct
118 Correct 12 ms 2132 KB Output is correct
119 Correct 12 ms 2080 KB Output is correct
120 Correct 11 ms 2132 KB Output is correct
121 Correct 11 ms 2100 KB Output is correct
122 Correct 10 ms 2132 KB Output is correct
123 Correct 11 ms 2132 KB Output is correct
124 Correct 11 ms 2196 KB Output is correct
125 Correct 12 ms 2116 KB Output is correct
126 Correct 11 ms 2132 KB Output is correct
127 Correct 13 ms 2120 KB Output is correct
128 Correct 1 ms 212 KB Output is correct
129 Correct 369 ms 52196 KB Output is correct
130 Correct 453 ms 52344 KB Output is correct
131 Correct 437 ms 52132 KB Output is correct
132 Correct 469 ms 52208 KB Output is correct
133 Correct 414 ms 52196 KB Output is correct
134 Correct 461 ms 52200 KB Output is correct
135 Correct 1 ms 212 KB Output is correct
136 Correct 1 ms 212 KB Output is correct
137 Correct 1 ms 212 KB Output is correct
138 Correct 1 ms 212 KB Output is correct
139 Correct 1 ms 212 KB Output is correct
140 Correct 1 ms 212 KB Output is correct
141 Correct 449 ms 52244 KB Output is correct
142 Correct 432 ms 52256 KB Output is correct
143 Correct 437 ms 52256 KB Output is correct
144 Correct 470 ms 52260 KB Output is correct
145 Correct 420 ms 52116 KB Output is correct
146 Correct 465 ms 52352 KB Output is correct
147 Correct 408 ms 52192 KB Output is correct
148 Correct 415 ms 52196 KB Output is correct
149 Correct 381 ms 52244 KB Output is correct
150 Correct 369 ms 52212 KB Output is correct
151 Correct 345 ms 52200 KB Output is correct
152 Correct 394 ms 52240 KB Output is correct
153 Correct 390 ms 52248 KB Output is correct
154 Correct 357 ms 52132 KB Output is correct
155 Correct 400 ms 52076 KB Output is correct