oj.uz

Submission #919774

# Submission time Handle Problem Language Result Execution time Memory
919774 2024-02-01T15:49:38 Z andrei_iorgulescu Maze (JOI23_ho_t3) C++14
54 / 100
 462 ms 190376 KB 
#include <bits/stdc++.h>

using namespace std;

int inf = 1e9;
int dl[] = {-1,0,1,0};
int dc[] = {0,1,0,-1};

int r,c,n;
int xs,ys,xf,yf;
vector<vector<char>>a;
vector<vector<int>>d;
vector<pair<int,int>>new_cells;
vector<pair<int,int>>cells;
vector<vector<int>>s,ss;
vector<int>tots,totss;

void updates(int unde,int pos)
{
    tots[unde]--;
    for (int i = pos; i <= c; i += (i & -i))
        s[unde][i]--;
}

void updatess(int unde,int pos)
{
    totss[unde]--;
    for (int i = pos; i <= r; i += (i & -i))
        ss[unde][i]--;
}

int querys(int x,int y)
{
    int rsp = 0;
    for (int i = y; i > 0; i -= (i & -i))
        rsp += s[x][i];
    return rsp;
}

int queryss(int x,int y)
{
    int rsp = 0;
    for (int i = y; i > 0; i -= (i & -i))
        rsp += ss[x][i];
    return rsp;
}

int s_findnext(int x,int y)
{
    int vv = querys(x,y - 1);
    if (vv == tots[c])
        return -1;
    int sumaib = 0;
    int st = 0,pas = 1 << 22;
    while (pas != 0)
    {
        if (st + pas <= c and sumaib + s[x][st + pas] <= vv)
        {
            st += pas;
            sumaib += s[x][st];
        }
        pas >>= 1;
    }
    return st + 1;
}

int ss_findnext(int x,int y)
{
    int vv = queryss(x,y - 1);
    if (vv == totss[x])
        return -1;
    int sumaib = 0;
    int st = 0,pas = 1 << 12;
    while (pas != 0)
    {
        if (st + pas <= r and sumaib + ss[x][st + pas] <= vv)
        {
            st += pas;
            sumaib += ss[x][st];
        }
        pas >>= 1;
    }
    return st + 1;
}

void dfs(int x,int y)
{
    //cout << "sus" << x << ' ' << y << endl;
    for (int i = 0; i < 4; i++)
    {
        int nx = x + dl[i],ny = y + dc[i];
        if (nx >= 1 and nx <= r and ny >= 1 and ny <= c and d[nx][ny] == inf and a[nx][ny] == '.')
        {
            d[nx][ny] = d[x][y];
            //s[nx].erase(ny);
            //ss[ny].erase(nx);
            updates(nx,ny);
            updatess(ny,nx);
            cells.push_back({nx,ny});
            dfs(nx,ny);
        }
    }
}

int dgl;

void orizontala(int x,int y1,int y2)
{
    //cout << "h" << x << ' ' << y1 << ' ' << y2 << endl;
    while (true)
    {
        /*auto it = s[x].lower_bound(y1);
        if (it == s[x].end() or *it > y2)
            return;
        d[x][*it] = dgl;
        new_cells.push_back({x,*it});
        s[x].erase(*it);
        ss[*it].erase(x);*/
        int it = s_findnext(x,y1);
        if (it == -1 or it > y2)
            return;
        d[x][it] = dgl;
        new_cells.push_back({x,it});
        updates(x,it);
        updatess(it,x);
    }
}

void verticala(int y,int x1,int x2)
{
    //cout << "v" << y << ' ' << x1 << ' ' << x2 << endl;
    while (true)
    {
        /*auto it = ss[y].lower_bound(x1);
        if (it == ss[y].end() or *it > x2)
            return;
        d[*it][y] = dgl;
        new_cells.push_back({*it,y});
        ss[y].erase(*it);
        s[*it].erase(y);*/
        int it = ss_findnext(y,x1);
        if (it == -1 or it > x2)
            return;
        d[it][y] = dgl;
        new_cells.push_back({it,y});
        updatess(y,it);
        updates(it,y);
    }
}

