oj.uz

Submission #951504

# Submission time Handle Problem Language Result Execution time Memory
951504 2024-03-22T04:09:08 Z Nhoksocqt1 Painting Walls (APIO20_paint) C++17
27 / 100
 96 ms 90452 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 100005;
const int MAXM = 50004;

vector<ii> D[MAXN];
vector<int> B[MAXM], C[MAXN];
int dp[2 * MAXN], sum[MAXN], *f[MAXN];
int colNeed[MAXN], nArr, mArr, numCol;
bool dx[2003][MAXN], ok[MAXN];

int sub1(void) {
    for (int i = 1; i <= nArr; ++i) {
        if(sz(C[colNeed[i]]) == 0)
            return -1;

        dp[i] = C[colNeed[i]][0];
        sum[i] = sum[i - 1] + (i > 1 && (dp[i - 1] + 1) % mArr == dp[i]);
    }

    int res(0), maxi(1), lastok(-mArr);
    for (int i = 1; i <= nArr; ++i) {
        if(sum[i + mArr - 1] - sum[i] == mArr - 1 && (dp[i + mArr - 1] + 1) % mArr == dp[i])
            lastok = i;

        if(i == maxi) {
            if(lastok + mArr <= i)
                return -1;

            maxi = lastok + mArr;
            ++res;
        }
    }

    return res;
}

int sub3(void) {
    for (int j = 0; j < mArr; ++j) {
        for (int it = 0; it < sz(B[j]); ++it)
            dx[j][B[j][it]] = 1;
    }

    for (int i = 1; i + mArr - 1 <= nArr; ++i) {
        ok[i] = 0;
        for (int j = 0; j < mArr; ++j) {
            ok[i] = 1;
            for (int k = 0; k < mArr; ++k)
                ok[i] &= (dx[(j + k) % mArr][colNeed[i + k]]);

            if(ok[i])
                break;
        }
    }

    int res(0), maxi(1), lastok(-mArr);
    for (int i = 1; i <= nArr; ++i) {
        if(ok[i])
            lastok = i;

        if(i == maxi) {
            if(lastok + mArr <= i)
                return -1;

            maxi = lastok + mArr;
            ++res;
        }
    }

    return res;
}

int sub4(void) {
    for (int j = 0; j < mArr; ++j) {
        for (int it = 0; it < sz(B[j]); ++it)
            dx[j][B[j][it]] = 1;
    }

    for (int i = 0; i <= nArr + 1; ++i) {
        f[i] = new int[mArr + 2];
        for (int j = 0; j <= mArr + 1; ++j)
            f[i][j] = 0;
    }

    for (int i = nArr; i > 0; --i) {
        for (int j = mArr; j > 0; --j)
            f[i][j] = f[i + 1][j + 1] + (dx[j - 1][colNeed[i]]);
    }

    for (int i = 1; i + mArr - 1 <= nArr; ++i) {
        for (int j = 0; j < mArr; ++j) {
            ok[i] = (f[i][j + 1] + f[i + mArr - j][1] - f[i + mArr][j + 1] == mArr);
            if(ok[i])
                break;
        }
    }

    int res(0), maxi(1), lastok(-mArr);
    for (int i = 1; i <= nArr; ++i) {
        if(ok[i])
            lastok = i;

        if(i == maxi) {
            if(lastok + mArr <= i)
                return -1;

            maxi = lastok + mArr;
            ++res;
        }
    }

    return res;
}

