oj.uz

Submission #681087

# Submission time Handle Problem Language Result Execution time Memory
681087 2023-01-12T10:46:05 Z AnsarYesma Segments (IZhO18_segments) C++17
100 / 100
 2661 ms 39776 KB 
/*
Codeforces: Tiananmen89, (1877)
Date: ///////
Generated by github.com/xalanq/cf-tool
*/

#define what_happened_on_tiananmen_square_in_1989 NULL

#include <bits/stdc++.h>

using namespace std;

int exctime = 0;
__attribute__((constructor)) void before_main() {
    cin.tie(0)->sync_with_stdio(0);
    exctime = clock();
    #ifdef DEBUG
        // freopen("debug.txt", "w", stderr);
    #else
        // freopen("problem.in", "r", stdin);
        // freopen("problem.out", "w", stdout);
    #endif
}

__attribute__((destructor)) void after_main() {
    #ifdef DEBUG
    cerr <<"\nTime: "<<fixed<<setprecision(3)<<double(clock()-exctime)/CLOCKS_PER_SEC<<'\n';
    #endif
}

// #define DEBUG

#ifdef DEBUG
    // #include </Users/ansar/Desktop/Ansar/misc/debug.h>
    #pragma GCC optimize("O0")
    #define ED  "\033[0m"
    #define RED   "\033[31m"  /* Red */
    #define GRN   "\033[32m"  /* Green */
    #define YLW   "\033[33m"  /* Yellow */
    #define CYN   "\033[36m"  /* Cyan */
    #define BLD   "\033[1m"   /* Bold */
    #define BP cerr << "<===>\n"
    #define val(x) cerr << (#x) << ": " << x <<endl;
    void debug(const auto &... r) {
        cerr << BLD << "|=";
      ((cerr << r << " "), ..., (cerr << ED << endl));
    }
    void println(const auto &... r) {
      ((cerr << BLD << r << " "), ..., (cerr << ED << endl));
    }
    void print(const auto &... r) {
      ((cerr << BLD << r << " "), ..., (cerr << ED));
    }
    double time() {
        return 1.0 * clock() / CLOCKS_PER_SEC;
    }
#else
    #pragma GCC optimize ("O3")
    #pragma GCC optimize("unroll-loops")
    // #pragma GCC target("avx2")
    // #pragma GCC optimize("Ofast")
    #define debug(...)
    #define print(...)
    #define println(...)
    #define time()
    #define val()
    #define BP
#endif

typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <db, db> pdd;
typedef pair <ld, ld> pld;
typedef string str;
typedef bitset<64> bin;

#define lb lower_bound // <=
#define ub upper_bound // <
#define sr sort
#define rv reverse
#define nl endl
#define pb push_back
#define eb emplace_back
#define in insert
#define rm erase
#define mp make_pair
#define np next_permutation
#define et empty
#define sz size
#define f first
#define s second
#define y1 yyyyy
#define cont continue

#define sync ios_base::sync_with_stdio(0), cin.tie(NULL)
#define is(ad) ((ad) ? "Yes" : "No")
#define IS(ad) ((ad) ? "YES" : "NO")
#define even(ad) (~(ad)&1)
#define odd(ad) ((ad)&1)
#define updiv(ad, bd) ((((ad) - 1) / (bd) ) + 1)
#define mod(ad, bd) ((((ad) % (bd)) + (bd)) % (bd))
#define mxz(ad, bd) ((ad) < (bd) ? (ad) = (bd), 1 : 0)
#define mnz(ad, bd) ((ad) > (bd) ? (ad) = (bd), 1 : 0)
#define min(ad, bd) ((ad) < (bd) ? (ad) : (bd))
#define max(ad, bd) ((ad) > (bd) ? (ad) : (bd))
#define all(ad) (ad).begin(), (ad).end()
#define arr(ad, bd, cd) ((ad) + (bd)), ((ad) + (bd) + (cd))
#define sorts(ad) sort(all(ad))
#define sorta(ad, bd, cd) sort(arr(ad, bd, cd))
#define sortsby(ad, bd) sort(all(ad),[&](const auto&l, const auto&r){return (bd);})
#define sortaby(ad, bd, cd, dd) sort(arr(ad, bd, cd),[&](const auto&l, const auto&r){return (dd);})
#define rvs(ad) reverse(all(ad))
#define rva(ad, bd, cd) reverse(arr(ad, bd, cd))
#define gl(ad) getline(cin, ad)
#define wfloat(ad) fixed << setprecision(ad)
#define infile(ad) freopen(#ad".in", "r", stdin);
#define outfile(ad) freopen(#ad".out", "w", stdout);
#define traverse(ad, bd) for (auto &a : x)
const int dx[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};

