oj.uz

Submission #951502

# Submission time Handle Problem Language Result Execution time Memory
951502 2024-03-22T04:03:34 Z Nhoksocqt1 Painting Walls (APIO20_paint) C++17
27 / 100
 113 ms 91220 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;
        }

        cout << ok[i] << " \n"[i + mArr - 1 == nArr];
    }

    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 <= numCol; ++i)
        sort(C[i].begin(), C[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 33 ms 76920 KB Output is correct
2 Correct 33 ms 77148 KB Output is correct
3 Correct 33 ms 77148 KB Output is correct
4 Correct 33 ms 77024 KB Output is correct
5 Correct 40 ms 77148 KB Output is correct
6 Correct 33 ms 77148 KB Output is correct
7 Correct 34 ms 77160 KB Output is correct
8 Correct 39 ms 77164 KB Output is correct
9 Correct 35 ms 77144 KB Output is correct
10 Correct 34 ms 77140 KB Output is correct
11 Correct 33 ms 76956 KB Output is correct
12 Correct 45 ms 77140 KB Output is correct
13 Correct 34 ms 77140 KB Output is correct
14 Correct 35 ms 77148 KB Output is correct
15 Correct 34 ms 77116 KB Output is correct
16 Correct 36 ms 77192 KB Output is correct
17 Correct 34 ms 77400 KB Output is correct
18 Correct 37 ms 77188 KB Output is correct
19 Correct 35 ms 77012 KB Output is correct
20 Correct 38 ms 77036 KB Output is correct
21 Correct 41 ms 77004 KB Output is correct
22 Correct 55 ms 82152 KB Output is correct
23 Correct 54 ms 82008 KB Output is correct
24 Correct 52 ms 82000 KB Output is correct
25 Correct 37 ms 77908 KB Output is correct
26 Correct 37 ms 77904 KB Output is correct
27 Correct 37 ms 77912 KB Output is correct
28 Correct 37 ms 77916 KB Output is correct
29 Correct 45 ms 77996 KB Output is correct
30 Correct 37 ms 77912 KB Output is correct
31 Correct 42 ms 79236 KB Output is correct
32 Correct 44 ms 79192 KB Output is correct
33 Correct 43 ms 79196 KB Output is correct
34 Correct 48 ms 79308 KB Output is correct
35 Correct 47 ms 79188 KB Output is correct
36 Correct 48 ms 79444 KB Output is correct
37 Correct 55 ms 82776 KB Output is correct
38 Correct 56 ms 82744 KB Output is correct
39 Correct 61 ms 82768 KB Output is correct
40 Correct 46 ms 80720 KB Output is correct
41 Correct 42 ms 79360 KB Output is correct
42 Correct 50 ms 81084 KB Output is correct
43 Correct 57 ms 79696 KB Output is correct
44 Correct 44 ms 79448 KB Output is correct
45 Correct 55 ms 80980 KB Output is correct
46 Correct 69 ms 89876 KB Output is correct
47 Correct 56 ms 84560 KB Output is correct
48 Correct 59 ms 86864 KB Output is correct
49 Correct 72 ms 87300 KB Output is correct
50 Correct 74 ms 87328 KB Output is correct
51 Correct 71 ms 85340 KB Output is correct
52 Correct 47 ms 81232 KB Output is correct
53 Correct 47 ms 81236 KB Output is correct
54 Correct 50 ms 81060 KB Output is correct
55 Correct 54 ms 81168 KB Output is correct
56 Correct 52 ms 81236 KB Output is correct
57 Correct 53 ms 81232 KB Output is correct
58 Correct 73 ms 91208 KB Output is correct
59 Correct 75 ms 91144 KB Output is correct
60 Correct 74 ms 91220 KB Output is correct
61 Correct 74 ms 91100 KB Output is correct
62 Correct 91 ms 91148 KB Output is correct
63 Correct 73 ms 91108 KB Output is correct
64 Correct 113 ms 89936 KB Output is correct
65 Correct 89 ms 89948 KB Output is correct
66 Correct 91 ms 89840 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 76920 KB Output is correct
2 Correct 33 ms 77148 KB Output is correct
3 Correct 33 ms 77148 KB Output is correct
4 Correct 33 ms 77024 KB Output is correct
5 Correct 40 ms 77148 KB Output is correct
6 Correct 33 ms 77148 KB Output is correct
7 Correct 34 ms 77160 KB Output is correct
8 Correct 39 ms 77164 KB Output is correct
9 Correct 35 ms 77144 KB Output is correct
10 Correct 34 ms 77140 KB Output is correct
11 Correct 33 ms 76956 KB Output is correct
12 Correct 45 ms 77140 KB Output is correct
13 Correct 34 ms 77140 KB Output is correct
14 Correct 35 ms 77148 KB Output is correct
15 Correct 34 ms 77116 KB Output is correct
16 Correct 36 ms 77192 KB Output is correct
17 Correct 34 ms 77400 KB Output is correct
18 Correct 37 ms 77188 KB Output is correct
19 Correct 35 ms 77012 KB Output is correct
20 Correct 38 ms 77036 KB Output is correct
21 Correct 41 ms 77004 KB Output is correct
22 Correct 33 ms 76892 KB Output is correct
23 Correct 38 ms 77148 KB Output is correct
24 Correct 38 ms 77148 KB Output is correct
25 Correct 34 ms 76892 KB Output is correct
26 Correct 44 ms 77144 KB Output is correct
27 Correct 34 ms 77136 KB Output is correct
28 Correct 40 ms 77404 KB Output is correct
29 Correct 33 ms 77148 KB Output is correct
30 Correct 36 ms 77148 KB Output is correct
31 Correct 34 ms 77148 KB Output is correct
32 Correct 34 ms 77148 KB Output is correct
33 Correct 35 ms 77140 KB Output is correct
34 Correct 36 ms 77008 KB Output is correct
35 Correct 34 ms 77140 KB Output is correct
36 Correct 35 ms 77060 KB Output is correct
37 Correct 34 ms 77144 KB Output is correct
38 Correct 36 ms 77140 KB Output is correct
39 Correct 37 ms 77140 KB Output is correct
40 Correct 37 ms 77136 KB Output is correct
41 Correct 37 ms 77136 KB Output is correct
42 Correct 40 ms 77044 KB Output is correct
43 Correct 34 ms 77148 KB Output is correct
44 Correct 34 ms 77120 KB Output is correct
45 Correct 34 ms 77224 KB Output is correct
46 Correct 35 ms 77148 KB Output is correct
47 Correct 35 ms 77136 KB Output is correct
48 Correct 35 ms 77136 KB Output is correct
49 Correct 35 ms 76936 KB Output is correct
50 Correct 34 ms 77144 KB Output is correct
51 Correct 34 ms 77144 KB Output is correct
52 Correct 39 ms 77140 KB Output is correct
53 Correct 36 ms 77144 KB Output is correct
54 Correct 35 ms 77148 KB Output is correct
55 Correct 35 ms 77144 KB Output is correct
56 Correct 43 ms 77408 KB Output is correct
57 Correct 41 ms 77148 KB Output is correct
58 Correct 35 ms 77124 KB Output is correct
59 Correct 37 ms 77148 KB Output is correct
60 Correct 35 ms 77136 KB Output is correct
61 Correct 36 ms 77176 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 76892 KB Output is correct
2 Correct 38 ms 77148 KB Output is correct
3 Correct 33 ms 76920 KB Output is correct
4 Correct 33 ms 77148 KB Output is correct
5 Correct 33 ms 77148 KB Output is correct
6 Correct 33 ms 77024 KB Output is correct
7 Correct 40 ms 77148 KB Output is correct
8 Correct 33 ms 77148 KB Output is correct
9 Correct 34 ms 77160 KB Output is correct
10 Correct 39 ms 77164 KB Output is correct
11 Correct 35 ms 77144 KB Output is correct
12 Correct 34 ms 77140 KB Output is correct
13 Correct 33 ms 76956 KB Output is correct
14 Correct 45 ms 77140 KB Output is correct
15 Correct 34 ms 77140 KB Output is correct
16 Correct 35 ms 77148 KB Output is correct
17 Correct 34 ms 77116 KB Output is correct
18 Correct 36 ms 77192 KB Output is correct
19 Correct 34 ms 77400 KB Output is correct
20 Correct 37 ms 77188 KB Output is correct
21 Correct 35 ms 77012 KB Output is correct
22 Correct 38 ms 77036 KB Output is correct
23 Correct 41 ms 77004 KB Output is correct
24 Correct 55 ms 82152 KB Output is correct
25 Correct 54 ms 82008 KB Output is correct
26 Correct 52 ms 82000 KB Output is correct
27 Correct 38 ms 77148 KB Output is correct
28 Correct 34 ms 76892 KB Output is correct
29 Correct 44 ms 77144 KB Output is correct
30 Correct 34 ms 77136 KB Output is correct
31 Correct 40 ms 77404 KB Output is correct
32 Correct 33 ms 77148 KB Output is correct
33 Correct 36 ms 77148 KB Output is correct
34 Correct 34 ms 77148 KB Output is correct
35 Correct 34 ms 77148 KB Output is correct
36 Correct 35 ms 77140 KB Output is correct
37 Correct 36 ms 77008 KB Output is correct
38 Correct 34 ms 77140 KB Output is correct
39 Correct 35 ms 77060 KB Output is correct
40 Correct 34 ms 77144 KB Output is correct
41 Correct 36 ms 77140 KB Output is correct
42 Correct 37 ms 77140 KB Output is correct
43 Correct 37 ms 77136 KB Output is correct
44 Correct 37 ms 77136 KB Output is correct
45 Correct 40 ms 77044 KB Output is correct
46 Correct 34 ms 77148 KB Output is correct
47 Correct 34 ms 77120 KB Output is correct
48 Correct 34 ms 77224 KB Output is correct
49 Correct 35 ms 77148 KB Output is correct
50 Correct 35 ms 77136 KB Output is correct
51 Correct 35 ms 77136 KB Output is correct
52 Correct 35 ms 76936 KB Output is correct
53 Correct 34 ms 77144 KB Output is correct
54 Correct 34 ms 77144 KB Output is correct
55 Correct 39 ms 77140 KB Output is correct
56 Correct 36 ms 77144 KB Output is correct
57 Correct 35 ms 77148 KB Output is correct
58 Correct 35 ms 77144 KB Output is correct
59 Correct 43 ms 77408 KB Output is correct
60 Correct 41 ms 77148 KB Output is correct
61 Correct 35 ms 77124 KB Output is correct
62 Correct 37 ms 77148 KB Output is correct
63 Correct 35 ms 77136 KB Output is correct
64 Correct 36 ms 77176 KB Output is correct
65 Correct 34 ms 76956 KB Output is correct
66 Correct 34 ms 77148 KB Output is correct
67 Correct 36 ms 77148 KB Output is correct
68 Correct 36 ms 77136 KB Output is correct
69 Correct 44 ms 77128 KB Output is correct
70 Correct 37 ms 77400 KB Output is correct
71 Correct 40 ms 77400 KB Output is correct
72 Incorrect 40 ms 77252 KB Output isn't correct
73 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 76892 KB Output is correct
2 Correct 38 ms 77148 KB Output is correct
3 Correct 33 ms 76920 KB Output is correct
4 Correct 33 ms 77148 KB Output is correct
5 Correct 33 ms 77148 KB Output is correct
6 Correct 33 ms 77024 KB Output is correct
7 Correct 40 ms 77148 KB Output is correct
8 Correct 33 ms 77148 KB Output is correct
9 Correct 34 ms 77160 KB Output is correct
10 Correct 39 ms 77164 KB Output is correct
11 Correct 35 ms 77144 KB Output is correct
12 Correct 34 ms 77140 KB Output is correct
13 Correct 33 ms 76956 KB Output is correct
14 Correct 45 ms 77140 KB Output is correct
15 Correct 34 ms 77140 KB Output is correct
16 Correct 35 ms 77148 KB Output is correct
17 Correct 34 ms 77116 KB Output is correct
18 Correct 36 ms 77192 KB Output is correct
19 Correct 34 ms 77400 KB Output is correct
20 Correct 37 ms 77188 KB Output is correct
21 Correct 35 ms 77012 KB Output is correct
22 Correct 38 ms 77036 KB Output is correct
23 Correct 41 ms 77004 KB Output is correct
24 Correct 55 ms 82152 KB Output is correct
25 Correct 54 ms 82008 KB Output is correct
26 Correct 52 ms 82000 KB Output is correct
27 Correct 37 ms 77908 KB Output is correct
28 Correct 37 ms 77904 KB Output is correct
29 Correct 37 ms 77912 KB Output is correct
30 Correct 37 ms 77916 KB Output is correct
31 Correct 45 ms 77996 KB Output is correct
32 Correct 37 ms 77912 KB Output is correct
33 Correct 42 ms 79236 KB Output is correct
34 Correct 44 ms 79192 KB Output is correct
35 Correct 43 ms 79196 KB Output is correct
36 Correct 48 ms 79308 KB Output is correct
37 Correct 47 ms 79188 KB Output is correct
38 Correct 48 ms 79444 KB Output is correct
39 Correct 55 ms 82776 KB Output is correct
40 Correct 56 ms 82744 KB Output is correct
41 Correct 61 ms 82768 KB Output is correct
42 Correct 38 ms 77148 KB Output is correct
43 Correct 34 ms 76892 KB Output is correct
44 Correct 44 ms 77144 KB Output is correct
45 Correct 34 ms 77136 KB Output is correct
46 Correct 40 ms 77404 KB Output is correct
47 Correct 33 ms 77148 KB Output is correct
48 Correct 36 ms 77148 KB Output is correct
49 Correct 34 ms 77148 KB Output is correct
50 Correct 34 ms 77148 KB Output is correct
51 Correct 35 ms 77140 KB Output is correct
52 Correct 36 ms 77008 KB Output is correct
53 Correct 34 ms 77140 KB Output is correct
54 Correct 35 ms 77060 KB Output is correct
55 Correct 34 ms 77144 KB Output is correct
56 Correct 36 ms 77140 KB Output is correct
57 Correct 37 ms 77140 KB Output is correct
58 Correct 37 ms 77136 KB Output is correct
59 Correct 37 ms 77136 KB Output is correct
60 Correct 40 ms 77044 KB Output is correct
61 Correct 34 ms 77148 KB Output is correct
62 Correct 34 ms 77120 KB Output is correct
63 Correct 34 ms 77224 KB Output is correct
64 Correct 35 ms 77148 KB Output is correct
65 Correct 35 ms 77136 KB Output is correct
66 Correct 35 ms 77136 KB Output is correct
67 Correct 35 ms 76936 KB Output is correct
68 Correct 34 ms 77144 KB Output is correct
69 Correct 34 ms 77144 KB Output is correct
70 Correct 39 ms 77140 KB Output is correct
71 Correct 36 ms 77144 KB Output is correct
72 Correct 35 ms 77148 KB Output is correct
73 Correct 35 ms 77144 KB Output is correct
74 Correct 43 ms 77408 KB Output is correct
75 Correct 41 ms 77148 KB Output is correct
76 Correct 35 ms 77124 KB Output is correct
77 Correct 37 ms 77148 KB Output is correct
78 Correct 35 ms 77136 KB Output is correct
79 Correct 36 ms 77176 KB Output is correct
80 Correct 34 ms 76956 KB Output is correct
81 Correct 34 ms 77148 KB Output is correct
82 Correct 36 ms 77148 KB Output is correct
83 Correct 36 ms 77136 KB Output is correct
84 Correct 44 ms 77128 KB Output is correct
85 Correct 37 ms 77400 KB Output is correct
86 Correct 40 ms 77400 KB Output is correct
87 Incorrect 40 ms 77252 KB Output isn't correct
88 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 76892 KB Output is correct
2 Correct 38 ms 77148 KB Output is correct
3 Correct 33 ms 76920 KB Output is correct
4 Correct 33 ms 77148 KB Output is correct
5 Correct 33 ms 77148 KB Output is correct
6 Correct 33 ms 77024 KB Output is correct
7 Correct 40 ms 77148 KB Output is correct
8 Correct 33 ms 77148 KB Output is correct
9 Correct 34 ms 77160 KB Output is correct
10 Correct 39 ms 77164 KB Output is correct
11 Correct 35 ms 77144 KB Output is correct
12 Correct 34 ms 77140 KB Output is correct
13 Correct 33 ms 76956 KB Output is correct
14 Correct 45 ms 77140 KB Output is correct
15 Correct 34 ms 77140 KB Output is correct
16 Correct 35 ms 77148 KB Output is correct
17 Correct 34 ms 77116 KB Output is correct
18 Correct 36 ms 77192 KB Output is correct
19 Correct 34 ms 77400 KB Output is correct
20 Correct 37 ms 77188 KB Output is correct
21 Correct 35 ms 77012 KB Output is correct
22 Correct 38 ms 77036 KB Output is correct
23 Correct 41 ms 77004 KB Output is correct
24 Correct 55 ms 82152 KB Output is correct
25 Correct 54 ms 82008 KB Output is correct
26 Correct 52 ms 82000 KB Output is correct
27 Correct 37 ms 77908 KB Output is correct
28 Correct 37 ms 77904 KB Output is correct
29 Correct 37 ms 77912 KB Output is correct
30 Correct 37 ms 77916 KB Output is correct
31 Correct 45 ms 77996 KB Output is correct
32 Correct 37 ms 77912 KB Output is correct
33 Correct 42 ms 79236 KB Output is correct
34 Correct 44 ms 79192 KB Output is correct
35 Correct 43 ms 79196 KB Output is correct
36 Correct 48 ms 79308 KB Output is correct
37 Correct 47 ms 79188 KB Output is correct
38 Correct 48 ms 79444 KB Output is correct
39 Correct 55 ms 82776 KB Output is correct
40 Correct 56 ms 82744 KB Output is correct
41 Correct 61 ms 82768 KB Output is correct
42 Correct 46 ms 80720 KB Output is correct
43 Correct 42 ms 79360 KB Output is correct
44 Correct 50 ms 81084 KB Output is correct
45 Correct 57 ms 79696 KB Output is correct
46 Correct 44 ms 79448 KB Output is correct
47 Correct 55 ms 80980 KB Output is correct
48 Correct 69 ms 89876 KB Output is correct
49 Correct 56 ms 84560 KB Output is correct
50 Correct 59 ms 86864 KB Output is correct
51 Correct 72 ms 87300 KB Output is correct
52 Correct 74 ms 87328 KB Output is correct
53 Correct 71 ms 85340 KB Output is correct
54 Correct 47 ms 81232 KB Output is correct
55 Correct 47 ms 81236 KB Output is correct
56 Correct 50 ms 81060 KB Output is correct
57 Correct 54 ms 81168 KB Output is correct
58 Correct 52 ms 81236 KB Output is correct
59 Correct 53 ms 81232 KB Output is correct
60 Correct 73 ms 91208 KB Output is correct
61 Correct 75 ms 91144 KB Output is correct
62 Correct 74 ms 91220 KB Output is correct
63 Correct 74 ms 91100 KB Output is correct
64 Correct 91 ms 91148 KB Output is correct
65 Correct 73 ms 91108 KB Output is correct
66 Correct 113 ms 89936 KB Output is correct
67 Correct 89 ms 89948 KB Output is correct
68 Correct 91 ms 89840 KB Output is correct
69 Correct 38 ms 77148 KB Output is correct
70 Correct 34 ms 76892 KB Output is correct
71 Correct 44 ms 77144 KB Output is correct
72 Correct 34 ms 77136 KB Output is correct
73 Correct 40 ms 77404 KB Output is correct
74 Correct 33 ms 77148 KB Output is correct
75 Correct 36 ms 77148 KB Output is correct
76 Correct 34 ms 77148 KB Output is correct
77 Correct 34 ms 77148 KB Output is correct
78 Correct 35 ms 77140 KB Output is correct
79 Correct 36 ms 77008 KB Output is correct
80 Correct 34 ms 77140 KB Output is correct
81 Correct 35 ms 77060 KB Output is correct
82 Correct 34 ms 77144 KB Output is correct
83 Correct 36 ms 77140 KB Output is correct
84 Correct 37 ms 77140 KB Output is correct
85 Correct 37 ms 77136 KB Output is correct
86 Correct 37 ms 77136 KB Output is correct
87 Correct 40 ms 77044 KB Output is correct
88 Correct 34 ms 77148 KB Output is correct
89 Correct 34 ms 77120 KB Output is correct
90 Correct 34 ms 77224 KB Output is correct
91 Correct 35 ms 77148 KB Output is correct
92 Correct 35 ms 77136 KB Output is correct
93 Correct 35 ms 77136 KB Output is correct
94 Correct 35 ms 76936 KB Output is correct
95 Correct 34 ms 77144 KB Output is correct
96 Correct 34 ms 77144 KB Output is correct
97 Correct 39 ms 77140 KB Output is correct
98 Correct 36 ms 77144 KB Output is correct
99 Correct 35 ms 77148 KB Output is correct
100 Correct 35 ms 77144 KB Output is correct
101 Correct 43 ms 77408 KB Output is correct
102 Correct 41 ms 77148 KB Output is correct
103 Correct 35 ms 77124 KB Output is correct
104 Correct 37 ms 77148 KB Output is correct
105 Correct 35 ms 77136 KB Output is correct
106 Correct 36 ms 77176 KB Output is correct
107 Correct 34 ms 76956 KB Output is correct
108 Correct 34 ms 77148 KB Output is correct
109 Correct 36 ms 77148 KB Output is correct
110 Correct 36 ms 77136 KB Output is correct
111 Correct 44 ms 77128 KB Output is correct
112 Correct 37 ms 77400 KB Output is correct
113 Correct 40 ms 77400 KB Output is correct
114 Incorrect 40 ms 77252 KB Output isn't correct
115 Halted 0 ms 0 KB -