queue<ii> qu[MAXN];
int magicFunc(void) {
    for (int i = 1; i <= nArr; ++i)
        sort(C[colNeed[i]].begin(), C[colNeed[i]].end());

    for (int i = 1; i + mArr - 1 <= nArr; ++i) {
        f[i] = new int[sz(C[colNeed[i]])];
        if(sz(C[colNeed[i]]) > 0) {
            int id(C[colNeed[i]][0]);
            qu[i - id + mArr].push(ii(i, 0));
        }

        for (int it = 0; it < sz(C[colNeed[i]]); ++it)
            f[i][it] = 0;
    }

    for (int i = 0; i <= nArr + mArr; ++i)
        dp[i] = 0;

    for (int i = nArr; i > 0; --i) {
        for (int j = 0; j < sz(C[colNeed[i]]); ++j) {
            int id(C[colNeed[i]][j]);
            ++dp[i - id + mArr];
        }

        if(i + mArr - 1 <= nArr) {
            for (int it = 0; it < sz(C[colNeed[i]]); ++it) {
                int id(C[colNeed[i]][it]);
                f[i][it] += dp[i - id + mArr];
            }
        }

        if(i > mArr) {
            for (int it = 0; it < sz(C[colNeed[i - mArr]]); ++it) {
                int id(C[colNeed[i - mArr]][it]);
                f[i - mArr][it] -= dp[i - id + mArr];
            }
        }

        while(sz(qu[i])) {
            int j(qu[i].front().fi), k(qu[i].front().se);
            qu[i].pop();

            f[j][k] += dp[i + mArr];
            if(++k < sz(C[colNeed[j]])) {
                int id(C[colNeed[j]][k]);
                qu[j - id + mArr].push(ii(j, k));
            }
        }
    }

    for (int i = 1; i + mArr - 1 <= nArr; ++i) {
        for (int it = 0; it < sz(C[colNeed[i]]); ++it)
            ok[i] |= (f[i][it] == mArr);
    }

    int res(0), maxi(1), lastok(-mArr);
    for (int i = 1; i <= nArr; ++i) {
        if(ok[i])
            lastok = i;

        if(i == maxi) {
            if(lastok + mArr <= i)
                return -1;

            maxi = lastok + mArr;
            ++res;
        }
    }

    return res;
}

int minimumInstructions(int _N, int _M, int _K, vector<int> _C, vector<int> _A, vector<vector<int>> _B) {
    nArr = _N, mArr = _M, numCol = _K;
    for (int i = 1; i <= nArr; ++i) {
        colNeed[i] = _C[i - 1];
        C[i].clear();
    }

    int maxf(0);
    for (int i = 0; i < mArr; ++i) {
        int szlike(_A[i]);

        B[i].clear();
        for (int j = 0; j < szlike; ++j) {
            B[i].push_back(_B[i][j]);
            C[_B[i][j]].push_back(i);
            maxf = max(maxf, sz(C[_B[i][j]]));
        }
    }

    /*if(maxf <= 1)
        return sub1();

    if(nArr <= 500)
        return sub3();

    if(nArr <= 20000 && mArr <= 2000)
        return sub4();*/

    return magicFunc();
}

#ifdef Nhoksocqt1

int main(void) {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    #define TASK "paint"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    vector<int> _A, _C;
    vector<vector<int>> _B;
    int _N, _M, _K;
    cin >> _N >> _M >> _K;

    _C.resize(_N);
    for (int i = 0; i < _N; ++i) {
        cin >> _C[i];
        //_C[i] = Random(0, _K - 1); cout << _C[i] << " \n"[i + 1 == _N];
    }

    vector<int> col; for (int i = 0; i < _K; ++i) col.push_back(i);
    _A.resize(_M), _B.resize(_M);
    for (int i = 0; i < _M; ++i) {
        cin >> _A[i];
        //_A[i] = Random(1, _K); cout << _A[i] << ' ';
        _B[i].resize(_A[i]);

        shuffle(col.begin(), col.end(), rng);
        for (int j = 0; j < _A[i]; ++j) {
            cin >> _B[i][j];
            //_B[i][j] = col[j]; cout << _B[i][j] << " \n"[j + 1 == _A[i]];
        }
    }

    int ans = minimumInstructions(_N, _M, _K, _C, _A, _B);
    cout << "ANSWER: " << ans << '\n';

    return 0;
}