void baga(int x,int y)
{
    //cout << "bagat" << ' ' << x << ' ' << y << endl;
    dgl = d[x][y] + 1;
    if (abs(x - xf) <= n and abs(y - yf) <= n and abs(x - xf) + abs(y - yf) < 2 * n)
    {
        d[xf][yf] = min(d[xf][yf],1 + d[x][y]);
        return;
    }
    int x1 = x - n,x2 = x + n,y1 = y - n,y2 = y + n;
    ///teoretic pot tot patratul (x1,y1,x2,y2) fara colturi, daca ies din matrice ayaye
    ///pot sa iau intersectia dreptunghiurilor (x1,y1,x2,y2) cu matricea si daca e tai colturile
    x1 = max(x1,1);
    x2 = min(x2,r);
    y1 = max(y1,1);
    y2 = min(y2,c);
    //cout << x1 << ' ' << x2 << ' ' << y1 << ' ' << y2 << endl;
    if (x1 != x - n)
        orizontala(x1,y1,y2);
    else
    {
        int y1r = y1,y2r = y2;
        if (y1 == y - n)
            y1r++;
        if (y2 == y + n)
            y2r--;
        orizontala(x1,y1r,y2r);
    }
    if (x2 != x + n)
        orizontala(x2,y1,y2);
    else
    {
        int y1r = y1,y2r = y2;
        if (y1 == y - n)
            y1r++;
        if (y2 == y + n)
            y2r--;
        orizontala(x2,y1r,y2r);
    }
    if (y1 != y - n)
        verticala(y1,x1,x2);
    else
    {
        int x1r = x1,x2r = x2;
        if (x1 == x - n)
            x1r++;
        if (x2 == x + n)
            x2r--;
        verticala(y1,x1r,x2r);
    }
    if (y2 != y + n)
        verticala(y2,x1,x2);
    else
    {
        int x1r = x1,x2r = x2;
        if (x1 == x - n)
            x1r++;
        if (x2 == x + n)
            x2r--;
        verticala(y2,x1r,x2r);
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> r >> c >> n >> xs >> ys >> xf >> yf;
    a.resize(r + 1);
    s.resize(r + 1);
    ss.resize(c + 1);
    tots.resize(r + 1);
    totss.resize(c + 1);
    for (int i = 1; i <= r; i++)
        s[i].resize(c + 1);
    for (int i = 1; i <= c; i++)
        ss[i].resize(r + 1);
    for (int i = 1; i <= r; i++)
        tots[i] = c;
    for (int i = 1; i <= c; i++)
        totss[i] = r;
    for (int i = 1; i <= r; i++)
    {
        for (int j = 1; j <= c; j++)
        {
            s[i][j] = (j & -j);
            ss[j][i] = (i & -i);
        }
    }
    for (int i = 1; i <= r; i++)
    {
        a[i].resize(c + 1);
        for (int j = 1; j <= c; j++)
            cin >> a[i][j];
    }
    d.resize(r + 1);
    for (int i = 1; i <= r; i++)
        d[i].resize(c + 1);
    for (int i = 1; i <= r; i++)
        for (int j = 1; j <= c; j++)
            d[i][j] = 1e9;
    new_cells.push_back({xs,ys});
    d[xs][ys] = 0;
    updates(xs,ys);
    updatess(ys,xs);
    while (true)
    {
        //cout << endl;
        //for (auto it : new_cells)
          //  cout << "nc" << ' ' << it.first << ' ' << it.second << ' ' << d[it.first][it.second] << endl;
        cells = new_cells;
        for (auto it : new_cells)
            dfs(it.first,it.second);
        new_cells.clear();
        for (auto it : cells)
            baga(it.first,it.second);
        if (d[xf][yf] != inf)
            break;
    }
    cout << d[xf][yf];
    return 0;
}

/**
din (i,j) pot merge ori intr-un vecin care e si el alb
as mai putea merge in patratul de latura 2n + 1 centrat in (i,j) fara colturile lui
acum, faza funny e ca nu prea ma intereseaza de mersul inauntrul formei ci doar pe marini, unless este celula de finish in interior
asa ca, ori e celula de finish in interior si zic direct gen "boss, dute in aia", ori pun cu cost + 1 celulele de pe margini
acum, ca sa gasesc celulele de pe margini nevizitate inca, trebuie doar sa vad pe niste bucati de linii / coloane care mai sunt alive
asta pot cu un set, dar cu constanta aia :skull: mai bine nu, deci bag aib si cb pe aib

Acum, cum imi fac dfs-ul ca sa nu iasa nimic dubios
In etape, cat timp n-am ajuns la finish, mai intai imi iau celulele cu care n-am trecut prin faza 1 si le dau fill cat au in jur 0
Iar in faza 2 iau celulele care n-au trecut prin faza asta si le fac kinda patratul, iau alea de pe margini etc
**/

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 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 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 10 ms 1116 KB Output is correct
20 Correct 10 ms 3420 KB Output is correct
21 Correct 13 ms 7896 KB Output is correct
22 Correct 13 ms 1112 KB Output is correct
23 Correct 14 ms 1116 KB Output is correct
24 Correct 11 ms 4444 KB Output is correct
25 Correct 13 ms 4700 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 6 ms 1368 KB Output is correct
29 Incorrect 33 ms 2396 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 356 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 11 ms 4816 KB Output is correct
27 Correct 13 ms 7900 KB Output is correct
28 Correct 8 ms 7896 KB Output is correct
29 Correct 1 ms 1112 KB Output is correct
30 Correct 2 ms 1116 KB Output is correct
31 Correct 5 ms 1372 KB Output is correct
32 Correct 3 ms 1368 KB Output is correct
33 Correct 3 ms 1368 KB Output is correct
34 Correct 21 ms 9428 KB Output is correct
35 Correct 36 ms 19408 KB Output is correct
36 Correct 20 ms 19408 KB Output is correct
37 Correct 3 ms 2392 KB Output is correct
38 Correct 3 ms 2392 KB Output is correct
39 Correct 87 ms 28860 KB Output is correct
40 Correct 253 ms 86428 KB Output is correct
41 Correct 462 ms 190376 KB Output is correct
42 Correct 213 ms 190192 KB Output is correct
43 Correct 24 ms 19548 KB Output is correct
44 Correct 24 ms 19536 KB Output is correct
45 Correct 253 ms 58032 KB Output is correct
46 Correct 208 ms 71600 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 356 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 10 ms 1112 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 856 KB Output is correct
37 Correct 10 ms 3416 KB Output is correct
38 Correct 11 ms 4820 KB Output is correct
39 Correct 13 ms 7896 KB Output is correct
40 Correct 11 ms 1368 KB Output is correct
41 Correct 13 ms 1372 KB Output is correct
42 Correct 11 ms 8212 KB Output is correct
43 Correct 1 ms 1112 KB Output is correct
44 Correct 1 ms 1112 KB Output is correct
45 Correct 11 ms 4440 KB Output is correct
46 Correct 12 ms 4440 KB Output is correct
47 Correct 13 ms 2652 KB Output is correct
48 Correct 8 ms 1372 KB Output is correct
49 Correct 7 ms 1368 KB Output is correct
50 Correct 9 ms 1368 KB Output is correct
51 Correct 5 ms 1368 KB Output is correct
52 Correct 3 ms 1368 KB Output is correct
53 Correct 3 ms 1600 KB Output is correct
54 Correct 8 ms 1368 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 356 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 10 ms 1112 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 856 KB Output is correct
37 Correct 10 ms 3416 KB Output is correct
38 Correct 11 ms 4820 KB Output is correct
39 Correct 13 ms 7896 KB Output is correct
40 Correct 11 ms 1368 KB Output is correct
41 Correct 13 ms 1372 KB Output is correct
42 Correct 11 ms 8212 KB Output is correct
43 Correct 1 ms 1112 KB Output is correct
44 Correct 1 ms 1112 KB Output is correct
45 Correct 11 ms 4440 KB Output is correct
46 Correct 12 ms 4440 KB Output is correct
47 Correct 13 ms 2652 KB Output is correct
48 Correct 8 ms 1372 KB Output is correct
49 Correct 7 ms 1368 KB Output is correct
50 Correct 9 ms 1368 KB Output is correct
51 Correct 5 ms 1368 KB Output is correct
52 Correct 3 ms 1368 KB Output is correct
53 Correct 3 ms 1600 KB Output is correct
54 Correct 8 ms 1368 KB Output is correct
55 Incorrect 33 ms 2392 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 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 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 10 ms 1116 KB Output is correct
20 Correct 10 ms 3420 KB Output is correct
21 Correct 13 ms 7896 KB Output is correct
22 Correct 13 ms 1112 KB Output is correct
23 Correct 14 ms 1116 KB Output is correct
24 Correct 11 ms 4444 KB Output is correct
25 Correct 13 ms 4700 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 6 ms 1368 KB Output is correct
29 Incorrect 33 ms 2396 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 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 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 10 ms 1116 KB Output is correct
20 Correct 10 ms 3420 KB Output is correct
21 Correct 13 ms 7896 KB Output is correct
22 Correct 13 ms 1112 KB Output is correct
23 Correct 14 ms 1116 KB Output is correct
24 Correct 11 ms 4444 KB Output is correct
25 Correct 13 ms 4700 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 6 ms 1368 KB Output is correct
29 Incorrect 33 ms 2396 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 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 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 10 ms 1116 KB Output is correct
20 Correct 10 ms 3420 KB Output is correct
21 Correct 13 ms 7896 KB Output is correct
22 Correct 13 ms 1112 KB Output is correct
23 Correct 14 ms 1116 KB Output is correct
24 Correct 11 ms 4444 KB Output is correct
25 Correct 13 ms 4700 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 2 ms 1368 KB Output is correct
28 Correct 6 ms 1368 KB Output is correct
29 Incorrect 33 ms 2396 KB Output isn't correct
30 Halted 0 ms 0 KB -