oj.uz

Submission #503173

# Submission time Handle Problem Language Result Execution time Memory
503173 2022-01-07T12:30:17 Z cig32 Food Court (JOI21_foodcourt) C++17
89 / 100
 1000 ms 172368 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
const int MAXN = 2.5e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
    int u = uniform_int_distribution<int>(x, y)(rng);
    return u;
}
int bm(int b, int p) { // bigmod
    if(p==0) return 1;
    int r = bm(b, p/2);
    if(p&1) return (((r*r) % MOD) * b) % MOD;
    return (r*r) % MOD;
}
int N, M, Q;
 
struct segtree_beats {
    bool cmp(long long x, long long y) { return x > y; }
    int stok;
    const long long extr = 2e18;
    struct node {
        long long max1, max2, maxc;
        long long min1, min2, minc;
        long long lazy, sum;
        long long l, r;
    };
    vector<node> a;
    void pushtag_max(int idx, long long val) {
        if(val >= a[idx].max1) return;
        a[idx].sum -= (a[idx].max1 - val) * a[idx].maxc;
        a[idx].max1 = val;
        if(a[idx].l == a[idx].r) {
            a[idx].min1 = val;
        }
        else {
            if(a[idx].min1 >= val) {
                a[idx].min1 = val;
                a[idx].min2 = extr;
                a[idx].minc = a[idx].r - a[idx].l + 1;
            }
            else if(a[idx].min2 > val && a[idx].min2 != extr) {
                a[idx].min2 = val;
            }
        }
    }
    void pushtag_min(int idx, long long val) {
        if(val <= a[idx].min1) return;
        a[idx].sum += (val - a[idx].min1) * a[idx].minc;
        a[idx].min1 = val;
        if(a[idx].l == a[idx].r) {
            a[idx].max1 = val;
        }
        else {
            if(a[idx].max1 <= val) {
                a[idx].max1 = val;
                a[idx].max2 = -extr;
                a[idx].maxc = a[idx].r - a[idx].l + 1;
            }
            else if(a[idx].max2 < val && a[idx].max2 != -extr) {
                a[idx].max2 = val;
            }
        }
    }
    void pushtag_add(int idx, long long val) {
        a[idx].max1 += val;
        if(a[idx].max2 != -extr) a[idx].max2 += val;
        a[idx].min1 += val;
        if(a[idx].min2 != extr) a[idx].min2 += val;
        a[idx].lazy += val;
        a[idx].sum += val * (a[idx].r - a[idx].l + 1);
    }
    void pushdown(int idx) {
        pushtag_add(2*idx+1, a[idx].lazy);
        pushtag_add(2*idx+2, a[idx].lazy);
        a[idx].lazy = 0;
        pushtag_max(2*idx+1, a[idx].max1);
        pushtag_max(2*idx+2, a[idx].max1);
        pushtag_min(2*idx+1, a[idx].min1);
        pushtag_min(2*idx+2, a[idx].min1);
    }
    void pushup(int idx) {
        long long max1, max2, maxc;
        long long min1, min2, minc;
        long long lazy, sum;
        long long l, r;
        a[idx].max1 = max(a[2*idx+1].max1, a[2*idx+2].max1);
        a[idx].max2 = (a[2*idx+1].max1 == a[2*idx+2].max1 ?
                       max(a[2*idx+1].max2, a[2*idx+2].max2) :
                       (a[2*idx+1].max1 < a[2*idx+2].max1 ?
                        max(a[2*idx+1].max1, a[2*idx+2].max2) : 
                        max(a[2*idx+1].max2, a[2*idx+2].max1)
                        ));
        a[idx].maxc = (a[2*idx+1].max1 == a[2*idx+2].max1 ? 
                       a[2*idx+1].maxc + a[2*idx+2].maxc :
                       (a[2*idx+1].max1 < a[2*idx+2].max1 ? 
                        a[2*idx+2].maxc :
                        a[2*idx+1].maxc)
                       );
        a[idx].min1 = min(a[2*idx+1].min1, a[2*idx+2].min1);
        a[idx].min2 = (a[2*idx+1].min1 == a[2*idx+2].min1 ?
                       min(a[2*idx+1].min2, a[2*idx+2].min2) :
                       (a[2*idx+1].min1 > a[2*idx+2].min1 ?
                        min(a[2*idx+1].min1, a[2*idx+2].min2) : 
                        min(a[2*idx+1].min2, a[2*idx+2].min1)
                        ));
        a[idx].minc = (a[2*idx+1].min1 == a[2*idx+2].min1 ? 
                       a[2*idx+1].minc + a[2*idx+2].minc :
                       (a[2*idx+1].min1 > a[2*idx+2].min1 ? 
                        a[2*idx+2].minc :
                        a[2*idx+1].minc)
                       );
        a[idx].sum = a[2*idx+1].sum + a[2*idx+2].sum;
    }
    void init1(int l, int r, int idx, long long val) {
        a[idx].l = l, a[idx].r = r;
        if(l == r) {
            a[idx].max1 = a[idx].min1 = val;
            a[idx].max2 = -extr;
            a[idx].min2 = extr;
            a[idx].maxc = a[idx].minc = 1;
            a[idx].lazy = 0;
            a[idx].sum = val;
            return;
        }
        int mid = (l+r) >> 1;
        init1(l, mid, 2*idx+1, val);
        init1(mid+1, r, 2*idx+2, val);
        pushup(idx);
    }
    void u1(int l, int r, int constl, int constr, int idx, long long v) {
        if(v >= a[idx].max1) return;
        if(l<=constl && constr<=r && v>a[idx].max2) {
            pushtag_max(idx, v);
            return;
        }
        pushdown(idx);
        int mid = (constl+constr) >> 1;
        if(mid < l || r < constl) u1(l, r, mid+1, constr, 2*idx+2, v);
        else if(constr < l || r < mid+1) u1(l, r, constl, mid, 2*idx+1, v);
        else {
            u1(l, r, constl, mid, 2*idx+1, v);
            u1(l, r, mid+1, constr, 2*idx+2, v);
        }
        pushup(idx);
    }
    void u2(int l, int r, int constl, int constr, int idx, long long v) {
        if(v <= a[idx].min1) return;
        if(l<=constl && constr<=r && v<a[idx].min2) {
            pushtag_min(idx, v);
            return;
        }
        pushdown(idx);
        int mid = (constl+constr) >> 1;
        if(mid < l || r < constl) u2(l, r, mid+1, constr, 2*idx+2, v);
        else if(constr < l || r < mid+1) u2(l, r, constl, mid, 2*idx+1, v);
        else {
            u2(l, r, constl, mid, 2*idx+1, v);
            u2(l, r, mid+1, constr, 2*idx+2, v);
        }
        pushup(idx);
    }
    void u3(int l, int r, int constl, int constr, int idx, long long v) {
        if(l <= constl && constr <= r) {
            pushtag_add(idx, v);
            return;
        }
        pushdown(idx);
        int mid = (constl+constr) >> 1;
        if(mid < l || r < constl) u3(l, r, mid+1, constr, 2*idx+2, v);
        else if(constr < l || r < mid+1) u3(l, r, constl, mid, 2*idx+1, v);
        else {
            u3(l, r, constl, mid, 2*idx+1, v);
            u3(l, r, mid+1, constr, 2*idx+2, v);
        }
        pushup(idx);
    }
    long long qu(int l, int r, int constl, int constr, int idx) {
        if(l <= constl && constr <= r) {
            return a[idx].sum;
        }
        pushdown(idx);
        int mid = (constl+constr) >> 1;
        if(mid < l || r < constl) return qu(l, r, mid+1, constr, 2*idx+2);
        else if(constr < l || r < mid+1) return qu(l, r, constl, mid, 2*idx+1);
        else {
            return qu(l, r, constl, mid, 2*idx+1) + qu(l, r, mid+1, constr, 2*idx+2);
        }
    }
    public:
    void resize(int k) {
        stok = k;
        a.resize(4*k + 10);
    }
    void init(long long v) { // Initialize everything to v
        init1(0, stok, 0, v);
    }
    void min_with(int l, int r, long long v) {
        u1(l, r, 0, stok, 0, v);
    }
    void max_with(int l, int r, long long v) {
        u2(l, r, 0, stok, 0, v);
    }
    void range_add(int l, int r, long long v) {
        u3(l, r, 0, stok, 0, v);
    }
    long long query_sum(int l, int r) {
        return (long long)qu(l, r, 0, stok, 0);
    }
};
struct _1m {
    segtree_beats a;
    public:
    void join(int l, int r, int c, int k) {
        a.range_add(l, r, k);
    }
    void leave(int l, int r, int k) {
        a.range_add(l, r, -k);
        a.max_with(l, r, 0);
    }
    int service(int shop, int b) {
        return (a.query_sum(shop, shop) >= b ? 1 : 0);
    }
};

