oj.uz

Submission #102254

# Submission time Handle Problem Language Result Execution time Memory
102254 2019-03-24T00:44:20 Z Benq Two Dishes (JOI19_dishes) C++14
100 / 100
 5314 ms 168164 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

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

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 1<<20;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); } 
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modInt {
    T val;
    T mod = 0;
    // static const T mod = MOD;

    void normalize() {
        if (mod == 0) return;
        val %= mod; if (val < 0) val += mod;
    }
    modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
    // modInt(T v = 0, T m = 0) : val(v) { normalize(); }

    explicit operator T() const { return val; }
    friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
    friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
    friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }

    friend void check(modInt& a, modInt& b) { // make sure all operations are valid
        // comment out if mod is static const
        if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
        T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
        if (a.mod != mod) { a.mod = mod; a.normalize(); }
        if (b.mod != mod) { b.mod = mod; b.normalize(); }
    }
    friend modInt operator+(modInt a, modInt b) {
        check(a,b); a.val += (T)b;
        if (a.val >= a.mod) a.val -= a.mod;
        return a;
    }
    friend modInt operator-(modInt a, modInt b) {
        check(a,b); a.val -= (T)b; 
        if (a.val < 0) a.val += a.mod; 
        return a;
    }
    friend modInt operator-(const modInt& a) { return modInt(0)-a; }

    friend modInt operator*(modInt a, modInt b) {
        check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
    }
    friend modInt exp(modInt a, ll p) {
        modInt ans(1,a.mod);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modInt inv(const modInt& a) {
        return {invGeneral(a.val,a.mod),a.mod};
        // return exp(b,b.mod-2) if prime
    }
    friend modInt operator/(modInt a, modInt b) { 
        check(a,b); return a*inv(b); 
    }
};

typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

template<class T, int SZ> struct LazySegTree {
    T mx[2*SZ], lazy[2*SZ]; // set SZ to a power of 2
    
    LazySegTree() {
        F0R(i,2*SZ) {
            mx[i] = -INF;
            lazy[i] = 0;
        }
    }
    
    void push(int ind, int L, int R) {
        mx[ind] += lazy[ind];
        if (L != R) lazy[2*ind] += lazy[ind], lazy[2*ind+1] += lazy[ind];
        lazy[ind] = 0;
    }
    
    void pull(int ind) {
        mx[ind] = max(mx[2*ind],mx[2*ind+1]);
    }
    
    void build() {
        FORd(i,1,SZ) pull(i);
    }

    T qmax(int lo, int hi, int ind = 1, int L = 0, int R = SZ-1) {
        push(ind,L,R);
        if (lo > R || L > hi) return -INF;
        if (lo <= L && R <= hi) return mx[ind];
        
        int M = (L+R)/2;
        return max(qmax(lo,hi,2*ind,L,M), qmax(lo,hi,2*ind+1,M+1,R));
    }
    
    void upd(int lo, int hi, ll inc, int ind = 1, int L = 0, int R = SZ-1) {
        push(ind,L,R);
        if (hi < L || R < lo) return;
        if (lo <= L && R <= hi) {
            lazy[ind] = inc;
            push(ind,L,R);
            return;
        }
        
        int M = (L+R)/2;
        upd(lo,hi,inc,2*ind,L,M); upd(lo,hi,inc,2*ind+1,M+1,R);
        pull(ind);
    }
    
    void tri(int pos, ll val, int ind = 1, int L = 0, int R = SZ-1) {
        push(ind,L,R);
        if (pos < L || R < pos) return;
        if (pos <= L && R <= pos) {
            ckmax(mx[ind],val);
            return;
        }
        
        int M = (L+R)/2;
        tri(pos,val,2*ind,L,M); tri(pos,val,2*ind+1,M+1,R);
        pull(ind);
    }
};

LazySegTree<ll,MX> L;
int N,M;
ll A[MX], S[MX], P[MX], B[MX], T[MX], Q[MX];
ll ans;
vector<array<ll,3>> points;

