oj.uz

Submission #999790

# Submission time Handle Problem Language Result Execution time Memory
999790 2024-06-16T06:56:04 Z underwaterkillerwhale Painting Walls (APIO20_paint) C++17
100 / 100
 392 ms 29784 KB 
#include "paint.h"

#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N  = 2e5 + 7;
const int Mod = 998244353;
const int szBL = 916;
const int INF = 1e9;
const int BASE = 137;
int n, m, K;

vector<int> A, C;
vector<vector<int>> B;

namespace sub1  {
    int idxA[N], f[N];

    bool check () {
        rep (i, 0, m - 1) iter (&col, B[i]) f[col]++;
        return *max_element (f, f + K) <= 1;
    }

    int solution() {
        rep (i, 0, K - 1) idxA[i] = -1;
        rep (i, 0, m - 1) {
            iter (&col, B[i]) idxA[col] = i;
        }
        int st = idxA[C[0]];
        if (st == -1) return -1;
        int res = 1;
        rep (i, 1, n - 1) {
            if (i % m == 0) ++res;
            (st += 1) %= m;
            int pos = lower_bound (ALL(B[st]), C[i]) - B[st].begin();
            if (pos == SZ(B[st]) || B[st][pos] != C[i]) return -1;
        }
        return res;
    }
}

namespace sub4 {
    const int N2 = 20000 + 2;
    const int M2 = 2000 + 2;
    int dp[N2][M2 * 2], f[N];
    bool ok[N2];

    vector<int> posC[N];

    struct Segment_Tree {
        int Range;
        int st[N << 2];

        void init (int n) {
            Range = n;
            rep (i, 1, n << 2) {
                st[i] = INF;
            }
        }

        void update (int id, int l, int r, int pos, int val) {
            if (l > pos || r < pos) return;
            if (l == r) {
                st[id] = val;
                return;
            }
            int mid = l + r >> 1;
            update (id << 1, l, mid, pos, val);
            update (id << 1 | 1, mid + 1, r, pos, val);
            st[id] = min(st[id << 1], st[id << 1 | 1]);
        }
        int get (int id, int l, int r, int u, int v) {
            if (l > v || r < u) return INF;
            if (l >= u && r <= v) return st[id];
            int mid = l + r >> 1;
            return min (get (id << 1, l, mid, u, v), get (id << 1 | 1, mid + 1, r, u, v));
        }

        void update (int pos, int val ) {
            update (1, 1, Range, pos, val);
        }
        int get (int u, int v) {
            return get (1, 1, Range, u, v);
        }
    }ST;

    int solution() {
        A.resize (2 * m);
        B.resize (2 * m);
        rep (i, m, 2 * m - 1) {
            A[i] = A[i - m];
            B[i] = B[i - m];
        }
        rep (i, 0, n - 1) posC[C[i]].push_back(i);
        rep (j, 0, 2 * m - 1) {
            iter (&col, B[j])
                iter (&pos, posC[col]) {
                dp[pos][j] = 1;
            }
        }
        reb (i, n - 1, 0) {
            reb (j, 2 * m - 1, 0) {
                if (dp[i][j] != 0) dp[i][j] = dp[i + 1][j + 1] + 1;
                if (dp[i][j] >= m) ok[i + 1] = 1;
            }
        }
        rep (i, 1, n) f[i] = INF;
        ST.init(n);
        f[m] = ok[1] ? 1 : INF;
        ST.update (m, f[m]);
        rep (i, 2, n - m + 1) {
            if (ok[i]) {
                f[i + m - 1] = ST.get (i - 1, i + m - 1) + 1;
                ST.update (i + m - 1, f[i + m - 1]);
            }
        }
        if (f[n] < INF) return f[n];
        else return -1;
    }
}

namespace sub5 {
    struct Segment_Tree2 {
        int Range;
        int st[N << 2];

        void init (int n) {
            Range = n;
            rep (i, 1, n << 2) {
                st[i] = INF;
            }
        }