void solve_1m() {
    _1m ar;
    ar.a.resize(N);
    ar.a.init(0);
    while(Q--) {
        int t;
        cin >> t;
        if(t == 1) {
            int l, r, c, k;
            cin >> l >> r >> c >> k;
            ar.join(l, r, c, k);
        }
        else if(t == 2) {
            int l, r, k;
            cin >> l >> r >> k;
            ar.leave(l, r, k);
        }
        else {
            int a, b;
            cin >> a >> b;
            cout << ar.service(a, b) << "\n";
        }
    }
}
segtree_beats stb;
vector<pair<int, pair<int, int> > > v[4*MAXN];
vector<int> w[4*MAXN];
int p[4*MAXN];
int ti=0;
int rp[MAXN];
void update(int l, int r, int constl, int constr, int idx, int c, int k) {
    if(l<=constl && constr<=r) {
        v[idx].push_back({ti, {c, k}});
        w[idx].push_back(w[idx].empty() ? k : w[idx][w[idx].size() - 1] + k);
        return;
    }
    int mid = (constl+constr) >> 1;
    if(mid < l || r < constl) update(l, r, mid+1, constr, 2*idx+2, c, k);
    else if(constr < l || r < mid+1) update(l, r, constl, mid, 2*idx+1, c, k);
    else {
        update(l, r, constl, mid, 2*idx+1, c, k);
        update(l, r, mid+1, constr, 2*idx+2, c, k);
    }
} 
void build(int l, int r, int idx) {
    if(l == r) {
        rp[l] = idx;
        return;
    }
    int mid = (l+r) >> 1;
    build(l, mid, 2*idx+1);
    build(mid+1, r, 2*idx+2);
    p[2*idx+1] = p[2*idx+2] = idx;
}
void join(int l, int r, int c, int k) {
    ti++;
    stb.range_add(l, r, k);
    update(l, r, 0, MAXN-1, 0, c, k);
}
void leave(int l, int r, int k) {
    stb.range_add(l, r, -k);
    stb.max_with(l, r, 0);
}
int service(int a, int b) { // log^3 n
    int cur = rp[a];
    vector<int> q;
    int sum = 0;
    while(1) {
        q.push_back(cur);
        if(w[cur].size()) sum += w[cur][w[cur].size() - 1];
        if(cur == 0) break;
        cur = p[cur];
    }
    b += sum - stb.query_sum(a, a);
    if(b > sum) return 0;
    int lb = 0, rb = ti;
    int lsto[q.size()], rsto[q.size()];
    for(int i=0; i<q.size(); i++) {
        int x = q[i];
        lsto[i] = 0, rsto[i] = (w[x].size() ? w[x].size() - 1 : 0);
    }
    while(lb < rb) { // log n
        int mid = (lb+rb) >> 1;
        int tot = 0;
        int res[q.size()];
        for(int i=0; i<q.size(); i++) { // log n 
            int x = q[i];
            if(w[x].empty()) continue;
            int lb2 = lsto[i], rb2 = rsto[i];
            while(lb2 < rb2) { // log n
                int mid2 = (lb2 + rb2 + 1) >> 1;
                if(v[x][mid2].first <= mid) {
                    lb2 = mid2;
                }
                else {
                    rb2 = mid2 - 1;
                }
            }
            if(v[x][lb2].first <= mid) {
                tot += w[x][lb2];
            }
            res[i] = lb2;
        }
        if(tot >= b) {
            rb = mid;
            for(int i=0; i<q.size(); i++) {
                rsto[i] = res[i];
            }
        }
        else {
            lb = mid + 1;
            for(int i=0; i<q.size(); i++) {
                lsto[i] = res[i];
            }
        }
    }
    for(int x: q) {
        if(w[x].empty()) continue;
        int lb2 = 0, rb2 = w[x].size() - 1;
        while(lb2 < rb2) { // log n
            int mid2 = (lb2 + rb2 + 1) >> 1;
            if(v[x][mid2].first <= lb) {
                lb2 = mid2;
            }
            else {
                rb2 = mid2 - 1;
            }
        }
        if(v[x][lb2].first == lb) {
            return v[x][lb2].second.first;
        }
    }
}

