oj.uz

Submission #985432

# Submission time Handle Problem Language Result Execution time Memory
985432 2024-05-17T20:08:10 Z yoav_s Painting Walls (APIO20_paint) C++17
51 / 100
 171 ms 81908 KB 
#include <bits/stdc++.h>
 
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
 
using namespace std;
 
typedef int ll;
typedef pair<ll,ll> p;
typedef pair<ll, p> tri;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<p> vp;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<vv> vvv;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef vector<vvvp> vvvvp;
#define double long double
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
 
const ll mod = 1e9 + 7;
const ll INF = 1e18;
 
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define loop(a) for (ll i = 0; i < a; i++)
#define setmin(a, b) a = min(a, b)
#define setmax(a, b) a = max(a, b)
#define all(v) v.begin(), v.end()
 
#include "paint.h"
 
bool query(ll l, ll r, vv &st)
{
    ll n = st.size() / 2;
    l += n; r += n;
    v cur;
    bool first = false;
    while (l <= r)
    {
        if (l % 2 == 1)
        {
            if (first)
            {
                v next;
                set_intersection(all(cur),all(st[l]),back_inserter(next));
                cur = next;
            }
            else
            {
                cur = st[l];
                first = true;
            }
            l++;
        }
        if (r % 2 == 0)
        {
            if (first)
            {
                v next;
                set_intersection(all(cur),all(st[r]),back_inserter(next));
                cur = next;
            }
            else
            {
                cur = st[r];
                first = true;
            }
            r--;
        }
        l /= 2; r /= 2;
    }
    return cur.size() > 0;
}
 
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
    vv validStartIndices(N);
    vv appearingIn(K);
    for (ll i = 0; i < N; i++) appearingIn[C[i]].pb(i);
    for (ll i = 0; i < M; i++)
    {
        for (ll x : B[i])
        {
            for (ll y : appearingIn[x]) validStartIndices[y].pb((i - y + M * N) % M);
        }
    }
    vb poss(N - M + 1);
    v histogram(M, 0);
    ll countM = 0;
    for (ll i =0; i < M; i++)
    {
        for (ll x : validStartIndices[i])
        {
            histogram[x]++;
            if (histogram[x] == M) countM++;
        }
    }
    for (ll i = 0; i < N - M + 1; i++)
    {
        poss[i] = countM;
        for (ll x : validStartIndices[i])
        {
            histogram[x]--;
            if (histogram[x] == M - 1) countM--;
        }
        if (i < N - M)
        {
            for (ll x : validStartIndices[i + M])
            {
                histogram[x]++;
                if (histogram[x] == M) countM++;
            }
        }
    }
    ll res = 0;
    bool possible = true;
    ll last = 0;
    ll lastDone = 0;
    while (last < N)
    {
        ll lastFound = -1;
        for (;lastDone<=min(last, N - M);lastDone++)
        {
            if (poss[lastDone]) lastFound = lastDone;
        }
        if (lastFound == -1)
        {
            possible = false;
            break;
        }
        last = lastFound + M;
        res++;
    }
    if (!possible) return -1;
    return res;
}
/*
int main() {
  int N, M, K;
  assert(3 == scanf("%d %d %d", &N, &M, &K));
  
  vector<int> C(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &C[i]));
  }
 
  vector<int> A(M);
  vector<vector<int>> B(M);
  for (int i = 0; i < M; ++i) {
    assert(1 == scanf("%d", &A[i]));
    B[i].resize(A[i]);
    for (int j = 0; j < A[i]; ++j) {
      assert(1 == scanf("%d", &B[i][j]));
    }
  }
 
  int minimum_instructions = minimumInstructions(N, M, K, C, A, B);
  printf("%d\n", minimum_instructions);
  
  return 0;
}
/**/

Compilation message

paint.cpp:3: warning: ignoring '#pragma optimization_level ' [-Wunknown-pragmas]
    3 | #pragma optimization_level 3
      | 
paint.cpp:8: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    8 | #pragma GCC optimization ("unroll-loops")
      | 