template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
template <typename T, typename D>
ostream& operator<<(ostream& os,const pair<T,D>&p){os<<p.f<<" "<<p.s;return os;}
template <typename T>
ostream& operator<<(ostream& os,const vector<T>&v){for(T x:v)os<<x<<' ';return os;}
template <typename T>
ostream& operator<<(ostream& os,const set<T>&v){for(T x:v)os<<x<<' ';return os;}
// g++ t.cpp -std=c++20 -DDEBUG -o o.out -DI -DO

const ll LINF = 1e18; //infinity
const double EPS = 1e-6 ; //epsilon
const double PI = 3.14159; //pi
const ll BS = 31 ; //hashbase
const ll LG = 11; //logarithm
const int INF = 1e9; //infinity
const ll M = 1e9 + 7; //mod
inline ll binpow(ll a,ll n){ll x = 1;while(n){if(n&1)(x*=a)%=M;(a*=a)%=M;n>>=1;}return x%M;}
inline ll Plus(const auto &... r){ll res=0;(((res+=r)%=M), ...);return res;}
inline ll Mult(const auto &... r){ll res=1;(((res*=r)%=M), ...);return res;}
inline ll Div(const auto &... r){ll res=1;res=Mult(binpow(r,M-2)...);return res;}
const ll N = 2e5 + 9; //maxn
const ll Q = 2e5; //maxnq

ll n, T, nq;
set <int> mex;
int mx = 1;
vector <pii> v, w;
map <int, pii> s;
ll lastans = 0;
vector <int> qL[Q], qR[Q];
vector <pii> q[Q];
int qmx[Q];
int t[N], a[N], b[N], k[N];

void add(int i) {
    ll L = (a[i]^(T*lastans)), R = (b[i]^(T*lastans));
    if (R < L)
        swap(L, R);
    v.pb({L, R});
    s[mx++] = {L, R};
}

void remove(int i) {
    w.pb(s[a[i]]);
    s.erase(a[i]);
}

ll get(int I) {
    ll L = a[I]^(T*lastans), R = b[I]^(T*lastans), K = k[I], ans = 0;
    if (R < L)
        swap(L, R);
    if (R-L+1 < K)
        return 0;
    for (auto p : v) {
        if (min(p.s, R) - max(p.f, L) + 1 >= K) {
            ans++;
        }
    }
    for (auto p : w) {
        if (min(p.s, R) - max(p.f, L) + 1 >= K) {
            ans--;
        }
    }
    ll Q = 0;
    while (Q <= nq && qmx[Q] < K)
        Q++;
    if (Q > nq) {
        return lastans = ans;
    }
    for (auto p : q[Q]) {
        if (min(p.s, R) - max(p.f, L) + 1 >= K) {
            ans++;
        }
    }
    for (int i = Q+1; i <= nq; ++i) {
        if (qL[i].et())
            break;
        ll invR = (lb(all(qR[i]), L+K-1) - qR[i].begin());
        ll invL = (qL[i].end() - ub(all(qL[i]), R-K+1));
        ans += (qL[i].sz()-invL-invR);
    }
    return lastans = ans;
}

void recalc(int I) {
    v.clear();
    w.clear();
    for (int i = 0; i <= nq; ++i) {
        qL[i].clear();
        qR[i].clear();
        q[i].clear();
        qmx[i] = 0;
    }
    vector <pii> qq;
    for (auto x : s) {
        qq.pb(x.s);
    }
    sort(all(qq), [](pii a, pii b){return a.s-a.f+1 < b.s-b.f+1;});
    for (int i = 0; i < qq.sz(); ++i) {
        qL[i/nq].pb(qq[i].f);
        qR[i/nq].pb(qq[i].s);
        q[i/nq].pb(qq[i]);
        qmx[i/nq] = max(qmx[i/nq], qq[i].s-qq[i].f+1);
    }
    for (int i = 0; i <= nq; ++i) {
        sorts(qL[i]);
        sorts(qR[i]);
    }
}