void solve(int tc) {
    cin >> N >> M >> Q;
    if(M == 1) { // Subtask 4
        solve_1m();
        return;
    }
    stb.resize(N);
    stb.init(0);
    build(0, MAXN-1, 0);
    while(Q--) {
        int t;
        cin >> t;
        if(t == 1) {
            int l, r, c, k;
            cin >> l >> r >> c >> k;
            join(l, r, c, k);
        }
        else if(t == 2) {
            int l, r, k;
            cin >> l >> r >> k;
            leave(l, r, k);
        }
        else {
            int a, b;
            cin >> a >> b;
            cout << service(a, b) << "\n";
        }
    }
}
int32_t main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1; //cin >> t;
    for(int i=1; i<=t; i++) {
        solve(i);
    }
}

Compilation message

foodcourt.cpp: In member function 'void segtree_beats::pushup(long long int)':
foodcourt.cpp:86:19: warning: unused variable 'max1' [-Wunused-variable]
   86 |         long long max1, max2, maxc;
      |                   ^~~~
foodcourt.cpp:86:25: warning: unused variable 'max2' [-Wunused-variable]
   86 |         long long max1, max2, maxc;
      |                         ^~~~
foodcourt.cpp:86:31: warning: unused variable 'maxc' [-Wunused-variable]
   86 |         long long max1, max2, maxc;
      |                               ^~~~