paint.cpp:177:1: warning: "/*" within comment [-Wcomment]
  177 | /**/
      |  
paint.cpp:35:16: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   35 | const ll INF = 1e18;
      |                ^~~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2904 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 8 ms 4188 KB Output is correct
23 Correct 8 ms 4084 KB Output is correct
24 Correct 8 ms 4184 KB Output is correct
25 Correct 4 ms 1628 KB Output is correct
26 Correct 3 ms 1628 KB Output is correct
27 Correct 4 ms 1628 KB Output is correct
28 Correct 3 ms 1628 KB Output is correct
29 Correct 3 ms 1628 KB Output is correct
30 Correct 3 ms 1628 KB Output is correct
31 Correct 8 ms 5208 KB Output is correct
32 Correct 8 ms 4956 KB Output is correct
33 Correct 8 ms 5212 KB Output is correct
34 Correct 7 ms 5212 KB Output is correct
35 Correct 8 ms 5212 KB Output is correct
36 Correct 8 ms 5212 KB Output is correct
37 Correct 14 ms 6236 KB Output is correct
38 Correct 13 ms 6176 KB Output is correct
39 Correct 13 ms 6232 KB Output is correct
40 Correct 11 ms 6612 KB Output is correct
41 Correct 8 ms 4312 KB Output is correct
42 Correct 14 ms 7156 KB Output is correct
43 Correct 9 ms 4952 KB Output is correct
44 Correct 9 ms 4444 KB Output is correct
45 Correct 12 ms 7224 KB Output is correct
46 Runtime error 43 ms 34740 KB Execution killed with signal 11
47 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2904 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 436 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 1884 KB Output is correct
35 Correct 1 ms 1628 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2140 KB Output is correct
38 Correct 2 ms 2396 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 2 ms 2140 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 2648 KB Output is correct
43 Correct 1 ms 2644 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 352 KB Output is correct
50 Correct 1 ms 2740 KB Output is correct
51 Correct 2 ms 2656 KB Output is correct
52 Correct 2 ms 2652 KB Output is correct
53 Correct 2 ms 2664 KB Output is correct
54 Correct 2 ms 2652 KB Output is correct
55 Correct 1 ms 2748 KB Output is correct
56 Correct 1 ms 2652 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 2 ms 2652 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 2760 KB Output is correct
61 Correct 1 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2904 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 8 ms 4188 KB Output is correct
25 Correct 8 ms 4084 KB Output is correct
26 Correct 8 ms 4184 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 436 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 1884 KB Output is correct
38 Correct 1 ms 1628 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 1 ms 2140 KB Output is correct
41 Correct 2 ms 2396 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 2 ms 2140 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 2648 KB Output is correct
46 Correct 1 ms 2644 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 352 KB Output is correct
53 Correct 1 ms 2740 KB Output is correct
54 Correct 2 ms 2656 KB Output is correct
55 Correct 2 ms 2652 KB Output is correct
56 Correct 2 ms 2664 KB Output is correct
57 Correct 2 ms 2652 KB Output is correct
58 Correct 1 ms 2748 KB Output is correct
59 Correct 1 ms 2652 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 2 ms 2652 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 2760 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 1 ms 604 KB Output is correct
66 Correct 1 ms 604 KB Output is correct
67 Correct 1 ms 604 KB Output is correct
68 Correct 1 ms 696 KB Output is correct
69 Correct 1 ms 604 KB Output is correct
70 Correct 2 ms 2652 KB Output is correct
71 Correct 2 ms 2136 KB Output is correct
72 Correct 2 ms 1884 KB Output is correct
73 Correct 2 ms 2140 KB Output is correct
74 Correct 2 ms 2392 KB Output is correct
75 Correct 2 ms 2912 KB Output is correct
76 Correct 9 ms 3420 KB Output is correct
77 Correct 13 ms 4184 KB Output is correct
78 Correct 16 ms 4656 KB Output is correct
79 Correct 2 ms 860 KB Output is correct
80 Correct 2 ms 860 KB Output is correct
81 Correct 2 ms 860 KB Output is correct
82 Correct 2 ms 860 KB Output is correct
83 Correct 2 ms 860 KB Output is correct
84 Correct 4 ms 2960 KB Output is correct
85 Correct 4 ms 2908 KB Output is correct
86 Correct 2 ms 3000 KB Output is correct
87 Correct 2 ms 3164 KB Output is correct
88 Correct 3 ms 3160 KB Output is correct
89 Correct 3 ms 3160 KB Output is correct
90 Correct 12 ms 4956 KB Output is correct
91 Correct 12 ms 5120 KB Output is correct
92 Correct 12 ms 4956 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2904 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 8 ms 4188 KB Output is correct
25 Correct 8 ms 4084 KB Output is correct
26 Correct 8 ms 4184 KB Output is correct
27 Correct 4 ms 1628 KB Output is correct
28 Correct 3 ms 1628 KB Output is correct
29 Correct 4 ms 1628 KB Output is correct
30 Correct 3 ms 1628 KB Output is correct
31 Correct 3 ms 1628 KB Output is correct
32 Correct 3 ms 1628 KB Output is correct
33 Correct 8 ms 5208 KB Output is correct
34 Correct 8 ms 4956 KB Output is correct
35 Correct 8 ms 5212 KB Output is correct
36 Correct 7 ms 5212 KB Output is correct
37 Correct 8 ms 5212 KB Output is correct
38 Correct 8 ms 5212 KB Output is correct
39 Correct 14 ms 6236 KB Output is correct
40 Correct 13 ms 6176 KB Output is correct
41 Correct 13 ms 6232 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 436 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 1884 KB Output is correct
53 Correct 1 ms 1628 KB Output is correct
54 Correct 1 ms 2652 KB Output is correct
55 Correct 1 ms 2140 KB Output is correct
56 Correct 2 ms 2396 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 2 ms 2140 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 2648 KB Output is correct
61 Correct 1 ms 2644 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 352 KB Output is correct
68 Correct 1 ms 2740 KB Output is correct
69 Correct 2 ms 2656 KB Output is correct
70 Correct 2 ms 2652 KB Output is correct
71 Correct 2 ms 2664 KB Output is correct
72 Correct 2 ms 2652 KB Output is correct
73 Correct 1 ms 2748 KB Output is correct
74 Correct 1 ms 2652 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 2 ms 2652 KB Output is correct
77 Correct 1 ms 344 KB Output is correct
78 Correct 1 ms 2760 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 1 ms 604 KB Output is correct
81 Correct 1 ms 604 KB Output is correct
82 Correct 1 ms 604 KB Output is correct
83 Correct 1 ms 696 KB Output is correct
84 Correct 1 ms 604 KB Output is correct
85 Correct 2 ms 2652 KB Output is correct
86 Correct 2 ms 2136 KB Output is correct
87 Correct 2 ms 1884 KB Output is correct
88 Correct 2 ms 2140 KB Output is correct
89 Correct 2 ms 2392 KB Output is correct
90 Correct 2 ms 2912 KB Output is correct
91 Correct 9 ms 3420 KB Output is correct
92 Correct 13 ms 4184 KB Output is correct
93 Correct 16 ms 4656 KB Output is correct
94 Correct 2 ms 860 KB Output is correct
95 Correct 2 ms 860 KB Output is correct
96 Correct 2 ms 860 KB Output is correct
97 Correct 2 ms 860 KB Output is correct
98 Correct 2 ms 860 KB Output is correct
99 Correct 4 ms 2960 KB Output is correct
100 Correct 4 ms 2908 KB Output is correct
101 Correct 2 ms 3000 KB Output is correct
102 Correct 2 ms 3164 KB Output is correct
103 Correct 3 ms 3160 KB Output is correct
104 Correct 3 ms 3160 KB Output is correct
105 Correct 12 ms 4956 KB Output is correct
106 Correct 12 ms 5120 KB Output is correct
107 Correct 12 ms 4956 KB Output is correct
108 Correct 3 ms 1628 KB Output is correct
109 Correct 120 ms 59368 KB Output is correct
110 Correct 66 ms 25684 KB Output is correct
111 Correct 49 ms 24256 KB Output is correct
112 Correct 62 ms 32336 KB Output is correct
113 Correct 39 ms 16212 KB Output is correct
114 Correct 10 ms 4944 KB Output is correct
115 Correct 10 ms 4444 KB Output is correct
116 Correct 13 ms 5468 KB Output is correct
117 Correct 10 ms 4188 KB Output is correct
118 Correct 13 ms 4956 KB Output is correct
119 Correct 9 ms 4584 KB Output is correct
120 Correct 11 ms 4188 KB Output is correct
121 Correct 5 ms 1884 KB Output is correct
122 Correct 13 ms 4416 KB Output is correct
123 Correct 5 ms 1880 KB Output is correct
124 Correct 16 ms 5468 KB Output is correct
125 Correct 7 ms 2648 KB Output is correct
126 Correct 6 ms 3420 KB Output is correct
127 Correct 8 ms 4444 KB Output is correct
128 Correct 6 ms 3676 KB Output is correct
129 Correct 6 ms 3352 KB Output is correct
130 Correct 3 ms 1628 KB Output is correct
131 Correct 171 ms 81908 KB Output is correct
132 Correct 108 ms 41796 KB Output is correct
133 Correct 95 ms 41828 KB Output is correct
134 Correct 88 ms 41720 KB Output is correct
135 Correct 82 ms 37668 KB Output is correct
136 Correct 14 ms 6232 KB Output is correct
137 Correct 14 ms 5980 KB Output is correct
138 Correct 15 ms 6056 KB Output is correct
139 Correct 14 ms 5980 KB Output is correct
140 Correct 14 ms 5980 KB Output is correct
141 Correct 14 ms 5976 KB Output is correct
142 Correct 19 ms 6860 KB Output is correct
143 Correct 8 ms 2908 KB Output is correct
144 Correct 22 ms 6748 KB Output is correct
145 Correct 8 ms 2908 KB Output is correct
146 Correct 18 ms 6676 KB Output is correct
147 Correct 8 ms 2908 KB Output is correct
148 Correct 9 ms 5212 KB Output is correct
149 Correct 9 ms 5304 KB Output is correct
150 Correct 9 ms 5240 KB Output is correct
151 Correct 8 ms 5208 KB Output is correct

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2904 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 8 ms 4188 KB Output is correct
25 Correct 8 ms 4084 KB Output is correct
26 Correct 8 ms 4184 KB Output is correct
27 Correct 4 ms 1628 KB Output is correct
28 Correct 3 ms 1628 KB Output is correct
29 Correct 4 ms 1628 KB Output is correct
30 Correct 3 ms 1628 KB Output is correct
31 Correct 3 ms 1628 KB Output is correct
32 Correct 3 ms 1628 KB Output is correct
33 Correct 8 ms 5208 KB Output is correct
34 Correct 8 ms 4956 KB Output is correct
35 Correct 8 ms 5212 KB Output is correct
36 Correct 7 ms 5212 KB Output is correct
37 Correct 8 ms 5212 KB Output is correct
38 Correct 8 ms 5212 KB Output is correct
39 Correct 14 ms 6236 KB Output is correct
40 Correct 13 ms 6176 KB Output is correct
41 Correct 13 ms 6232 KB Output is correct
42 Correct 11 ms 6612 KB Output is correct
43 Correct 8 ms 4312 KB Output is correct
44 Correct 14 ms 7156 KB Output is correct
45 Correct 9 ms 4952 KB Output is correct
46 Correct 9 ms 4444 KB Output is correct
47 Correct 12 ms 7224 KB Output is correct
48 Runtime error 43 ms 34740 KB Execution killed with signal 11
49 Halted 0 ms 0 KB -