        void update (int id, int l, int r, int pos, int val) {
            if (l > pos || r < pos) return;
            if (l == r) {
                st[id] = val;
                return;
            }
            int mid = l + r >> 1;
            update (id << 1, l, mid, pos, val);
            update (id << 1 | 1, mid + 1, r, pos, val);
            st[id] = min(st[id << 1], st[id << 1 | 1]);
        }
        int get (int id, int l, int r, int u, int v) {
            if (l > v || r < u) return INF;
            if (l >= u && r <= v) return st[id];
            int mid = l + r >> 1;
            return min (get (id << 1, l, mid, u, v), get (id << 1 | 1, mid + 1, r, u, v));
        }

        void update (int pos, int val ) {
            update (1, 1, Range, pos, val);
        }
        int get (int u, int v) {
            return get (1, 1, Range, u, v);
        }
    }ST;

    int tot[N];
    vector<int> F[N];
    bool ok[N];
    int f[N];

    int solution() {
        rep (i, 0, m - 1) {
            iter (&col, B[i]) F[col].push_back(i);
        }
        rep (i, 0, m - 1) {
            iter (&pos, F[C[i]]) {
                tot[(pos - i % m + m) % m] += 1;
            }
        }
        rep (i, 0, n - 1) if (tot[i] == m) ok[1] = 1;
        rep (i, 1, n - m) {
            iter (&pos, F[C[i - 1]]) {
                tot[(pos - (i - 1) % m + m) % m] -= 1;
            }
            iter (&pos, F[C[i + m - 1]]) {
                tot[(pos - (i - 1) % m + m) % m] += 1;
                if (tot[(pos - (i - 1) % m + m) % m] == m) ok[i + 1] = 1;
            }
        }
        rep (i, 1, n) f[i] = INF;
        ST.init(n);
        f[m] = ok[1] ? 1 : INF;
        ST.update (m, f[m]);
        rep (i, 2, n - m + 1) {
            if (ok[i]) {
                f[i + m - 1] = ST.get (i - 1, i + m - 1) + 1;
                ST.update (i + m - 1, f[i + m - 1]);
            }
        }
        if (f[n] < INF) return f[n];
        else return -1;
    }
}

int minimumInstructions (int _n, int _m, int _K, vector<int> _C, vector<int> _A, vector<vector<int>> _B) {
//void solution() {
    n = _n;
    m = _m;
    K = _K;
    C = _C;
    A = _A;
    B = _B;
//    cin >> n >> m >> K;
//    C.resize(n);
//    rep (i, 0, n - 1) {
//        cin >> C[i];
//
//    }
//    A.resize (m);
//    B.resize (m);
//    rep (i, 0, m - 1) {
//        cin >> A[i];
//        B[i].resize (A[i]);
//        rep (j, 0, A[i] - 1) {
//            cin >> B[i][j];
//        }
//    }
//    if (sub1 :: check())
//        return sub1 :: solution();
////        cout << sub1 :: solution() <<"\n";
//    else if (n <= 20000 && m <= 2000)
//        return sub4 :: solution();
////        cout << sub4 :: solution() <<"\n";
//    else
        return sub5 :: solution();
//        cout << sub5 :: solution() <<"\n";
}

//#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
//int main () {
//    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
////    file ("c");
//    int num_Test = 1;
////    cin >> num_Test;
//    while (num_Test--)
//        solution();
//}
/*
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4



5 4 4
1 0 1 2 2
2 0 1
1 1
1 2
1 3

*/

Compilation message

paint.cpp: In member function 'void sub4::Segment_Tree::update(int, int, int, int, int)':
paint.cpp:84:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   84 |             int mid = l + r >> 1;
      |                       ~~^~~
paint.cpp: In member function 'int sub4::Segment_Tree::get(int, int, int, int, int)':
paint.cpp:92:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |             int mid = l + r >> 1;
      |                       ~~^~~
paint.cpp: In member function 'void sub5::Segment_Tree2::update(int, int, int, int, int)':
paint.cpp:157:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  157 |             int mid = l + r >> 1;
      |                       ~~^~~
paint.cpp: In member function 'int sub5::Segment_Tree2::get(int, int, int, int, int)':
paint.cpp:165:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  165 |             int mid = l + r >> 1;
      |                       ~~^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14780 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 17 ms 19036 KB Output is correct