foodcourt.cpp:87:19: warning: unused variable 'min1' [-Wunused-variable]
   87 |         long long min1, min2, minc;
      |                   ^~~~
foodcourt.cpp:87:25: warning: unused variable 'min2' [-Wunused-variable]
   87 |         long long min1, min2, minc;
      |                         ^~~~
foodcourt.cpp:87:31: warning: unused variable 'minc' [-Wunused-variable]
   87 |         long long min1, min2, minc;
      |                               ^~~~
foodcourt.cpp:88:19: warning: unused variable 'lazy' [-Wunused-variable]
   88 |         long long lazy, sum;
      |                   ^~~~
foodcourt.cpp:88:25: warning: unused variable 'sum' [-Wunused-variable]
   88 |         long long lazy, sum;
      |                         ^~~
foodcourt.cpp:89:19: warning: unused variable 'l' [-Wunused-variable]
   89 |         long long l, r;
      |                   ^
foodcourt.cpp:89:22: warning: unused variable 'r' [-Wunused-variable]
   89 |         long long l, r;
      |                      ^
foodcourt.cpp: In function 'long long int service(long long int, long long int)':
foodcourt.cpp:306:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  306 |     for(int i=0; i<q.size(); i++) {
      |                  ~^~~~~~~~~
foodcourt.cpp:314:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  314 |         for(int i=0; i<q.size(); i++) { // log n
      |                      ~^~~~~~~~~
foodcourt.cpp:334:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  334 |             for(int i=0; i<q.size(); i++) {
      |                          ~^~~~~~~~~
foodcourt.cpp:340:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  340 |             for(int i=0; i<q.size(); i++) {
      |                          ~^~~~~~~~~
foodcourt.cpp:294:17: warning: control reaches end of non-void function [-Wreturn-type]
  294 |     vector<int> q;
      |                 ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 53956 KB Output is correct
2 Correct 31 ms 54288 KB Output is correct
3 Correct 30 ms 54212 KB Output is correct
4 Correct 36 ms 54448 KB Output is correct
5 Correct 29 ms 53324 KB Output is correct
6 Correct 29 ms 53408 KB Output is correct
7 Correct 32 ms 54280 KB Output is correct
8 Correct 32 ms 54336 KB Output is correct
9 Correct 34 ms 54428 KB Output is correct
10 Correct 32 ms 54256 KB Output is correct
11 Correct 31 ms 54364 KB Output is correct
12 Correct 32 ms 54372 KB Output is correct
13 Correct 30 ms 54348 KB Output is correct
14 Correct 35 ms 54348 KB Output is correct
15 Correct 37 ms 54268 KB Output is correct
16 Correct 31 ms 54348 KB Output is correct
17 Correct 32 ms 54084 KB Output is correct
18 Correct 33 ms 54328 KB Output is correct
19 Correct 31 ms 53952 KB Output is correct
20 Correct 31 ms 54220 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 53956 KB Output is correct
2 Correct 31 ms 54288 KB Output is correct
3 Correct 30 ms 54212 KB Output is correct
4 Correct 36 ms 54448 KB Output is correct
5 Correct 29 ms 53324 KB Output is correct
6 Correct 29 ms 53408 KB Output is correct
7 Correct 32 ms 54280 KB Output is correct
8 Correct 32 ms 54336 KB Output is correct
9 Correct 34 ms 54428 KB Output is correct
10 Correct 32 ms 54256 KB Output is correct
11 Correct 31 ms 54364 KB Output is correct
12 Correct 32 ms 54372 KB Output is correct
13 Correct 30 ms 54348 KB Output is correct
14 Correct 35 ms 54348 KB Output is correct
15 Correct 37 ms 54268 KB Output is correct
16 Correct 31 ms 54348 KB Output is correct
17 Correct 32 ms 54084 KB Output is correct
18 Correct 33 ms 54328 KB Output is correct
19 Correct 31 ms 53952 KB Output is correct
20 Correct 31 ms 54220 KB Output is correct
21 Correct 32 ms 54196 KB Output is correct
22 Correct 34 ms 54288 KB Output is correct
23 Correct 36 ms 54164 KB Output is correct
24 Correct 32 ms 54476 KB Output is correct
25 Correct 28 ms 53440 KB Output is correct
26 Correct 29 ms 53456 KB Output is correct
27 Correct 34 ms 54340 KB Output is correct
28 Correct 32 ms 54308 KB Output is correct
29 Correct 37 ms 54316 KB Output is correct
30 Correct 41 ms 54352 KB Output is correct
31 Correct 37 ms 54324 KB Output is correct
32 Correct 32 ms 54348 KB Output is correct
33 Correct 30 ms 54248 KB Output is correct
34 Correct 32 ms 54420 KB Output is correct
35 Correct 31 ms 54200 KB Output is correct
36 Correct 31 ms 54328 KB Output is correct
37 Correct 34 ms 53964 KB Output is correct
38 Correct 30 ms 54200 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 77192 KB Output is correct
2 Correct 197 ms 78560 KB Output is correct
3 Correct 187 ms 78084 KB Output is correct
4 Correct 189 ms 78148 KB Output is correct
5 Correct 212 ms 80020 KB Output is correct
6 Correct 202 ms 80132 KB Output is correct
7 Correct 57 ms 54548 KB Output is correct
8 Correct 60 ms 55128 KB Output is correct
9 Correct 190 ms 77528 KB Output is correct
10 Correct 180 ms 77560 KB Output is correct
11 Correct 234 ms 77516 KB Output is correct
12 Correct 180 ms 77472 KB Output is correct
13 Correct 160 ms 72004 KB Output is correct
14 Correct 220 ms 79232 KB Output is correct
15 Correct 183 ms 74820 KB Output is correct
16 Correct 192 ms 81532 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 522 ms 118292 KB Output is correct
2 Correct 428 ms 108932 KB Output is correct
3 Correct 497 ms 126120 KB Output is correct
4 Correct 347 ms 125388 KB Output is correct
5 Correct 329 ms 106564 KB Output is correct
6 Correct 450 ms 126232 KB Output is correct
7 Correct 107 ms 47900 KB Output is correct
8 Correct 102 ms 47872 KB Output is correct
9 Correct 390 ms 126240 KB Output is correct
10 Correct 388 ms 126208 KB Output is correct
11 Correct 469 ms 126108 KB Output is correct
12 Correct 491 ms 126188 KB Output is correct
13 Correct 497 ms 126092 KB Output is correct
14 Correct 515 ms 126144 KB Output is correct
15 Correct 574 ms 126220 KB Output is correct
16 Correct 560 ms 126272 KB Output is correct
17 Correct 547 ms 126368 KB Output is correct
18 Correct 509 ms 125932 KB Output is correct
19 Correct 526 ms 126012 KB Output is correct
20 Correct 513 ms 126004 KB Output is correct
21 Correct 555 ms 126024 KB Output is correct
22 Correct 551 ms 125968 KB Output is correct
23 Correct 506 ms 126236 KB Output is correct
24 Correct 544 ms 126012 KB Output is correct
25 Correct 377 ms 108084 KB Output is correct
26 Correct 368 ms 126012 KB Output is correct
27 Correct 431 ms 126008 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 53956 KB Output is correct
2 Correct 31 ms 54288 KB Output is correct
3 Correct 30 ms 54212 KB Output is correct
4 Correct 36 ms 54448 KB Output is correct
5 Correct 29 ms 53324 KB Output is correct
6 Correct 29 ms 53408 KB Output is correct
7 Correct 32 ms 54280 KB Output is correct
8 Correct 32 ms 54336 KB Output is correct
9 Correct 34 ms 54428 KB Output is correct
10 Correct 32 ms 54256 KB Output is correct
11 Correct 31 ms 54364 KB Output is correct
12 Correct 32 ms 54372 KB Output is correct
13 Correct 30 ms 54348 KB Output is correct
14 Correct 35 ms 54348 KB Output is correct
15 Correct 37 ms 54268 KB Output is correct
16 Correct 31 ms 54348 KB Output is correct
17 Correct 32 ms 54084 KB Output is correct
18 Correct 33 ms 54328 KB Output is correct
19 Correct 31 ms 53952 KB Output is correct
20 Correct 31 ms 54220 KB Output is correct
21 Correct 191 ms 77192 KB Output is correct
22 Correct 197 ms 78560 KB Output is correct
23 Correct 187 ms 78084 KB Output is correct
24 Correct 189 ms 78148 KB Output is correct
25 Correct 212 ms 80020 KB Output is correct
26 Correct 202 ms 80132 KB Output is correct
27 Correct 57 ms 54548 KB Output is correct
28 Correct 60 ms 55128 KB Output is correct
29 Correct 190 ms 77528 KB Output is correct
30 Correct 180 ms 77560 KB Output is correct
31 Correct 234 ms 77516 KB Output is correct
32 Correct 180 ms 77472 KB Output is correct
33 Correct 160 ms 72004 KB Output is correct
34 Correct 220 ms 79232 KB Output is correct
35 Correct 183 ms 74820 KB Output is correct
36 Correct 192 ms 81532 KB Output is correct
37 Correct 261 ms 84240 KB Output is correct
38 Correct 228 ms 88820 KB Output is correct
39 Correct 52 ms 54536 KB Output is correct
40 Correct 64 ms 55172 KB Output is correct
41 Correct 273 ms 90084 KB Output is correct
42 Correct 300 ms 89812 KB Output is correct
43 Correct 297 ms 89744 KB Output is correct
44 Correct 275 ms 89700 KB Output is correct
45 Correct 320 ms 89856 KB Output is correct
46 Correct 296 ms 89944 KB Output is correct
47 Correct 130 ms 90532 KB Output is correct
48 Correct 168 ms 88092 KB Output is correct
49 Correct 224 ms 79184 KB Output is correct
50 Correct 258 ms 87612 KB Output is correct
51 Correct 311 ms 90520 KB Output is correct
52 Correct 338 ms 90360 KB Output is correct
53 Correct 158 ms 77196 KB Output is correct
54 Correct 195 ms 81456 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 91192 KB Output is correct
2 Correct 360 ms 90116 KB Output is correct
3 Correct 377 ms 94056 KB Output is correct
4 Correct 253 ms 87836 KB Output is correct
5 Correct 321 ms 91616 KB Output is correct
6 Correct 362 ms 95028 KB Output is correct
7 Correct 77 ms 54732 KB Output is correct
8 Correct 103 ms 55384 KB Output is correct
9 Correct 182 ms 97412 KB Output is correct
10 Correct 141 ms 88204 KB Output is correct
11 Correct 214 ms 94536 KB Output is correct
12 Correct 196 ms 94448 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 53956 KB Output is correct
2 Correct 31 ms 54288 KB Output is correct
3 Correct 30 ms 54212 KB Output is correct
4 Correct 36 ms 54448 KB Output is correct
5 Correct 29 ms 53324 KB Output is correct
6 Correct 29 ms 53408 KB Output is correct
7 Correct 32 ms 54280 KB Output is correct
8 Correct 32 ms 54336 KB Output is correct
9 Correct 34 ms 54428 KB Output is correct
10 Correct 32 ms 54256 KB Output is correct
11 Correct 31 ms 54364 KB Output is correct
12 Correct 32 ms 54372 KB Output is correct
13 Correct 30 ms 54348 KB Output is correct
14 Correct 35 ms 54348 KB Output is correct
15 Correct 37 ms 54268 KB Output is correct
16 Correct 31 ms 54348 KB Output is correct
17 Correct 32 ms 54084 KB Output is correct
18 Correct 33 ms 54328 KB Output is correct
19 Correct 31 ms 53952 KB Output is correct
20 Correct 31 ms 54220 KB Output is correct
21 Correct 32 ms 54196 KB Output is correct
22 Correct 34 ms 54288 KB Output is correct
23 Correct 36 ms 54164 KB Output is correct
24 Correct 32 ms 54476 KB Output is correct
25 Correct 28 ms 53440 KB Output is correct
26 Correct 29 ms 53456 KB Output is correct
27 Correct 34 ms 54340 KB Output is correct
28 Correct 32 ms 54308 KB Output is correct
29 Correct 37 ms 54316 KB Output is correct
30 Correct 41 ms 54352 KB Output is correct
31 Correct 37 ms 54324 KB Output is correct
32 Correct 32 ms 54348 KB Output is correct
33 Correct 30 ms 54248 KB Output is correct
34 Correct 32 ms 54420 KB Output is correct
35 Correct 31 ms 54200 KB Output is correct
36 Correct 31 ms 54328 KB Output is correct
37 Correct 34 ms 53964 KB Output is correct
38 Correct 30 ms 54200 KB Output is correct
39 Correct 191 ms 77192 KB Output is correct
40 Correct 197 ms 78560 KB Output is correct
41 Correct 187 ms 78084 KB Output is correct
42 Correct 189 ms 78148 KB Output is correct
43 Correct 212 ms 80020 KB Output is correct
44 Correct 202 ms 80132 KB Output is correct
45 Correct 57 ms 54548 KB Output is correct
46 Correct 60 ms 55128 KB Output is correct
47 Correct 190 ms 77528 KB Output is correct
48 Correct 180 ms 77560 KB Output is correct
49 Correct 234 ms 77516 KB Output is correct
50 Correct 180 ms 77472 KB Output is correct
51 Correct 160 ms 72004 KB Output is correct
52 Correct 220 ms 79232 KB Output is correct
53 Correct 183 ms 74820 KB Output is correct
54 Correct 192 ms 81532 KB Output is correct
55 Correct 261 ms 84240 KB Output is correct
56 Correct 228 ms 88820 KB Output is correct
57 Correct 52 ms 54536 KB Output is correct
58 Correct 64 ms 55172 KB Output is correct
59 Correct 273 ms 90084 KB Output is correct
60 Correct 300 ms 89812 KB Output is correct
61 Correct 297 ms 89744 KB Output is correct
62 Correct 275 ms 89700 KB Output is correct
63 Correct 320 ms 89856 KB Output is correct
64 Correct 296 ms 89944 KB Output is correct
65 Correct 130 ms 90532 KB Output is correct
66 Correct 168 ms 88092 KB Output is correct
67 Correct 224 ms 79184 KB Output is correct
68 Correct 258 ms 87612 KB Output is correct
69 Correct 311 ms 90520 KB Output is correct
70 Correct 338 ms 90360 KB Output is correct
71 Correct 158 ms 77196 KB Output is correct
72 Correct 195 ms 81456 KB Output is correct
73 Correct 332 ms 91192 KB Output is correct
74 Correct 360 ms 90116 KB Output is correct
75 Correct 377 ms 94056 KB Output is correct
76 Correct 253 ms 87836 KB Output is correct
77 Correct 321 ms 91616 KB Output is correct
78 Correct 362 ms 95028 KB Output is correct
79 Correct 77 ms 54732 KB Output is correct
80 Correct 103 ms 55384 KB Output is correct
81 Correct 182 ms 97412 KB Output is correct
82 Correct 141 ms 88204 KB Output is correct
83 Correct 214 ms 94536 KB Output is correct
84 Correct 196 ms 94448 KB Output is correct
85 Correct 271 ms 81844 KB Output is correct
86 Correct 283 ms 88128 KB Output is correct
87 Correct 266 ms 91256 KB Output is correct
88 Correct 316 ms 95032 KB Output is correct
89 Correct 188 ms 80096 KB Output is correct
90 Correct 280 ms 90028 KB Output is correct
91 Correct 259 ms 79736 KB Output is correct
92 Correct 250 ms 79408 KB Output is correct
93 Correct 319 ms 89948 KB Output is correct
94 Correct 323 ms 90084 KB Output is correct
95 Correct 348 ms 87876 KB Output is correct
96 Correct 337 ms 90356 KB Output is correct
97 Correct 340 ms 90504 KB Output is correct
98 Correct 287 ms 81552 KB Output is correct
99 Correct 183 ms 91092 KB Output is correct
100 Correct 182 ms 83344 KB Output is correct
101 Correct 196 ms 88476 KB Output is correct
102 Correct 249 ms 84536 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 53956 KB Output is correct
2 Correct 31 ms 54288 KB Output is correct
3 Correct 30 ms 54212 KB Output is correct
4 Correct 36 ms 54448 KB Output is correct
5 Correct 29 ms 53324 KB Output is correct
6 Correct 29 ms 53408 KB Output is correct
7 Correct 32 ms 54280 KB Output is correct
8 Correct 32 ms 54336 KB Output is correct
9 Correct 34 ms 54428 KB Output is correct
10 Correct 32 ms 54256 KB Output is correct
11 Correct 31 ms 54364 KB Output is correct
12 Correct 32 ms 54372 KB Output is correct
13 Correct 30 ms 54348 KB Output is correct
14 Correct 35 ms 54348 KB Output is correct
15 Correct 37 ms 54268 KB Output is correct
16 Correct 31 ms 54348 KB Output is correct
17 Correct 32 ms 54084 KB Output is correct
18 Correct 33 ms 54328 KB Output is correct
19 Correct 31 ms 53952 KB Output is correct
20 Correct 31 ms 54220 KB Output is correct
21 Correct 32 ms 54196 KB Output is correct
22 Correct 34 ms 54288 KB Output is correct
23 Correct 36 ms 54164 KB Output is correct
24 Correct 32 ms 54476 KB Output is correct
25 Correct 28 ms 53440 KB Output is correct
26 Correct 29 ms 53456 KB Output is correct
27 Correct 34 ms 54340 KB Output is correct
28 Correct 32 ms 54308 KB Output is correct
29 Correct 37 ms 54316 KB Output is correct
30 Correct 41 ms 54352 KB Output is correct
31 Correct 37 ms 54324 KB Output is correct
32 Correct 32 ms 54348 KB Output is correct
33 Correct 30 ms 54248 KB Output is correct
34 Correct 32 ms 54420 KB Output is correct
35 Correct 31 ms 54200 KB Output is correct
36 Correct 31 ms 54328 KB Output is correct
37 Correct 34 ms 53964 KB Output is correct
38 Correct 30 ms 54200 KB Output is correct
39 Correct 191 ms 77192 KB Output is correct
40 Correct 197 ms 78560 KB Output is correct
41 Correct 187 ms 78084 KB Output is correct
42 Correct 189 ms 78148 KB Output is correct
43 Correct 212 ms 80020 KB Output is correct
44 Correct 202 ms 80132 KB Output is correct
45 Correct 57 ms 54548 KB Output is correct
46 Correct 60 ms 55128 KB Output is correct
47 Correct 190 ms 77528 KB Output is correct
48 Correct 180 ms 77560 KB Output is correct
49 Correct 234 ms 77516 KB Output is correct
50 Correct 180 ms 77472 KB Output is correct
51 Correct 160 ms 72004 KB Output is correct
52 Correct 220 ms 79232 KB Output is correct
53 Correct 183 ms 74820 KB Output is correct
54 Correct 192 ms 81532 KB Output is correct
55 Correct 522 ms 118292 KB Output is correct
56 Correct 428 ms 108932 KB Output is correct
57 Correct 497 ms 126120 KB Output is correct
58 Correct 347 ms 125388 KB Output is correct
59 Correct 329 ms 106564 KB Output is correct
60 Correct 450 ms 126232 KB Output is correct
61 Correct 107 ms 47900 KB Output is correct
62 Correct 102 ms 47872 KB Output is correct
63 Correct 390 ms 126240 KB Output is correct
64 Correct 388 ms 126208 KB Output is correct
65 Correct 469 ms 126108 KB Output is correct
66 Correct 491 ms 126188 KB Output is correct
67 Correct 497 ms 126092 KB Output is correct
68 Correct 515 ms 126144 KB Output is correct
69 Correct 574 ms 126220 KB Output is correct
70 Correct 560 ms 126272 KB Output is correct
71 Correct 547 ms 126368 KB Output is correct
72 Correct 509 ms 125932 KB Output is correct
73 Correct 526 ms 126012 KB Output is correct
74 Correct 513 ms 126004 KB Output is correct
75 Correct 555 ms 126024 KB Output is correct
76 Correct 551 ms 125968 KB Output is correct
77 Correct 506 ms 126236 KB Output is correct
78 Correct 544 ms 126012 KB Output is correct
79 Correct 377 ms 108084 KB Output is correct
80 Correct 368 ms 126012 KB Output is correct
81 Correct 431 ms 126008 KB Output is correct
82 Correct 261 ms 84240 KB Output is correct
83 Correct 228 ms 88820 KB Output is correct
84 Correct 52 ms 54536 KB Output is correct
85 Correct 64 ms 55172 KB Output is correct
86 Correct 273 ms 90084 KB Output is correct
87 Correct 300 ms 89812 KB Output is correct
88 Correct 297 ms 89744 KB Output is correct
89 Correct 275 ms 89700 KB Output is correct
90 Correct 320 ms 89856 KB Output is correct
91 Correct 296 ms 89944 KB Output is correct
92 Correct 130 ms 90532 KB Output is correct
93 Correct 168 ms 88092 KB Output is correct
94 Correct 224 ms 79184 KB Output is correct
95 Correct 258 ms 87612 KB Output is correct
96 Correct 311 ms 90520 KB Output is correct
97 Correct 338 ms 90360 KB Output is correct
98 Correct 158 ms 77196 KB Output is correct
99 Correct 195 ms 81456 KB Output is correct
100 Correct 332 ms 91192 KB Output is correct
101 Correct 360 ms 90116 KB Output is correct
102 Correct 377 ms 94056 KB Output is correct
103 Correct 253 ms 87836 KB Output is correct
104 Correct 321 ms 91616 KB Output is correct
105 Correct 362 ms 95028 KB Output is correct
106 Correct 77 ms 54732 KB Output is correct
107 Correct 103 ms 55384 KB Output is correct
108 Correct 182 ms 97412 KB Output is correct
109 Correct 141 ms 88204 KB Output is correct
110 Correct 214 ms 94536 KB Output is correct
111 Correct 196 ms 94448 KB Output is correct
112 Correct 271 ms 81844 KB Output is correct
113 Correct 283 ms 88128 KB Output is correct
114 Correct 266 ms 91256 KB Output is correct
115 Correct 316 ms 95032 KB Output is correct
116 Correct 188 ms 80096 KB Output is correct
117 Correct 280 ms 90028 KB Output is correct
118 Correct 259 ms 79736 KB Output is correct
119 Correct 250 ms 79408 KB Output is correct
120 Correct 319 ms 89948 KB Output is correct
121 Correct 323 ms 90084 KB Output is correct
122 Correct 348 ms 87876 KB Output is correct
123 Correct 337 ms 90356 KB Output is correct
124 Correct 340 ms 90504 KB Output is correct
125 Correct 287 ms 81552 KB Output is correct
126 Correct 183 ms 91092 KB Output is correct
127 Correct 182 ms 83344 KB Output is correct
128 Correct 196 ms 88476 KB Output is correct
129 Correct 249 ms 84536 KB Output is correct
130 Execution timed out 1073 ms 172368 KB Time limit exceeded
131 Halted 0 ms 0 KB -