int main() {
    cin >> n >> T;
    for (int i = 1; i <= n; ++i) {
        cin >> t[i] >> a[i];
        if (t[i] != 2)
            cin >> b[i];
        if (t[i] == 3)
            cin >> k[i];
    }
    int lg = 0;
    while ((1 << lg) < n)
        lg++;
    nq = sqrt(n*lg)+10;
    bool flag = 1;
    for (int i = 1; i <= n; ++i) {
        if (t[i] == 1)
            add(i);
        if (t[i] == 2)
            remove(i);
        if (t[i] == 3) {
            cout << get(i) << '\n';
        }
        if (i % nq == 0) {
            recalc(i);
        }
    }
}
/*
NOTES
recalc V
add ?
remove ?
get V
*/

Compilation message

segments.cpp:144:22: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
  144 | inline ll Plus(const auto &... r){ll res=0;(((res+=r)%=M), ...);return res;}
      |                      ^~~~
segments.cpp:145:22: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
  145 | inline ll Mult(const auto &... r){ll res=1;(((res*=r)%=M), ...);return res;}
      |                      ^~~~
segments.cpp:146:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
  146 | inline ll Div(const auto &... r){ll res=1;res=Mult(binpow(r,M-2)...);return res;}
      |                     ^~~~
segments.cpp: In function 'void recalc(int)':
segments.cpp:225:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  225 |     for (int i = 0; i < qq.sz(); ++i) {
      |                     ~~^~~~~~~~~
segments.cpp: In function 'int main()':
segments.cpp:250:10: warning: unused variable 'flag' [-Wunused-variable]
  250 |     bool flag = 1;
      |          ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14428 KB Output is correct
2 Correct 8 ms 14440 KB Output is correct
3 Correct 10 ms 14552 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 19 ms 15112 KB Output is correct
6 Correct 18 ms 14924 KB Output is correct
7 Correct 13 ms 14600 KB Output is correct
8 Correct 16 ms 14932 KB Output is correct
9 Correct 16 ms 14932 KB Output is correct
10 Correct 17 ms 15088 KB Output is correct
11 Correct 18 ms 14956 KB Output is correct
12 Correct 18 ms 14944 KB Output is correct
13 Correct 18 ms 15080 KB Output is correct
14 Correct 16 ms 14888 KB Output is correct
15 Correct 10 ms 14548 KB Output is correct
16 Correct 10 ms 14548 KB Output is correct
17 Correct 14 ms 14692 KB Output is correct
18 Correct 18 ms 14952 KB Output is correct
19 Correct 14 ms 14808 KB Output is correct
20 Correct 16 ms 14820 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 943 ms 24084 KB Output is correct
2 Correct 950 ms 24016 KB Output is correct
3 Correct 936 ms 23972 KB Output is correct
4 Correct 1000 ms 24520 KB Output is correct
5 Correct 1016 ms 28060 KB Output is correct
6 Correct 963 ms 28252 KB Output is correct
7 Correct 957 ms 24056 KB Output is correct
8 Correct 940 ms 24324 KB Output is correct
9 Correct 957 ms 24156 KB Output is correct
10 Correct 579 ms 21416 KB Output is correct
11 Correct 701 ms 22064 KB Output is correct
12 Correct 1044 ms 26188 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 17868 KB Output is correct
2 Correct 65 ms 17876 KB Output is correct
3 Correct 98 ms 17928 KB Output is correct
4 Correct 69 ms 17936 KB Output is correct
5 Correct 1134 ms 26108 KB Output is correct
6 Correct 1042 ms 24580 KB Output is correct
7 Correct 1073 ms 25708 KB Output is correct
8 Correct 993 ms 27912 KB Output is correct
9 Correct 944 ms 27540 KB Output is correct
10 Correct 854 ms 24776 KB Output is correct
11 Correct 188 ms 18336 KB Output is correct
12 Correct 851 ms 25380 KB Output is correct
13 Correct 764 ms 23900 KB Output is correct
14 Correct 517 ms 20976 KB Output is correct
15 Correct 467 ms 20520 KB Output is correct
16 Correct 361 ms 19584 KB Output is correct
17 Correct 922 ms 23732 KB Output is correct
18 Correct 935 ms 23868 KB Output is correct
19 Correct 945 ms 23696 KB Output is correct
20 Correct 949 ms 23760 KB Output is correct
21 Correct 215 ms 18600 KB Output is correct
22 Correct 613 ms 22000 KB Output is correct
23 Correct 741 ms 23184 KB Output is correct
24 Correct 647 ms 22208 KB Output is correct
25 Correct 74 ms 17996 KB Output is correct
26 Correct 70 ms 18016 KB Output is correct
27 Correct 78 ms 17888 KB Output is correct
28 Correct 74 ms 18044 KB Output is correct
29 Correct 766 ms 23728 KB Output is correct
30 Correct 784 ms 23524 KB Output is correct
31 Correct 919 ms 27524 KB Output is correct
32 Correct 834 ms 24744 KB Output is correct
33 Correct 783 ms 24112 KB Output is correct
34 Correct 454 ms 20440 KB Output is correct
35 Correct 707 ms 22964 KB Output is correct
36 Correct 813 ms 24440 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 18124 KB Output is correct
2 Correct 67 ms 18124 KB Output is correct
3 Correct 70 ms 18176 KB Output is correct
4 Correct 69 ms 18088 KB Output is correct
5 Correct 1026 ms 26696 KB Output is correct
6 Correct 475 ms 20932 KB Output is correct
7 Correct 1006 ms 27260 KB Output is correct
8 Correct 567 ms 21668 KB Output is correct
9 Correct 581 ms 21908 KB Output is correct
10 Correct 884 ms 25780 KB Output is correct
11 Correct 320 ms 19704 KB Output is correct
12 Correct 932 ms 28056 KB Output is correct
13 Correct 774 ms 24084 KB Output is correct
14 Correct 535 ms 21316 KB Output is correct
15 Correct 933 ms 27404 KB Output is correct
16 Correct 826 ms 24416 KB Output is correct
17 Correct 906 ms 24088 KB Output is correct
18 Correct 901 ms 24120 KB Output is correct
19 Correct 903 ms 24220 KB Output is correct
20 Correct 901 ms 24084 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14428 KB Output is correct
2 Correct 8 ms 14440 KB Output is correct
3 Correct 10 ms 14552 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 19 ms 15112 KB Output is correct
6 Correct 18 ms 14924 KB Output is correct
7 Correct 13 ms 14600 KB Output is correct
8 Correct 16 ms 14932 KB Output is correct
9 Correct 16 ms 14932 KB Output is correct
10 Correct 17 ms 15088 KB Output is correct
11 Correct 18 ms 14956 KB Output is correct
12 Correct 18 ms 14944 KB Output is correct
13 Correct 18 ms 15080 KB Output is correct
14 Correct 16 ms 14888 KB Output is correct
15 Correct 10 ms 14548 KB Output is correct
16 Correct 10 ms 14548 KB Output is correct
17 Correct 14 ms 14692 KB Output is correct
18 Correct 18 ms 14952 KB Output is correct
19 Correct 14 ms 14808 KB Output is correct
20 Correct 16 ms 14820 KB Output is correct
21 Correct 943 ms 24084 KB Output is correct
22 Correct 950 ms 24016 KB Output is correct
23 Correct 936 ms 23972 KB Output is correct
24 Correct 1000 ms 24520 KB Output is correct
25 Correct 1016 ms 28060 KB Output is correct
26 Correct 963 ms 28252 KB Output is correct
27 Correct 957 ms 24056 KB Output is correct
28 Correct 940 ms 24324 KB Output is correct
29 Correct 957 ms 24156 KB Output is correct
30 Correct 579 ms 21416 KB Output is correct
31 Correct 701 ms 22064 KB Output is correct
32 Correct 1044 ms 26188 KB Output is correct
33 Correct 65 ms 18124 KB Output is correct
34 Correct 67 ms 18124 KB Output is correct
35 Correct 70 ms 18176 KB Output is correct
36 Correct 69 ms 18088 KB Output is correct
37 Correct 1026 ms 26696 KB Output is correct
38 Correct 475 ms 20932 KB Output is correct
39 Correct 1006 ms 27260 KB Output is correct
40 Correct 567 ms 21668 KB Output is correct
41 Correct 581 ms 21908 KB Output is correct
42 Correct 884 ms 25780 KB Output is correct
43 Correct 320 ms 19704 KB Output is correct
44 Correct 932 ms 28056 KB Output is correct
45 Correct 774 ms 24084 KB Output is correct
46 Correct 535 ms 21316 KB Output is correct
47 Correct 933 ms 27404 KB Output is correct
48 Correct 826 ms 24416 KB Output is correct
49 Correct 906 ms 24088 KB Output is correct
50 Correct 901 ms 24120 KB Output is correct
51 Correct 903 ms 24220 KB Output is correct
52 Correct 901 ms 24084 KB Output is correct
53 Correct 72 ms 18096 KB Output is correct
54 Correct 71 ms 18124 KB Output is correct
55 Correct 68 ms 18140 KB Output is correct
56 Correct 79 ms 18212 KB Output is correct
57 Correct 712 ms 22376 KB Output is correct
58 Correct 395 ms 20520 KB Output is correct
59 Correct 970 ms 25148 KB Output is correct
60 Correct 371 ms 20360 KB Output is correct
61 Correct 771 ms 24028 KB Output is correct
62 Correct 926 ms 27196 KB Output is correct
63 Correct 939 ms 27816 KB Output is correct
64 Correct 963 ms 27284 KB Output is correct
65 Correct 399 ms 20212 KB Output is correct
66 Correct 342 ms 19784 KB Output is correct
67 Correct 830 ms 24544 KB Output is correct
68 Correct 722 ms 23088 KB Output is correct
69 Correct 921 ms 24248 KB Output is correct
70 Correct 934 ms 24148 KB Output is correct
71 Correct 910 ms 24148 KB Output is correct
72 Correct 921 ms 24168 KB Output is correct
73 Correct 453 ms 20596 KB Output is correct
74 Correct 711 ms 23156 KB Output is correct
75 Correct 957 ms 28256 KB Output is correct
76 Correct 928 ms 27828 KB Output is correct
77 Correct 70 ms 18124 KB Output is correct
78 Correct 68 ms 18184 KB Output is correct
79 Correct 72 ms 18208 KB Output is correct
80 Correct 68 ms 18136 KB Output is correct
81 Correct 678 ms 23044 KB Output is correct
82 Correct 453 ms 20716 KB Output is correct
83 Correct 308 ms 19408 KB Output is correct
84 Correct 681 ms 23024 KB Output is correct
85 Correct 812 ms 24676 KB Output is correct
86 Correct 837 ms 25264 KB Output is correct
87 Correct 588 ms 21948 KB Output is correct
88 Correct 313 ms 19488 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14428 KB Output is correct
2 Correct 8 ms 14440 KB Output is correct
3 Correct 10 ms 14552 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 19 ms 15112 KB Output is correct
6 Correct 18 ms 14924 KB Output is correct
7 Correct 13 ms 14600 KB Output is correct
8 Correct 16 ms 14932 KB Output is correct
9 Correct 16 ms 14932 KB Output is correct
10 Correct 17 ms 15088 KB Output is correct
11 Correct 18 ms 14956 KB Output is correct
12 Correct 18 ms 14944 KB Output is correct
13 Correct 18 ms 15080 KB Output is correct
14 Correct 16 ms 14888 KB Output is correct
15 Correct 10 ms 14548 KB Output is correct
16 Correct 10 ms 14548 KB Output is correct
17 Correct 14 ms 14692 KB Output is correct
18 Correct 18 ms 14952 KB Output is correct
19 Correct 14 ms 14808 KB Output is correct
20 Correct 16 ms 14820 KB Output is correct
21 Correct 943 ms 24084 KB Output is correct
22 Correct 950 ms 24016 KB Output is correct
23 Correct 936 ms 23972 KB Output is correct
24 Correct 1000 ms 24520 KB Output is correct
25 Correct 1016 ms 28060 KB Output is correct
26 Correct 963 ms 28252 KB Output is correct
27 Correct 957 ms 24056 KB Output is correct
28 Correct 940 ms 24324 KB Output is correct
29 Correct 957 ms 24156 KB Output is correct
30 Correct 579 ms 21416 KB Output is correct
31 Correct 701 ms 22064 KB Output is correct
32 Correct 1044 ms 26188 KB Output is correct
33 Correct 73 ms 17868 KB Output is correct
34 Correct 65 ms 17876 KB Output is correct
35 Correct 98 ms 17928 KB Output is correct
36 Correct 69 ms 17936 KB Output is correct
37 Correct 1134 ms 26108 KB Output is correct
38 Correct 1042 ms 24580 KB Output is correct
39 Correct 1073 ms 25708 KB Output is correct
40 Correct 993 ms 27912 KB Output is correct
41 Correct 944 ms 27540 KB Output is correct
42 Correct 854 ms 24776 KB Output is correct
43 Correct 188 ms 18336 KB Output is correct
44 Correct 851 ms 25380 KB Output is correct
45 Correct 764 ms 23900 KB Output is correct
46 Correct 517 ms 20976 KB Output is correct
47 Correct 467 ms 20520 KB Output is correct
48 Correct 361 ms 19584 KB Output is correct
49 Correct 922 ms 23732 KB Output is correct
50 Correct 935 ms 23868 KB Output is correct
51 Correct 945 ms 23696 KB Output is correct
52 Correct 949 ms 23760 KB Output is correct
53 Correct 215 ms 18600 KB Output is correct
54 Correct 613 ms 22000 KB Output is correct
55 Correct 741 ms 23184 KB Output is correct
56 Correct 647 ms 22208 KB Output is correct
57 Correct 74 ms 17996 KB Output is correct
58 Correct 70 ms 18016 KB Output is correct
59 Correct 78 ms 17888 KB Output is correct
60 Correct 74 ms 18044 KB Output is correct
61 Correct 766 ms 23728 KB Output is correct
62 Correct 784 ms 23524 KB Output is correct
63 Correct 919 ms 27524 KB Output is correct
64 Correct 834 ms 24744 KB Output is correct
65 Correct 783 ms 24112 KB Output is correct
66 Correct 454 ms 20440 KB Output is correct
67 Correct 707 ms 22964 KB Output is correct
68 Correct 813 ms 24440 KB Output is correct
69 Correct 65 ms 18124 KB Output is correct
70 Correct 67 ms 18124 KB Output is correct
71 Correct 70 ms 18176 KB Output is correct
72 Correct 69 ms 18088 KB Output is correct
73 Correct 1026 ms 26696 KB Output is correct
74 Correct 475 ms 20932 KB Output is correct
75 Correct 1006 ms 27260 KB Output is correct
76 Correct 567 ms 21668 KB Output is correct
77 Correct 581 ms 21908 KB Output is correct
78 Correct 884 ms 25780 KB Output is correct
79 Correct 320 ms 19704 KB Output is correct
80 Correct 932 ms 28056 KB Output is correct
81 Correct 774 ms 24084 KB Output is correct
82 Correct 535 ms 21316 KB Output is correct
83 Correct 933 ms 27404 KB Output is correct
84 Correct 826 ms 24416 KB Output is correct
85 Correct 906 ms 24088 KB Output is correct
86 Correct 901 ms 24120 KB Output is correct
87 Correct 903 ms 24220 KB Output is correct
88 Correct 901 ms 24084 KB Output is correct
89 Correct 72 ms 18096 KB Output is correct
90 Correct 71 ms 18124 KB Output is correct
91 Correct 68 ms 18140 KB Output is correct
92 Correct 79 ms 18212 KB Output is correct
93 Correct 712 ms 22376 KB Output is correct
94 Correct 395 ms 20520 KB Output is correct
95 Correct 970 ms 25148 KB Output is correct
96 Correct 371 ms 20360 KB Output is correct
97 Correct 771 ms 24028 KB Output is correct
98 Correct 926 ms 27196 KB Output is correct
99 Correct 939 ms 27816 KB Output is correct
100 Correct 963 ms 27284 KB Output is correct
101 Correct 399 ms 20212 KB Output is correct
102 Correct 342 ms 19784 KB Output is correct
103 Correct 830 ms 24544 KB Output is correct
104 Correct 722 ms 23088 KB Output is correct
105 Correct 921 ms 24248 KB Output is correct
106 Correct 934 ms 24148 KB Output is correct
107 Correct 910 ms 24148 KB Output is correct
108 Correct 921 ms 24168 KB Output is correct
109 Correct 453 ms 20596 KB Output is correct
110 Correct 711 ms 23156 KB Output is correct
111 Correct 957 ms 28256 KB Output is correct
112 Correct 928 ms 27828 KB Output is correct
113 Correct 70 ms 18124 KB Output is correct
114 Correct 68 ms 18184 KB Output is correct
115 Correct 72 ms 18208 KB Output is correct
116 Correct 68 ms 18136 KB Output is correct
117 Correct 678 ms 23044 KB Output is correct
118 Correct 453 ms 20716 KB Output is correct
119 Correct 308 ms 19408 KB Output is correct
120 Correct 681 ms 23024 KB Output is correct
121 Correct 812 ms 24676 KB Output is correct
122 Correct 837 ms 25264 KB Output is correct
123 Correct 588 ms 21948 KB Output is correct
124 Correct 313 ms 19488 KB Output is correct
125 Correct 153 ms 21940 KB Output is correct
126 Correct 156 ms 21932 KB Output is correct
127 Correct 179 ms 21952 KB Output is correct
128 Correct 161 ms 21924 KB Output is correct
129 Correct 151 ms 21868 KB Output is correct
130 Correct 165 ms 21988 KB Output is correct
131 Correct 1151 ms 26480 KB Output is correct
132 Correct 2344 ms 32028 KB Output is correct
133 Correct 2621 ms 35144 KB Output is correct
134 Correct 1461 ms 27500 KB Output is correct
135 Correct 2661 ms 36896 KB Output is correct
136 Correct 729 ms 25164 KB Output is correct
137 Correct 2419 ms 39100 KB Output is correct
138 Correct 2100 ms 32216 KB Output is correct
139 Correct 2357 ms 35928 KB Output is correct
140 Correct 2400 ms 38000 KB Output is correct
141 Correct 2241 ms 33824 KB Output is correct
142 Correct 575 ms 23248 KB Output is correct
143 Correct 1089 ms 25664 KB Output is correct
144 Correct 448 ms 22644 KB Output is correct
145 Correct 2424 ms 37944 KB Output is correct
146 Correct 1610 ms 28792 KB Output is correct
147 Correct 1137 ms 26092 KB Output is correct
148 Correct 1060 ms 25624 KB Output is correct
149 Correct 2458 ms 33072 KB Output is correct
150 Correct 2486 ms 33020 KB Output is correct
151 Correct 2464 ms 32948 KB Output is correct
152 Correct 2459 ms 33108 KB Output is correct
153 Correct 2451 ms 33316 KB Output is correct
154 Correct 2478 ms 33152 KB Output is correct
155 Correct 813 ms 24172 KB Output is correct
156 Correct 1211 ms 26220 KB Output is correct
157 Correct 2411 ms 38416 KB Output is correct
158 Correct 2411 ms 39048 KB Output is correct
159 Correct 2167 ms 32828 KB Output is correct
160 Correct 1695 ms 29160 KB Output is correct
161 Correct 175 ms 22044 KB Output is correct
162 Correct 165 ms 21976 KB Output is correct
163 Correct 163 ms 22104 KB Output is correct
164 Correct 235 ms 22164 KB Output is correct
165 Correct 181 ms 22004 KB Output is correct
166 Correct 163 ms 22108 KB Output is correct
167 Correct 2402 ms 39776 KB Output is correct
168 Correct 2399 ms 39636 KB Output is correct
169 Correct 2409 ms 37968 KB Output is correct
170 Correct 2394 ms 37472 KB Output is correct
171 Correct 2231 ms 33648 KB Output is correct
172 Correct 1474 ms 27604 KB Output is correct
173 Correct 2410 ms 38388 KB Output is correct
174 Correct 1536 ms 28044 KB Output is correct
175 Correct 2297 ms 35116 KB Output is correct
176 Correct 1060 ms 25532 KB Output is correct
177 Correct 2128 ms 32488 KB Output is correct
178 Correct 2065 ms 31856 KB Output is correct