#endif // Nhoksocqt1

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 76880 KB Output is correct
2 Correct 34 ms 77148 KB Output is correct
3 Correct 35 ms 76880 KB Output is correct
4 Correct 35 ms 77148 KB Output is correct
5 Correct 34 ms 76888 KB Output is correct
6 Correct 33 ms 77144 KB Output is correct
7 Correct 35 ms 77156 KB Output is correct
8 Correct 35 ms 77140 KB Output is correct
9 Correct 33 ms 77136 KB Output is correct
10 Correct 34 ms 77148 KB Output is correct
11 Correct 34 ms 77136 KB Output is correct
12 Correct 35 ms 76968 KB Output is correct
13 Correct 36 ms 77148 KB Output is correct
14 Correct 35 ms 77148 KB Output is correct
15 Correct 34 ms 77092 KB Output is correct
16 Correct 34 ms 77140 KB Output is correct
17 Correct 34 ms 77136 KB Output is correct
18 Correct 34 ms 77148 KB Output is correct
19 Correct 34 ms 77148 KB Output is correct
20 Correct 34 ms 77132 KB Output is correct
21 Correct 35 ms 76980 KB Output is correct
22 Correct 53 ms 81500 KB Output is correct
23 Correct 50 ms 81356 KB Output is correct
24 Correct 52 ms 81492 KB Output is correct
25 Correct 38 ms 77896 KB Output is correct
26 Correct 37 ms 77648 KB Output is correct
27 Correct 37 ms 77900 KB Output is correct
28 Correct 39 ms 77652 KB Output is correct
29 Correct 47 ms 78068 KB Output is correct
30 Correct 39 ms 77916 KB Output is correct
31 Correct 44 ms 78860 KB Output is correct
32 Correct 44 ms 78932 KB Output is correct
33 Correct 44 ms 78940 KB Output is correct
34 Correct 42 ms 79068 KB Output is correct
35 Correct 43 ms 78940 KB Output is correct
36 Correct 44 ms 79184 KB Output is correct
37 Correct 60 ms 82452 KB Output is correct
38 Correct 57 ms 82464 KB Output is correct
39 Correct 56 ms 82260 KB Output is correct
40 Correct 48 ms 80464 KB Output is correct
41 Correct 43 ms 79192 KB Output is correct
42 Correct 53 ms 80980 KB Output is correct
43 Correct 49 ms 79440 KB Output is correct
44 Correct 46 ms 79444 KB Output is correct
45 Correct 60 ms 80960 KB Output is correct
46 Correct 71 ms 89184 KB Output is correct
47 Correct 59 ms 84020 KB Output is correct
48 Correct 62 ms 86328 KB Output is correct
49 Correct 72 ms 86608 KB Output is correct
50 Correct 74 ms 86612 KB Output is correct
51 Correct 74 ms 84564 KB Output is correct
52 Correct 50 ms 80856 KB Output is correct
53 Correct 50 ms 80960 KB Output is correct
54 Correct 57 ms 80976 KB Output is correct
55 Correct 54 ms 80988 KB Output is correct
56 Correct 55 ms 80980 KB Output is correct
57 Correct 64 ms 81244 KB Output is correct
58 Correct 75 ms 90448 KB Output is correct
59 Correct 75 ms 90452 KB Output is correct
60 Correct 93 ms 90452 KB Output is correct
61 Correct 74 ms 90452 KB Output is correct
62 Correct 82 ms 90448 KB Output is correct
63 Correct 75 ms 90452 KB Output is correct
64 Correct 94 ms 89172 KB Output is correct
65 Correct 96 ms 89172 KB Output is correct
66 Correct 89 ms 89172 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 76880 KB Output is correct
2 Correct 34 ms 77148 KB Output is correct
3 Correct 35 ms 76880 KB Output is correct
4 Correct 35 ms 77148 KB Output is correct
5 Correct 34 ms 76888 KB Output is correct
6 Correct 33 ms 77144 KB Output is correct
7 Correct 35 ms 77156 KB Output is correct
8 Correct 35 ms 77140 KB Output is correct
9 Correct 33 ms 77136 KB Output is correct
10 Correct 34 ms 77148 KB Output is correct
11 Correct 34 ms 77136 KB Output is correct
12 Correct 35 ms 76968 KB Output is correct
13 Correct 36 ms 77148 KB Output is correct
14 Correct 35 ms 77148 KB Output is correct
15 Correct 34 ms 77092 KB Output is correct
16 Correct 34 ms 77140 KB Output is correct
17 Correct 34 ms 77136 KB Output is correct
18 Correct 34 ms 77148 KB Output is correct
19 Correct 34 ms 77148 KB Output is correct
20 Correct 34 ms 77132 KB Output is correct
21 Correct 35 ms 76980 KB Output is correct
22 Correct 39 ms 77148 KB Output is correct
23 Correct 35 ms 76884 KB Output is correct
24 Correct 35 ms 76892 KB Output is correct
25 Correct 34 ms 77384 KB Output is correct
26 Correct 34 ms 77148 KB Output is correct
27 Correct 33 ms 77148 KB Output is correct
28 Correct 34 ms 77148 KB Output is correct
29 Correct 43 ms 77404 KB Output is correct
30 Correct 34 ms 77148 KB Output is correct
31 Correct 35 ms 76912 KB Output is correct
32 Correct 35 ms 77148 KB Output is correct
33 Correct 35 ms 77140 KB Output is correct
34 Correct 35 ms 77144 KB Output is correct
35 Correct 34 ms 77140 KB Output is correct
36 Correct 36 ms 77148 KB Output is correct
37 Correct 37 ms 77096 KB Output is correct
38 Correct 35 ms 77144 KB Output is correct
39 Correct 34 ms 77144 KB Output is correct
40 Correct 33 ms 77144 KB Output is correct
41 Correct 38 ms 77148 KB Output is correct
42 Correct 36 ms 77156 KB Output is correct
43 Correct 38 ms 77140 KB Output is correct
44 Correct 34 ms 77136 KB Output is correct
45 Correct 35 ms 77144 KB Output is correct
46 Correct 35 ms 77140 KB Output is correct
47 Correct 34 ms 77008 KB Output is correct
48 Correct 34 ms 77148 KB Output is correct
49 Correct 36 ms 77148 KB Output is correct
50 Correct 34 ms 77136 KB Output is correct
51 Correct 34 ms 77176 KB Output is correct
52 Correct 35 ms 77144 KB Output is correct
53 Correct 34 ms 77140 KB Output is correct
54 Correct 34 ms 77148 KB Output is correct
55 Correct 35 ms 77148 KB Output is correct
56 Correct 36 ms 77144 KB Output is correct
57 Correct 38 ms 77148 KB Output is correct
58 Correct 37 ms 77212 KB Output is correct
59 Correct 39 ms 77148 KB Output is correct
60 Correct 35 ms 77220 KB Output is correct
61 Correct 38 ms 77148 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 77148 KB Output is correct
2 Correct 35 ms 76884 KB Output is correct
3 Correct 42 ms 76880 KB Output is correct
4 Correct 34 ms 77148 KB Output is correct
5 Correct 35 ms 76880 KB Output is correct
6 Correct 35 ms 77148 KB Output is correct
7 Correct 34 ms 76888 KB Output is correct
8 Correct 33 ms 77144 KB Output is correct
9 Correct 35 ms 77156 KB Output is correct
10 Correct 35 ms 77140 KB Output is correct
11 Correct 33 ms 77136 KB Output is correct
12 Correct 34 ms 77148 KB Output is correct
13 Correct 34 ms 77136 KB Output is correct
14 Correct 35 ms 76968 KB Output is correct
15 Correct 36 ms 77148 KB Output is correct
16 Correct 35 ms 77148 KB Output is correct
17 Correct 34 ms 77092 KB Output is correct
18 Correct 34 ms 77140 KB Output is correct
19 Correct 34 ms 77136 KB Output is correct
20 Correct 34 ms 77148 KB Output is correct
21 Correct 34 ms 77148 KB Output is correct
22 Correct 34 ms 77132 KB Output is correct
23 Correct 35 ms 76980 KB Output is correct
24 Correct 53 ms 81500 KB Output is correct
25 Correct 50 ms 81356 KB Output is correct
26 Correct 52 ms 81492 KB Output is correct
27 Correct 35 ms 76892 KB Output is correct
28 Correct 34 ms 77384 KB Output is correct
29 Correct 34 ms 77148 KB Output is correct
30 Correct 33 ms 77148 KB Output is correct
31 Correct 34 ms 77148 KB Output is correct
32 Correct 43 ms 77404 KB Output is correct
33 Correct 34 ms 77148 KB Output is correct
34 Correct 35 ms 76912 KB Output is correct
35 Correct 35 ms 77148 KB Output is correct
36 Correct 35 ms 77140 KB Output is correct
37 Correct 35 ms 77144 KB Output is correct
38 Correct 34 ms 77140 KB Output is correct
39 Correct 36 ms 77148 KB Output is correct
40 Correct 37 ms 77096 KB Output is correct
41 Correct 35 ms 77144 KB Output is correct
42 Correct 34 ms 77144 KB Output is correct
43 Correct 33 ms 77144 KB Output is correct
44 Correct 38 ms 77148 KB Output is correct
45 Correct 36 ms 77156 KB Output is correct
46 Correct 38 ms 77140 KB Output is correct
47 Correct 34 ms 77136 KB Output is correct
48 Correct 35 ms 77144 KB Output is correct
49 Correct 35 ms 77140 KB Output is correct
50 Correct 34 ms 77008 KB Output is correct
51 Correct 34 ms 77148 KB Output is correct
52 Correct 36 ms 77148 KB Output is correct
53 Correct 34 ms 77136 KB Output is correct
54 Correct 34 ms 77176 KB Output is correct
55 Correct 35 ms 77144 KB Output is correct
56 Correct 34 ms 77140 KB Output is correct
57 Correct 34 ms 77148 KB Output is correct
58 Correct 35 ms 77148 KB Output is correct
59 Correct 36 ms 77144 KB Output is correct
60 Correct 38 ms 77148 KB Output is correct
61 Correct 37 ms 77212 KB Output is correct
62 Correct 39 ms 77148 KB Output is correct
63 Correct 35 ms 77220 KB Output is correct
64 Correct 38 ms 77148 KB Output is correct
65 Correct 35 ms 77148 KB Output is correct
66 Correct 35 ms 77148 KB Output is correct
67 Correct 36 ms 77144 KB Output is correct
68 Correct 42 ms 77404 KB Output is correct
69 Correct 46 ms 77140 KB Output is correct
70 Correct 37 ms 77244 KB Output is correct
71 Correct 40 ms 77392 KB Output is correct
72 Incorrect 38 ms 77404 KB Output isn't correct
73 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 77148 KB Output is correct
2 Correct 35 ms 76884 KB Output is correct
3 Correct 42 ms 76880 KB Output is correct
4 Correct 34 ms 77148 KB Output is correct
5 Correct 35 ms 76880 KB Output is correct
6 Correct 35 ms 77148 KB Output is correct
7 Correct 34 ms 76888 KB Output is correct
8 Correct 33 ms 77144 KB Output is correct
9 Correct 35 ms 77156 KB Output is correct
10 Correct 35 ms 77140 KB Output is correct
11 Correct 33 ms 77136 KB Output is correct
12 Correct 34 ms 77148 KB Output is correct
13 Correct 34 ms 77136 KB Output is correct
14 Correct 35 ms 76968 KB Output is correct
15 Correct 36 ms 77148 KB Output is correct
16 Correct 35 ms 77148 KB Output is correct
17 Correct 34 ms 77092 KB Output is correct
18 Correct 34 ms 77140 KB Output is correct
19 Correct 34 ms 77136 KB Output is correct
20 Correct 34 ms 77148 KB Output is correct
21 Correct 34 ms 77148 KB Output is correct
22 Correct 34 ms 77132 KB Output is correct
23 Correct 35 ms 76980 KB Output is correct
24 Correct 53 ms 81500 KB Output is correct
25 Correct 50 ms 81356 KB Output is correct
26 Correct 52 ms 81492 KB Output is correct
27 Correct 38 ms 77896 KB Output is correct
28 Correct 37 ms 77648 KB Output is correct
29 Correct 37 ms 77900 KB Output is correct
30 Correct 39 ms 77652 KB Output is correct
31 Correct 47 ms 78068 KB Output is correct
32 Correct 39 ms 77916 KB Output is correct
33 Correct 44 ms 78860 KB Output is correct
34 Correct 44 ms 78932 KB Output is correct
35 Correct 44 ms 78940 KB Output is correct
36 Correct 42 ms 79068 KB Output is correct
37 Correct 43 ms 78940 KB Output is correct
38 Correct 44 ms 79184 KB Output is correct
39 Correct 60 ms 82452 KB Output is correct
40 Correct 57 ms 82464 KB Output is correct
41 Correct 56 ms 82260 KB Output is correct
42 Correct 35 ms 76892 KB Output is correct
43 Correct 34 ms 77384 KB Output is correct
44 Correct 34 ms 77148 KB Output is correct
45 Correct 33 ms 77148 KB Output is correct
46 Correct 34 ms 77148 KB Output is correct
47 Correct 43 ms 77404 KB Output is correct
48 Correct 34 ms 77148 KB Output is correct
49 Correct 35 ms 76912 KB Output is correct
50 Correct 35 ms 77148 KB Output is correct
51 Correct 35 ms 77140 KB Output is correct
52 Correct 35 ms 77144 KB Output is correct
53 Correct 34 ms 77140 KB Output is correct
54 Correct 36 ms 77148 KB Output is correct
55 Correct 37 ms 77096 KB Output is correct
56 Correct 35 ms 77144 KB Output is correct
57 Correct 34 ms 77144 KB Output is correct
58 Correct 33 ms 77144 KB Output is correct
59 Correct 38 ms 77148 KB Output is correct
60 Correct 36 ms 77156 KB Output is correct
61 Correct 38 ms 77140 KB Output is correct
62 Correct 34 ms 77136 KB Output is correct
63 Correct 35 ms 77144 KB Output is correct
64 Correct 35 ms 77140 KB Output is correct
65 Correct 34 ms 77008 KB Output is correct
66 Correct 34 ms 77148 KB Output is correct
67 Correct 36 ms 77148 KB Output is correct
68 Correct 34 ms 77136 KB Output is correct
69 Correct 34 ms 77176 KB Output is correct
70 Correct 35 ms 77144 KB Output is correct
71 Correct 34 ms 77140 KB Output is correct
72 Correct 34 ms 77148 KB Output is correct
73 Correct 35 ms 77148 KB Output is correct
74 Correct 36 ms 77144 KB Output is correct
75 Correct 38 ms 77148 KB Output is correct
76 Correct 37 ms 77212 KB Output is correct
77 Correct 39 ms 77148 KB Output is correct
78 Correct 35 ms 77220 KB Output is correct
79 Correct 38 ms 77148 KB Output is correct
80 Correct 35 ms 77148 KB Output is correct
81 Correct 35 ms 77148 KB Output is correct
82 Correct 36 ms 77144 KB Output is correct
83 Correct 42 ms 77404 KB Output is correct
84 Correct 46 ms 77140 KB Output is correct
85 Correct 37 ms 77244 KB Output is correct
86 Correct 40 ms 77392 KB Output is correct
87 Incorrect 38 ms 77404 KB Output isn't correct
88 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 77148 KB Output is correct
2 Correct 35 ms 76884 KB Output is correct
3 Correct 42 ms 76880 KB Output is correct
4 Correct 34 ms 77148 KB Output is correct
5 Correct 35 ms 76880 KB Output is correct
6 Correct 35 ms 77148 KB Output is correct
7 Correct 34 ms 76888 KB Output is correct
8 Correct 33 ms 77144 KB Output is correct
9 Correct 35 ms 77156 KB Output is correct
10 Correct 35 ms 77140 KB Output is correct
11 Correct 33 ms 77136 KB Output is correct
12 Correct 34 ms 77148 KB Output is correct
13 Correct 34 ms 77136 KB Output is correct
14 Correct 35 ms 76968 KB Output is correct
15 Correct 36 ms 77148 KB Output is correct
16 Correct 35 ms 77148 KB Output is correct
17 Correct 34 ms 77092 KB Output is correct
18 Correct 34 ms 77140 KB Output is correct
19 Correct 34 ms 77136 KB Output is correct
20 Correct 34 ms 77148 KB Output is correct
21 Correct 34 ms 77148 KB Output is correct
22 Correct 34 ms 77132 KB Output is correct
23 Correct 35 ms 76980 KB Output is correct
24 Correct 53 ms 81500 KB Output is correct
25 Correct 50 ms 81356 KB Output is correct
26 Correct 52 ms 81492 KB Output is correct
27 Correct 38 ms 77896 KB Output is correct
28 Correct 37 ms 77648 KB Output is correct
29 Correct 37 ms 77900 KB Output is correct
30 Correct 39 ms 77652 KB Output is correct
31 Correct 47 ms 78068 KB Output is correct
32 Correct 39 ms 77916 KB Output is correct
33 Correct 44 ms 78860 KB Output is correct
34 Correct 44 ms 78932 KB Output is correct
35 Correct 44 ms 78940 KB Output is correct
36 Correct 42 ms 79068 KB Output is correct
37 Correct 43 ms 78940 KB Output is correct
38 Correct 44 ms 79184 KB Output is correct
39 Correct 60 ms 82452 KB Output is correct
40 Correct 57 ms 82464 KB Output is correct
41 Correct 56 ms 82260 KB Output is correct
42 Correct 48 ms 80464 KB Output is correct
43 Correct 43 ms 79192 KB Output is correct
44 Correct 53 ms 80980 KB Output is correct
45 Correct 49 ms 79440 KB Output is correct
46 Correct 46 ms 79444 KB Output is correct
47 Correct 60 ms 80960 KB Output is correct
48 Correct 71 ms 89184 KB Output is correct
49 Correct 59 ms 84020 KB Output is correct
50 Correct 62 ms 86328 KB Output is correct
51 Correct 72 ms 86608 KB Output is correct
52 Correct 74 ms 86612 KB Output is correct
53 Correct 74 ms 84564 KB Output is correct
54 Correct 50 ms 80856 KB Output is correct
55 Correct 50 ms 80960 KB Output is correct
56 Correct 57 ms 80976 KB Output is correct
57 Correct 54 ms 80988 KB Output is correct
58 Correct 55 ms 80980 KB Output is correct
59 Correct 64 ms 81244 KB Output is correct
60 Correct 75 ms 90448 KB Output is correct
61 Correct 75 ms 90452 KB Output is correct
62 Correct 93 ms 90452 KB Output is correct
63 Correct 74 ms 90452 KB Output is correct
64 Correct 82 ms 90448 KB Output is correct
65 Correct 75 ms 90452 KB Output is correct
66 Correct 94 ms 89172 KB Output is correct
67 Correct 96 ms 89172 KB Output is correct
68 Correct 89 ms 89172 KB Output is correct
69 Correct 35 ms 76892 KB Output is correct
70 Correct 34 ms 77384 KB Output is correct
71 Correct 34 ms 77148 KB Output is correct
72 Correct 33 ms 77148 KB Output is correct
73 Correct 34 ms 77148 KB Output is correct
74 Correct 43 ms 77404 KB Output is correct
75 Correct 34 ms 77148 KB Output is correct
76 Correct 35 ms 76912 KB Output is correct
77 Correct 35 ms 77148 KB Output is correct
78 Correct 35 ms 77140 KB Output is correct
79 Correct 35 ms 77144 KB Output is correct
80 Correct 34 ms 77140 KB Output is correct
81 Correct 36 ms 77148 KB Output is correct
82 Correct 37 ms 77096 KB Output is correct
83 Correct 35 ms 77144 KB Output is correct
84 Correct 34 ms 77144 KB Output is correct
85 Correct 33 ms 77144 KB Output is correct
86 Correct 38 ms 77148 KB Output is correct
87 Correct 36 ms 77156 KB Output is correct
88 Correct 38 ms 77140 KB Output is correct
89 Correct 34 ms 77136 KB Output is correct
90 Correct 35 ms 77144 KB Output is correct
91 Correct 35 ms 77140 KB Output is correct
92 Correct 34 ms 77008 KB Output is correct
93 Correct 34 ms 77148 KB Output is correct
94 Correct 36 ms 77148 KB Output is correct
95 Correct 34 ms 77136 KB Output is correct
96 Correct 34 ms 77176 KB Output is correct
97 Correct 35 ms 77144 KB Output is correct
98 Correct 34 ms 77140 KB Output is correct
99 Correct 34 ms 77148 KB Output is correct
100 Correct 35 ms 77148 KB Output is correct
101 Correct 36 ms 77144 KB Output is correct
102 Correct 38 ms 77148 KB Output is correct
103 Correct 37 ms 77212 KB Output is correct
104 Correct 39 ms 77148 KB Output is correct
105 Correct 35 ms 77220 KB Output is correct
106 Correct 38 ms 77148 KB Output is correct
107 Correct 35 ms 77148 KB Output is correct
108 Correct 35 ms 77148 KB Output is correct
109 Correct 36 ms 77144 KB Output is correct
110 Correct 42 ms 77404 KB Output is correct
111 Correct 46 ms 77140 KB Output is correct
112 Correct 37 ms 77244 KB Output is correct
113 Correct 40 ms 77392 KB Output is correct
114 Incorrect 38 ms 77404 KB Output isn't correct
115 Halted 0 ms 0 KB -