23 Correct 17 ms 18936 KB Output is correct
24 Correct 15 ms 19032 KB Output is correct
25 Correct 5 ms 14936 KB Output is correct
26 Correct 6 ms 14940 KB Output is correct
27 Correct 6 ms 14940 KB Output is correct
28 Correct 4 ms 14880 KB Output is correct
29 Correct 3 ms 15116 KB Output is correct
30 Correct 3 ms 14940 KB Output is correct
31 Correct 9 ms 16156 KB Output is correct
32 Correct 10 ms 15960 KB Output is correct
33 Correct 9 ms 15964 KB Output is correct
34 Correct 15 ms 16184 KB Output is correct
35 Correct 9 ms 15964 KB Output is correct
36 Correct 9 ms 16116 KB Output is correct
37 Correct 16 ms 19544 KB Output is correct
38 Correct 17 ms 19548 KB Output is correct
39 Correct 19 ms 19488 KB Output is correct
40 Correct 18 ms 16048 KB Output is correct
41 Correct 12 ms 15452 KB Output is correct
42 Correct 16 ms 15972 KB Output is correct
43 Correct 8 ms 15744 KB Output is correct
44 Correct 6 ms 15452 KB Output is correct
45 Correct 8 ms 15976 KB Output is correct
46 Correct 34 ms 27148 KB Output is correct
47 Correct 24 ms 21592 KB Output is correct
48 Correct 22 ms 25432 KB Output is correct
49 Correct 26 ms 25180 KB Output is correct
50 Correct 25 ms 24412 KB Output is correct
51 Correct 22 ms 21340 KB Output is correct
52 Correct 19 ms 15964 KB Output is correct
53 Correct 20 ms 15960 KB Output is correct
54 Correct 17 ms 15960 KB Output is correct
55 Correct 11 ms 16160 KB Output is correct
56 Correct 9 ms 15964 KB Output is correct
57 Correct 11 ms 16156 KB Output is correct
58 Correct 40 ms 27912 KB Output is correct
59 Correct 38 ms 27984 KB Output is correct
60 Correct 39 ms 27988 KB Output is correct
61 Correct 38 ms 27988 KB Output is correct
62 Correct 38 ms 27992 KB Output is correct
63 Correct 38 ms 27996 KB Output is correct
64 Correct 31 ms 26704 KB Output is correct
65 Correct 32 ms 26732 KB Output is correct
66 Correct 31 ms 26716 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14780 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14680 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14684 KB Output is correct
24 Correct 2 ms 14680 KB Output is correct
25 Correct 2 ms 14684 KB Output is correct
26 Correct 2 ms 14684 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 2 ms 14784 KB Output is correct
29 Correct 2 ms 14684 KB Output is correct
30 Correct 2 ms 14684 KB Output is correct
31 Correct 3 ms 14684 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 3 ms 14684 KB Output is correct
34 Correct 3 ms 14684 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 2 ms 14684 KB Output is correct
37 Correct 2 ms 14684 KB Output is correct
38 Correct 2 ms 14684 KB Output is correct
39 Correct 2 ms 14824 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 2 ms 14684 KB Output is correct
42 Correct 2 ms 14684 KB Output is correct
43 Correct 2 ms 14684 KB Output is correct
44 Correct 2 ms 14684 KB Output is correct
45 Correct 2 ms 14684 KB Output is correct
46 Correct 2 ms 14684 KB Output is correct
47 Correct 2 ms 14684 KB Output is correct
48 Correct 2 ms 14684 KB Output is correct
49 Correct 2 ms 14684 KB Output is correct
50 Correct 2 ms 14684 KB Output is correct
51 Correct 2 ms 14788 KB Output is correct
52 Correct 2 ms 14684 KB Output is correct
53 Correct 3 ms 14684 KB Output is correct
54 Correct 2 ms 14776 KB Output is correct
55 Correct 2 ms 14684 KB Output is correct
56 Correct 3 ms 14684 KB Output is correct
57 Correct 2 ms 14684 KB Output is correct
58 Correct 2 ms 14684 KB Output is correct
59 Correct 2 ms 14684 KB Output is correct
60 Correct 3 ms 14684 KB Output is correct
61 Correct 2 ms 14684 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14936 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14780 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14684 KB Output is correct
24 Correct 17 ms 19036 KB Output is correct
25 Correct 17 ms 18936 KB Output is correct
26 Correct 15 ms 19032 KB Output is correct
27 Correct 2 ms 14680 KB Output is correct
28 Correct 2 ms 14684 KB Output is correct
29 Correct 2 ms 14684 KB Output is correct
30 Correct 2 ms 14684 KB Output is correct
31 Correct 2 ms 14784 KB Output is correct
32 Correct 2 ms 14684 KB Output is correct
33 Correct 2 ms 14684 KB Output is correct
34 Correct 3 ms 14684 KB Output is correct
35 Correct 2 ms 14684 KB Output is correct
36 Correct 3 ms 14684 KB Output is correct
37 Correct 3 ms 14684 KB Output is correct
38 Correct 2 ms 14684 KB Output is correct
39 Correct 2 ms 14684 KB Output is correct
40 Correct 2 ms 14684 KB Output is correct
41 Correct 2 ms 14684 KB Output is correct
42 Correct 2 ms 14824 KB Output is correct
43 Correct 2 ms 14684 KB Output is correct
44 Correct 2 ms 14684 KB Output is correct
45 Correct 2 ms 14684 KB Output is correct
46 Correct 2 ms 14684 KB Output is correct
47 Correct 2 ms 14684 KB Output is correct
48 Correct 2 ms 14684 KB Output is correct
49 Correct 2 ms 14684 KB Output is correct
50 Correct 2 ms 14684 KB Output is correct
51 Correct 2 ms 14684 KB Output is correct
52 Correct 2 ms 14684 KB Output is correct
53 Correct 2 ms 14684 KB Output is correct
54 Correct 2 ms 14788 KB Output is correct
55 Correct 2 ms 14684 KB Output is correct
56 Correct 3 ms 14684 KB Output is correct
57 Correct 2 ms 14776 KB Output is correct
58 Correct 2 ms 14684 KB Output is correct
59 Correct 3 ms 14684 KB Output is correct
60 Correct 2 ms 14684 KB Output is correct
61 Correct 2 ms 14684 KB Output is correct
62 Correct 2 ms 14684 KB Output is correct
63 Correct 3 ms 14684 KB Output is correct
64 Correct 2 ms 14684 KB Output is correct
65 Correct 3 ms 14684 KB Output is correct
66 Correct 2 ms 14684 KB Output is correct
67 Correct 3 ms 14684 KB Output is correct
68 Correct 3 ms 14684 KB Output is correct
69 Correct 2 ms 14684 KB Output is correct
70 Correct 4 ms 14940 KB Output is correct
71 Correct 3 ms 14940 KB Output is correct
72 Correct 4 ms 14940 KB Output is correct
73 Correct 3 ms 14684 KB Output is correct
74 Correct 3 ms 14940 KB Output is correct
75 Correct 3 ms 14940 KB Output is correct
76 Correct 16 ms 17920 KB Output is correct
77 Correct 14 ms 18268 KB Output is correct
78 Correct 20 ms 18780 KB Output is correct
79 Correct 2 ms 14752 KB Output is correct
80 Correct 3 ms 14684 KB Output is correct
81 Correct 2 ms 14684 KB Output is correct
82 Correct 2 ms 14684 KB Output is correct
83 Correct 2 ms 14684 KB Output is correct
84 Correct 4 ms 15052 KB Output is correct
85 Correct 4 ms 14936 KB Output is correct
86 Correct 3 ms 15028 KB Output is correct
87 Correct 3 ms 15052 KB Output is correct
88 Correct 4 ms 14940 KB Output is correct
89 Correct 3 ms 15080 KB Output is correct
90 Correct 22 ms 18960 KB Output is correct
91 Correct 21 ms 19036 KB Output is correct
92 Correct 22 ms 19036 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14936 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14780 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14684 KB Output is correct
24 Correct 17 ms 19036 KB Output is correct
25 Correct 17 ms 18936 KB Output is correct
26 Correct 15 ms 19032 KB Output is correct
27 Correct 5 ms 14936 KB Output is correct
28 Correct 6 ms 14940 KB Output is correct
29 Correct 6 ms 14940 KB Output is correct
30 Correct 4 ms 14880 KB Output is correct
31 Correct 3 ms 15116 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 9 ms 16156 KB Output is correct
34 Correct 10 ms 15960 KB Output is correct
35 Correct 9 ms 15964 KB Output is correct
36 Correct 15 ms 16184 KB Output is correct
37 Correct 9 ms 15964 KB Output is correct
38 Correct 9 ms 16116 KB Output is correct
39 Correct 16 ms 19544 KB Output is correct
40 Correct 17 ms 19548 KB Output is correct
41 Correct 19 ms 19488 KB Output is correct
42 Correct 2 ms 14680 KB Output is correct
43 Correct 2 ms 14684 KB Output is correct
44 Correct 2 ms 14684 KB Output is correct
45 Correct 2 ms 14684 KB Output is correct
46 Correct 2 ms 14784 KB Output is correct
47 Correct 2 ms 14684 KB Output is correct
48 Correct 2 ms 14684 KB Output is correct
49 Correct 3 ms 14684 KB Output is correct
50 Correct 2 ms 14684 KB Output is correct
51 Correct 3 ms 14684 KB Output is correct
52 Correct 3 ms 14684 KB Output is correct
53 Correct 2 ms 14684 KB Output is correct
54 Correct 2 ms 14684 KB Output is correct
55 Correct 2 ms 14684 KB Output is correct
56 Correct 2 ms 14684 KB Output is correct
57 Correct 2 ms 14824 KB Output is correct
58 Correct 2 ms 14684 KB Output is correct
59 Correct 2 ms 14684 KB Output is correct
60 Correct 2 ms 14684 KB Output is correct
61 Correct 2 ms 14684 KB Output is correct
62 Correct 2 ms 14684 KB Output is correct
63 Correct 2 ms 14684 KB Output is correct
64 Correct 2 ms 14684 KB Output is correct
65 Correct 2 ms 14684 KB Output is correct
66 Correct 2 ms 14684 KB Output is correct
67 Correct 2 ms 14684 KB Output is correct
68 Correct 2 ms 14684 KB Output is correct
69 Correct 2 ms 14788 KB Output is correct
70 Correct 2 ms 14684 KB Output is correct
71 Correct 3 ms 14684 KB Output is correct
72 Correct 2 ms 14776 KB Output is correct
73 Correct 2 ms 14684 KB Output is correct
74 Correct 3 ms 14684 KB Output is correct
75 Correct 2 ms 14684 KB Output is correct
76 Correct 2 ms 14684 KB Output is correct
77 Correct 2 ms 14684 KB Output is correct
78 Correct 3 ms 14684 KB Output is correct
79 Correct 2 ms 14684 KB Output is correct
80 Correct 3 ms 14684 KB Output is correct
81 Correct 2 ms 14684 KB Output is correct
82 Correct 3 ms 14684 KB Output is correct
83 Correct 3 ms 14684 KB Output is correct
84 Correct 2 ms 14684 KB Output is correct
85 Correct 4 ms 14940 KB Output is correct
86 Correct 3 ms 14940 KB Output is correct
87 Correct 4 ms 14940 KB Output is correct
88 Correct 3 ms 14684 KB Output is correct
89 Correct 3 ms 14940 KB Output is correct
90 Correct 3 ms 14940 KB Output is correct
91 Correct 16 ms 17920 KB Output is correct
92 Correct 14 ms 18268 KB Output is correct
93 Correct 20 ms 18780 KB Output is correct
94 Correct 2 ms 14752 KB Output is correct
95 Correct 3 ms 14684 KB Output is correct
96 Correct 2 ms 14684 KB Output is correct
97 Correct 2 ms 14684 KB Output is correct
98 Correct 2 ms 14684 KB Output is correct
99 Correct 4 ms 15052 KB Output is correct
100 Correct 4 ms 14936 KB Output is correct
101 Correct 3 ms 15028 KB Output is correct
102 Correct 3 ms 15052 KB Output is correct
103 Correct 4 ms 14940 KB Output is correct
104 Correct 3 ms 15080 KB Output is correct
105 Correct 22 ms 18960 KB Output is correct
106 Correct 21 ms 19036 KB Output is correct
107 Correct 22 ms 19036 KB Output is correct
108 Correct 6 ms 14940 KB Output is correct
109 Correct 57 ms 14932 KB Output is correct
110 Correct 32 ms 15060 KB Output is correct
111 Correct 25 ms 14928 KB Output is correct
112 Correct 27 ms 14928 KB Output is correct
113 Correct 19 ms 14940 KB Output is correct
114 Correct 11 ms 16220 KB Output is correct
115 Correct 10 ms 16232 KB Output is correct
116 Correct 14 ms 16472 KB Output is correct
117 Correct 12 ms 16220 KB Output is correct
118 Correct 12 ms 16308 KB Output is correct
119 Correct 10 ms 15964 KB Output is correct
120 Correct 15 ms 17756 KB Output is correct
121 Correct 7 ms 15452 KB Output is correct
122 Correct 17 ms 17860 KB Output is correct
123 Correct 6 ms 15196 KB Output is correct
124 Correct 20 ms 18456 KB Output is correct
125 Correct 9 ms 15708 KB Output is correct
126 Correct 7 ms 15664 KB Output is correct
127 Correct 8 ms 15964 KB Output is correct
128 Correct 6 ms 15452 KB Output is correct
129 Correct 6 ms 15672 KB Output is correct
130 Correct 6 ms 14940 KB Output is correct
131 Correct 82 ms 15188 KB Output is correct
132 Correct 54 ms 15188 KB Output is correct
133 Correct 45 ms 15204 KB Output is correct
134 Correct 39 ms 15196 KB Output is correct
135 Correct 35 ms 15196 KB Output is correct
136 Correct 15 ms 16732 KB Output is correct
137 Correct 16 ms 16860 KB Output is correct
138 Correct 21 ms 16732 KB Output is correct
139 Correct 15 ms 16732 KB Output is correct
140 Correct 17 ms 16732 KB Output is correct
141 Correct 16 ms 16732 KB Output is correct
142 Correct 23 ms 19548 KB Output is correct
143 Correct 9 ms 15708 KB Output is correct
144 Correct 22 ms 19692 KB Output is correct
145 Correct 14 ms 15704 KB Output is correct
146 Correct 22 ms 19548 KB Output is correct
147 Correct 10 ms 15708 KB Output is correct
148 Correct 8 ms 16220 KB Output is correct
149 Correct 9 ms 16220 KB Output is correct
150 Correct 8 ms 15964 KB Output is correct
151 Correct 7 ms 15964 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14936 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14780 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14680 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 2 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 2 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 2 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14684 KB Output is correct
24 Correct 17 ms 19036 KB Output is correct
25 Correct 17 ms 18936 KB Output is correct
26 Correct 15 ms 19032 KB Output is correct
27 Correct 5 ms 14936 KB Output is correct
28 Correct 6 ms 14940 KB Output is correct
29 Correct 6 ms 14940 KB Output is correct
30 Correct 4 ms 14880 KB Output is correct
31 Correct 3 ms 15116 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 9 ms 16156 KB Output is correct
34 Correct 10 ms 15960 KB Output is correct
35 Correct 9 ms 15964 KB Output is correct
36 Correct 15 ms 16184 KB Output is correct
37 Correct 9 ms 15964 KB Output is correct
38 Correct 9 ms 16116 KB Output is correct
39 Correct 16 ms 19544 KB Output is correct
40 Correct 17 ms 19548 KB Output is correct
41 Correct 19 ms 19488 KB Output is correct
42 Correct 18 ms 16048 KB Output is correct
43 Correct 12 ms 15452 KB Output is correct
44 Correct 16 ms 15972 KB Output is correct
45 Correct 8 ms 15744 KB Output is correct
46 Correct 6 ms 15452 KB Output is correct
47 Correct 8 ms 15976 KB Output is correct
48 Correct 34 ms 27148 KB Output is correct
49 Correct 24 ms 21592 KB Output is correct
50 Correct 22 ms 25432 KB Output is correct
51 Correct 26 ms 25180 KB Output is correct
52 Correct 25 ms 24412 KB Output is correct
53 Correct 22 ms 21340 KB Output is correct
54 Correct 19 ms 15964 KB Output is correct
55 Correct 20 ms 15960 KB Output is correct
56 Correct 17 ms 15960 KB Output is correct
57 Correct 11 ms 16160 KB Output is correct
58 Correct 9 ms 15964 KB Output is correct
59 Correct 11 ms 16156 KB Output is correct
60 Correct 40 ms 27912 KB Output is correct
61 Correct 38 ms 27984 KB Output is correct
62 Correct 39 ms 27988 KB Output is correct
63 Correct 38 ms 27988 KB Output is correct
64 Correct 38 ms 27992 KB Output is correct
65 Correct 38 ms 27996 KB Output is correct
66 Correct 31 ms 26704 KB Output is correct
67 Correct 32 ms 26732 KB Output is correct
68 Correct 31 ms 26716 KB Output is correct
69 Correct 2 ms 14680 KB Output is correct
70 Correct 2 ms 14684 KB Output is correct
71 Correct 2 ms 14684 KB Output is correct
72 Correct 2 ms 14684 KB Output is correct
73 Correct 2 ms 14784 KB Output is correct
74 Correct 2 ms 14684 KB Output is correct
75 Correct 2 ms 14684 KB Output is correct
76 Correct 3 ms 14684 KB Output is correct
77 Correct 2 ms 14684 KB Output is correct
78 Correct 3 ms 14684 KB Output is correct
79 Correct 3 ms 14684 KB Output is correct
80 Correct 2 ms 14684 KB Output is correct
81 Correct 2 ms 14684 KB Output is correct
82 Correct 2 ms 14684 KB Output is correct
83 Correct 2 ms 14684 KB Output is correct
84 Correct 2 ms 14824 KB Output is correct
85 Correct 2 ms 14684 KB Output is correct
86 Correct 2 ms 14684 KB Output is correct
87 Correct 2 ms 14684 KB Output is correct
88 Correct 2 ms 14684 KB Output is correct
89 Correct 2 ms 14684 KB Output is correct
90 Correct 2 ms 14684 KB Output is correct
91 Correct 2 ms 14684 KB Output is correct
92 Correct 2 ms 14684 KB Output is correct
93 Correct 2 ms 14684 KB Output is correct
94 Correct 2 ms 14684 KB Output is correct
95 Correct 2 ms 14684 KB Output is correct
96 Correct 2 ms 14788 KB Output is correct
97 Correct 2 ms 14684 KB Output is correct
98 Correct 3 ms 14684 KB Output is correct
99 Correct 2 ms 14776 KB Output is correct
100 Correct 2 ms 14684 KB Output is correct
101 Correct 3 ms 14684 KB Output is correct
102 Correct 2 ms 14684 KB Output is correct
103 Correct 2 ms 14684 KB Output is correct
104 Correct 2 ms 14684 KB Output is correct
105 Correct 3 ms 14684 KB Output is correct
106 Correct 2 ms 14684 KB Output is correct
107 Correct 3 ms 14684 KB Output is correct
108 Correct 2 ms 14684 KB Output is correct
109 Correct 3 ms 14684 KB Output is correct
110 Correct 3 ms 14684 KB Output is correct
111 Correct 2 ms 14684 KB Output is correct
112 Correct 4 ms 14940 KB Output is correct
113 Correct 3 ms 14940 KB Output is correct
114 Correct 4 ms 14940 KB Output is correct
115 Correct 3 ms 14684 KB Output is correct
116 Correct 3 ms 14940 KB Output is correct
117 Correct 3 ms 14940 KB Output is correct
118 Correct 16 ms 17920 KB Output is correct
119 Correct 14 ms 18268 KB Output is correct
120 Correct 20 ms 18780 KB Output is correct
121 Correct 2 ms 14752 KB Output is correct
122 Correct 3 ms 14684 KB Output is correct
123 Correct 2 ms 14684 KB Output is correct
124 Correct 2 ms 14684 KB Output is correct
125 Correct 2 ms 14684 KB Output is correct
126 Correct 4 ms 15052 KB Output is correct
127 Correct 4 ms 14936 KB Output is correct
128 Correct 3 ms 15028 KB Output is correct
129 Correct 3 ms 15052 KB Output is correct
130 Correct 4 ms 14940 KB Output is correct
131 Correct 3 ms 15080 KB Output is correct
132 Correct 22 ms 18960 KB Output is correct
133 Correct 21 ms 19036 KB Output is correct
134 Correct 22 ms 19036 KB Output is correct
135 Correct 6 ms 14940 KB Output is correct
136 Correct 57 ms 14932 KB Output is correct
137 Correct 32 ms 15060 KB Output is correct
138 Correct 25 ms 14928 KB Output is correct
139 Correct 27 ms 14928 KB Output is correct
140 Correct 19 ms 14940 KB Output is correct
141 Correct 11 ms 16220 KB Output is correct
142 Correct 10 ms 16232 KB Output is correct
143 Correct 14 ms 16472 KB Output is correct
144 Correct 12 ms 16220 KB Output is correct
145 Correct 12 ms 16308 KB Output is correct
146 Correct 10 ms 15964 KB Output is correct
147 Correct 15 ms 17756 KB Output is correct
148 Correct 7 ms 15452 KB Output is correct
149 Correct 17 ms 17860 KB Output is correct
150 Correct 6 ms 15196 KB Output is correct
151 Correct 20 ms 18456 KB Output is correct
152 Correct 9 ms 15708 KB Output is correct
153 Correct 7 ms 15664 KB Output is correct
154 Correct 8 ms 15964 KB Output is correct
155 Correct 6 ms 15452 KB Output is correct
156 Correct 6 ms 15672 KB Output is correct
157 Correct 6 ms 14940 KB Output is correct
158 Correct 82 ms 15188 KB Output is correct
159 Correct 54 ms 15188 KB Output is correct
160 Correct 45 ms 15204 KB Output is correct
161 Correct 39 ms 15196 KB Output is correct
162 Correct 35 ms 15196 KB Output is correct
163 Correct 15 ms 16732 KB Output is correct
164 Correct 16 ms 16860 KB Output is correct
165 Correct 21 ms 16732 KB Output is correct
166 Correct 15 ms 16732 KB Output is correct
167 Correct 17 ms 16732 KB Output is correct
168 Correct 16 ms 16732 KB Output is correct
169 Correct 23 ms 19548 KB Output is correct
170 Correct 9 ms 15708 KB Output is correct
171 Correct 22 ms 19692 KB Output is correct
172 Correct 14 ms 15704 KB Output is correct
173 Correct 22 ms 19548 KB Output is correct
174 Correct 10 ms 15708 KB Output is correct
175 Correct 8 ms 16220 KB Output is correct
176 Correct 9 ms 16220 KB Output is correct
177 Correct 8 ms 15964 KB Output is correct
178 Correct 7 ms 15964 KB Output is correct
179 Correct 16 ms 15708 KB Output is correct
180 Correct 160 ms 15492 KB Output is correct
181 Correct 171 ms 15956 KB Output is correct
182 Correct 216 ms 16332 KB Output is correct
183 Correct 115 ms 15896 KB Output is correct
184 Correct 90 ms 15952 KB Output is correct
185 Correct 29 ms 19800 KB Output is correct
186 Correct 27 ms 21848 KB Output is correct
187 Correct 32 ms 20824 KB Output is correct
188 Correct 23 ms 20312 KB Output is correct
189 Correct 41 ms 20016 KB Output is correct
190 Correct 29 ms 21852 KB Output is correct
191 Correct 32 ms 21340 KB Output is correct
192 Correct 19 ms 19292 KB Output is correct
193 Correct 27 ms 18532 KB Output is correct
194 Correct 20 ms 16220 KB Output is correct
195 Correct 392 ms 16304 KB Output is correct
196 Correct 269 ms 16332 KB Output is correct
197 Correct 221 ms 16376 KB Output is correct
198 Correct 199 ms 16468 KB Output is correct
199 Correct 174 ms 16452 KB Output is correct
200 Correct 56 ms 29776 KB Output is correct
201 Correct 48 ms 29776 KB Output is correct
202 Correct 49 ms 29776 KB Output is correct
203 Correct 51 ms 29780 KB Output is correct
204 Correct 53 ms 29780 KB Output is correct
205 Correct 49 ms 29784 KB Output is correct
206 Correct 41 ms 28500 KB Output is correct
207 Correct 40 ms 27932 KB Output is correct
208 Correct 39 ms 28496 KB Output is correct
209 Correct 41 ms 27976 KB Output is correct
210 Correct 41 ms 28496 KB Output is correct
211 Correct 42 ms 28152 KB Output is correct
212 Correct 35 ms 29548 KB Output is correct
213 Correct 34 ms 25040 KB Output is correct
214 Correct 35 ms 24316 KB Output is correct
215 Correct 34 ms 24144 KB Output is correct