int main() {
    setIO(); re(N,M);
    FOR(i,1,N+1) {
        re(A[i],S[i],P[i]);
        A[i] += A[i-1];
    }
    FOR(i,1,M+1) {
        re(B[i],T[i],Q[i]);
        B[i] += B[i-1];
    }
    FOR(i,1,N+1) {
        int ind = ub(B,B+M+1,S[i]-A[i])-B-1;
        points.pb({i,ind,P[i]});
    }
    FOR(i,1,M+1) {
        int ind = ub(A,A+N+1,T[i]-B[i])-A-1;
        // ind,i
        ans += Q[i];
        points.pb({ind+1,i-1,-Q[i]});
    }
    L.tri(0,0);
    sort(all(points),[](const auto& a, const auto& b) {
        if (a[0] != b[0]) return a[0] < b[0];
        return a[1] > b[1];
    });
    // ps(points);
    for (int i = 0; i < sz(points); ) {
        auto t = points[i]; i ++;
        if (t[1] < 0 || t[0] > N) continue;
        while (i < sz(points) && mp(points[i][0],points[i][1]) == mp(points[i-1][0],points[i-1][1])) {
            t[2] += points[i][2];
            i ++;
        }
        if (t[0] == 0) { L.upd(0,0,t[2]); continue; }
        L.tri(t[1]+1,L.qmax(0,t[1]));
        L.upd(0,t[1],t[2]);
    }
    ps(ans+L.qmax(0,M));
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

dishes.cpp: In function 'void io::setIn(std::__cxx11::string)':
dishes.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
dishes.cpp: In function 'void io::setOut(std::__cxx11::string)':
dishes.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 56032 KB Output is correct
2 Correct 562 ms 55904 KB Output is correct
3 Correct 414 ms 56052 KB Output is correct
4 Correct 427 ms 55776 KB Output is correct
5 Correct 29 ms 33252 KB Output is correct
6 Correct 445 ms 55524 KB Output is correct
7 Correct 159 ms 44648 KB Output is correct
8 Correct 419 ms 44776 KB Output is correct
9 Correct 448 ms 55964 KB Output is correct
10 Correct 482 ms 55676 KB Output is correct
11 Correct 353 ms 55648 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 33144 KB Output is correct
2 Correct 27 ms 33272 KB Output is correct
3 Correct 32 ms 33280 KB Output is correct
4 Correct 34 ms 33200 KB Output is correct
5 Correct 27 ms 33144 KB Output is correct
6 Correct 32 ms 33172 KB Output is correct
7 Correct 29 ms 33144 KB Output is correct
8 Correct 30 ms 33280 KB Output is correct
9 Correct 28 ms 33280 KB Output is correct
10 Correct 27 ms 33280 KB Output is correct
11 Correct 28 ms 33272 KB Output is correct
12 Correct 27 ms 33192 KB Output is correct
13 Correct 29 ms 33280 KB Output is correct
14 Correct 30 ms 33212 KB Output is correct
15 Correct 31 ms 33272 KB Output is correct
16 Correct 32 ms 33144 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 33144 KB Output is correct
2 Correct 27 ms 33272 KB Output is correct
3 Correct 32 ms 33280 KB Output is correct
4 Correct 34 ms 33200 KB Output is correct
5 Correct 27 ms 33144 KB Output is correct
6 Correct 32 ms 33172 KB Output is correct
7 Correct 29 ms 33144 KB Output is correct
8 Correct 30 ms 33280 KB Output is correct
9 Correct 28 ms 33280 KB Output is correct
10 Correct 27 ms 33280 KB Output is correct
11 Correct 28 ms 33272 KB Output is correct
12 Correct 27 ms 33192 KB Output is correct
13 Correct 29 ms 33280 KB Output is correct
14 Correct 30 ms 33212 KB Output is correct
15 Correct 31 ms 33272 KB Output is correct
16 Correct 32 ms 33144 KB Output is correct
17 Correct 32 ms 33528 KB Output is correct
18 Correct 32 ms 33656 KB Output is correct
19 Correct 36 ms 33664 KB Output is correct
20 Correct 34 ms 33528 KB Output is correct
21 Correct 37 ms 33528 KB Output is correct
22 Correct 35 ms 33536 KB Output is correct
23 Correct 38 ms 33528 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 33144 KB Output is correct
2 Correct 27 ms 33272 KB Output is correct
3 Correct 32 ms 33280 KB Output is correct
4 Correct 34 ms 33200 KB Output is correct
5 Correct 27 ms 33144 KB Output is correct
6 Correct 32 ms 33172 KB Output is correct
7 Correct 29 ms 33144 KB Output is correct
8 Correct 30 ms 33280 KB Output is correct
9 Correct 28 ms 33280 KB Output is correct
10 Correct 27 ms 33280 KB Output is correct
11 Correct 28 ms 33272 KB Output is correct
12 Correct 27 ms 33192 KB Output is correct
13 Correct 29 ms 33280 KB Output is correct
14 Correct 30 ms 33212 KB Output is correct
15 Correct 31 ms 33272 KB Output is correct
16 Correct 32 ms 33144 KB Output is correct
17 Correct 32 ms 33528 KB Output is correct
18 Correct 32 ms 33656 KB Output is correct
19 Correct 36 ms 33664 KB Output is correct
20 Correct 34 ms 33528 KB Output is correct
21 Correct 37 ms 33528 KB Output is correct
22 Correct 35 ms 33536 KB Output is correct
23 Correct 38 ms 33528 KB Output is correct
24 Correct 575 ms 55904 KB Output is correct
25 Correct 452 ms 55908 KB Output is correct
26 Correct 598 ms 56032 KB Output is correct
27 Correct 491 ms 56104 KB Output is correct
28 Correct 577 ms 56008 KB Output is correct
29 Correct 392 ms 56000 KB Output is correct
30 Correct 853 ms 56104 KB Output is correct
31 Correct 233 ms 44776 KB Output is correct
32 Correct 389 ms 44768 KB Output is correct
33 Correct 586 ms 55900 KB Output is correct
34 Correct 680 ms 55864 KB Output is correct
35 Correct 759 ms 55552 KB Output is correct
36 Correct 800 ms 55640 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 33144 KB Output is correct
2 Correct 27 ms 33272 KB Output is correct
3 Correct 32 ms 33280 KB Output is correct
4 Correct 34 ms 33200 KB Output is correct
5 Correct 27 ms 33144 KB Output is correct
6 Correct 32 ms 33172 KB Output is correct
7 Correct 29 ms 33144 KB Output is correct
8 Correct 30 ms 33280 KB Output is correct
9 Correct 28 ms 33280 KB Output is correct
10 Correct 27 ms 33280 KB Output is correct
11 Correct 28 ms 33272 KB Output is correct
12 Correct 27 ms 33192 KB Output is correct
13 Correct 29 ms 33280 KB Output is correct
14 Correct 30 ms 33212 KB Output is correct
15 Correct 31 ms 33272 KB Output is correct
16 Correct 32 ms 33144 KB Output is correct
17 Correct 32 ms 33528 KB Output is correct
18 Correct 32 ms 33656 KB Output is correct
19 Correct 36 ms 33664 KB Output is correct
20 Correct 34 ms 33528 KB Output is correct
21 Correct 37 ms 33528 KB Output is correct
22 Correct 35 ms 33536 KB Output is correct
23 Correct 38 ms 33528 KB Output is correct
24 Correct 575 ms 55904 KB Output is correct
25 Correct 452 ms 55908 KB Output is correct
26 Correct 598 ms 56032 KB Output is correct
27 Correct 491 ms 56104 KB Output is correct
28 Correct 577 ms 56008 KB Output is correct
29 Correct 392 ms 56000 KB Output is correct
30 Correct 853 ms 56104 KB Output is correct
31 Correct 233 ms 44776 KB Output is correct
32 Correct 389 ms 44768 KB Output is correct
33 Correct 586 ms 55900 KB Output is correct
34 Correct 680 ms 55864 KB Output is correct
35 Correct 759 ms 55552 KB Output is correct
36 Correct 800 ms 55640 KB Output is correct
37 Correct 529 ms 55964 KB Output is correct
38 Correct 551 ms 55928 KB Output is correct
39 Correct 432 ms 55992 KB Output is correct
40 Correct 455 ms 55800 KB Output is correct
41 Correct 28 ms 33152 KB Output is correct
42 Correct 888 ms 55676 KB Output is correct
43 Correct 625 ms 55640 KB Output is correct
44 Correct 777 ms 55460 KB Output is correct
45 Correct 790 ms 55384 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 33144 KB Output is correct
2 Correct 27 ms 33272 KB Output is correct
3 Correct 32 ms 33280 KB Output is correct
4 Correct 34 ms 33200 KB Output is correct
5 Correct 27 ms 33144 KB Output is correct
6 Correct 32 ms 33172 KB Output is correct
7 Correct 29 ms 33144 KB Output is correct
8 Correct 30 ms 33280 KB Output is correct
9 Correct 28 ms 33280 KB Output is correct
10 Correct 27 ms 33280 KB Output is correct
11 Correct 28 ms 33272 KB Output is correct
12 Correct 27 ms 33192 KB Output is correct
13 Correct 29 ms 33280 KB Output is correct
14 Correct 30 ms 33212 KB Output is correct
15 Correct 31 ms 33272 KB Output is correct
16 Correct 32 ms 33144 KB Output is correct
17 Correct 32 ms 33528 KB Output is correct
18 Correct 32 ms 33656 KB Output is correct
19 Correct 36 ms 33664 KB Output is correct
20 Correct 34 ms 33528 KB Output is correct
21 Correct 37 ms 33528 KB Output is correct
22 Correct 35 ms 33536 KB Output is correct
23 Correct 38 ms 33528 KB Output is correct
24 Correct 575 ms 55904 KB Output is correct
25 Correct 452 ms 55908 KB Output is correct
26 Correct 598 ms 56032 KB Output is correct
27 Correct 491 ms 56104 KB Output is correct
28 Correct 577 ms 56008 KB Output is correct
29 Correct 392 ms 56000 KB Output is correct
30 Correct 853 ms 56104 KB Output is correct
31 Correct 233 ms 44776 KB Output is correct
32 Correct 389 ms 44768 KB Output is correct
33 Correct 586 ms 55900 KB Output is correct
34 Correct 680 ms 55864 KB Output is correct
35 Correct 759 ms 55552 KB Output is correct
36 Correct 800 ms 55640 KB Output is correct
37 Correct 529 ms 55964 KB Output is correct
38 Correct 551 ms 55928 KB Output is correct
39 Correct 432 ms 55992 KB Output is correct
40 Correct 455 ms 55800 KB Output is correct
41 Correct 28 ms 33152 KB Output is correct
42 Correct 888 ms 55676 KB Output is correct
43 Correct 625 ms 55640 KB Output is correct
44 Correct 777 ms 55460 KB Output is correct
45 Correct 790 ms 55384 KB Output is correct
46 Correct 2503 ms 129716 KB Output is correct
47 Correct 2722 ms 129764 KB Output is correct
48 Correct 2434 ms 129856 KB Output is correct
49 Correct 2216 ms 129836 KB Output is correct
50 Correct 5028 ms 129888 KB Output is correct
51 Correct 3299 ms 128344 KB Output is correct
52 Correct 3969 ms 127144 KB Output is correct
53 Correct 4459 ms 129740 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 56032 KB Output is correct
2 Correct 562 ms 55904 KB Output is correct
3 Correct 414 ms 56052 KB Output is correct
4 Correct 427 ms 55776 KB Output is correct
5 Correct 29 ms 33252 KB Output is correct
6 Correct 445 ms 55524 KB Output is correct
7 Correct 159 ms 44648 KB Output is correct
8 Correct 419 ms 44776 KB Output is correct
9 Correct 448 ms 55964 KB Output is correct
10 Correct 482 ms 55676 KB Output is correct
11 Correct 353 ms 55648 KB Output is correct
12 Correct 29 ms 33144 KB Output is correct
13 Correct 27 ms 33272 KB Output is correct
14 Correct 32 ms 33280 KB Output is correct
15 Correct 34 ms 33200 KB Output is correct
16 Correct 27 ms 33144 KB Output is correct
17 Correct 32 ms 33172 KB Output is correct
18 Correct 29 ms 33144 KB Output is correct
19 Correct 30 ms 33280 KB Output is correct
20 Correct 28 ms 33280 KB Output is correct
21 Correct 27 ms 33280 KB Output is correct
22 Correct 28 ms 33272 KB Output is correct
23 Correct 27 ms 33192 KB Output is correct
24 Correct 29 ms 33280 KB Output is correct
25 Correct 30 ms 33212 KB Output is correct
26 Correct 31 ms 33272 KB Output is correct
27 Correct 32 ms 33144 KB Output is correct
28 Correct 32 ms 33528 KB Output is correct
29 Correct 32 ms 33656 KB Output is correct
30 Correct 36 ms 33664 KB Output is correct
31 Correct 34 ms 33528 KB Output is correct
32 Correct 37 ms 33528 KB Output is correct
33 Correct 35 ms 33536 KB Output is correct
34 Correct 38 ms 33528 KB Output is correct
35 Correct 575 ms 55904 KB Output is correct
36 Correct 452 ms 55908 KB Output is correct
37 Correct 598 ms 56032 KB Output is correct
38 Correct 491 ms 56104 KB Output is correct
39 Correct 577 ms 56008 KB Output is correct
40 Correct 392 ms 56000 KB Output is correct
41 Correct 853 ms 56104 KB Output is correct
42 Correct 233 ms 44776 KB Output is correct
43 Correct 389 ms 44768 KB Output is correct
44 Correct 586 ms 55900 KB Output is correct
45 Correct 680 ms 55864 KB Output is correct
46 Correct 759 ms 55552 KB Output is correct
47 Correct 800 ms 55640 KB Output is correct
48 Correct 529 ms 55964 KB Output is correct
49 Correct 551 ms 55928 KB Output is correct
50 Correct 432 ms 55992 KB Output is correct
51 Correct 455 ms 55800 KB Output is correct
52 Correct 28 ms 33152 KB Output is correct
53 Correct 888 ms 55676 KB Output is correct
54 Correct 625 ms 55640 KB Output is correct
55 Correct 777 ms 55460 KB Output is correct
56 Correct 790 ms 55384 KB Output is correct
57 Correct 532 ms 55292 KB Output is correct
58 Correct 567 ms 62688 KB Output is correct
59 Correct 476 ms 62564 KB Output is correct
60 Correct 437 ms 62688 KB Output is correct
61 Correct 808 ms 62604 KB Output is correct
62 Correct 32 ms 33152 KB Output is correct
63 Correct 836 ms 62652 KB Output is correct
64 Correct 663 ms 62612 KB Output is correct
65 Correct 787 ms 62296 KB Output is correct
66 Correct 767 ms 62740 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 56032 KB Output is correct
2 Correct 562 ms 55904 KB Output is correct
3 Correct 414 ms 56052 KB Output is correct
4 Correct 427 ms 55776 KB Output is correct
5 Correct 29 ms 33252 KB Output is correct
6 Correct 445 ms 55524 KB Output is correct
7 Correct 159 ms 44648 KB Output is correct
8 Correct 419 ms 44776 KB Output is correct
9 Correct 448 ms 55964 KB Output is correct
10 Correct 482 ms 55676 KB Output is correct
11 Correct 353 ms 55648 KB Output is correct
12 Correct 29 ms 33144 KB Output is correct
13 Correct 27 ms 33272 KB Output is correct
14 Correct 32 ms 33280 KB Output is correct
15 Correct 34 ms 33200 KB Output is correct
16 Correct 27 ms 33144 KB Output is correct
17 Correct 32 ms 33172 KB Output is correct
18 Correct 29 ms 33144 KB Output is correct
19 Correct 30 ms 33280 KB Output is correct
20 Correct 28 ms 33280 KB Output is correct
21 Correct 27 ms 33280 KB Output is correct
22 Correct 28 ms 33272 KB Output is correct
23 Correct 27 ms 33192 KB Output is correct
24 Correct 29 ms 33280 KB Output is correct
25 Correct 30 ms 33212 KB Output is correct
26 Correct 31 ms 33272 KB Output is correct
27 Correct 32 ms 33144 KB Output is correct
28 Correct 32 ms 33528 KB Output is correct
29 Correct 32 ms 33656 KB Output is correct
30 Correct 36 ms 33664 KB Output is correct
31 Correct 34 ms 33528 KB Output is correct
32 Correct 37 ms 33528 KB Output is correct
33 Correct 35 ms 33536 KB Output is correct
34 Correct 38 ms 33528 KB Output is correct
35 Correct 575 ms 55904 KB Output is correct
36 Correct 452 ms 55908 KB Output is correct
37 Correct 598 ms 56032 KB Output is correct
38 Correct 491 ms 56104 KB Output is correct
39 Correct 577 ms 56008 KB Output is correct
40 Correct 392 ms 56000 KB Output is correct
41 Correct 853 ms 56104 KB Output is correct
42 Correct 233 ms 44776 KB Output is correct
43 Correct 389 ms 44768 KB Output is correct
44 Correct 586 ms 55900 KB Output is correct
45 Correct 680 ms 55864 KB Output is correct
46 Correct 759 ms 55552 KB Output is correct
47 Correct 800 ms 55640 KB Output is correct
48 Correct 529 ms 55964 KB Output is correct
49 Correct 551 ms 55928 KB Output is correct
50 Correct 432 ms 55992 KB Output is correct
51 Correct 455 ms 55800 KB Output is correct
52 Correct 28 ms 33152 KB Output is correct
53 Correct 888 ms 55676 KB Output is correct
54 Correct 625 ms 55640 KB Output is correct
55 Correct 777 ms 55460 KB Output is correct
56 Correct 790 ms 55384 KB Output is correct
57 Correct 2503 ms 129716 KB Output is correct
58 Correct 2722 ms 129764 KB Output is correct
59 Correct 2434 ms 129856 KB Output is correct
60 Correct 2216 ms 129836 KB Output is correct
61 Correct 5028 ms 129888 KB Output is correct
62 Correct 3299 ms 128344 KB Output is correct
63 Correct 3969 ms 127144 KB Output is correct
64 Correct 4459 ms 129740 KB Output is correct
65 Correct 532 ms 55292 KB Output is correct
66 Correct 567 ms 62688 KB Output is correct
67 Correct 476 ms 62564 KB Output is correct
68 Correct 437 ms 62688 KB Output is correct
69 Correct 808 ms 62604 KB Output is correct
70 Correct 32 ms 33152 KB Output is correct
71 Correct 836 ms 62652 KB Output is correct
72 Correct 663 ms 62612 KB Output is correct
73 Correct 787 ms 62296 KB Output is correct
74 Correct 767 ms 62740 KB Output is correct
75 Correct 2500 ms 130584 KB Output is correct
76 Correct 2734 ms 130380 KB Output is correct
77 Correct 2383 ms 130112 KB Output is correct
78 Correct 2353 ms 130240 KB Output is correct
79 Correct 5314 ms 130300 KB Output is correct
80 Correct 3180 ms 128812 KB Output is correct
81 Correct 4006 ms 127904 KB Output is correct
82 Correct 4582 ms 168164 KB Output is correct
83 Correct 4854 ms 130120 KB Output is correct