oj.uz

답안 #768672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768672 2023-06-28T11:20:04 Z boris_mihov 미술 수업 (IOI13_artclass) C++17
54 / 100
 180 ms 31444 KB 
#include "artclass.h"
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <set>

typedef long long llong;
const int MAXN = 500;
const int INF  = 1e9;

int H, W;
struct Cell
{
    int x, y, z;
    friend int operator - (const Cell &a, const Cell &b)
    {
        return abs(a.x - b.x) + abs(a.y - b.y) + abs(a.z - b.z);
    }

    friend bool operator < (const Cell &a, const Cell &b)
    {
        return (a.x < b.x || (a.x == b.x && a.y < b.y) || (a.x == b.x && a.y == b.y && a.z < b.z));
    }
};

const int CNTBASE = 7;
int compBase[CNTBASE] = {2, 5, 10, 15, 20, 50, 100};
bool close(Cell a, Cell b, int idx)
{
    return abs(a.x - b.x) < compBase[idx] && abs(a.y - b.y) < compBase[idx] && abs(a.z - b.z) < compBase[idx];
}

const int BASE = 5;
const int BASE2 = 10;
int convert(int x)
{
    if (x % BASE < BASE / 2) return x - (x % BASE);
    return x + BASE - (x % BASE);
}

std::set <Cell> s;
Cell pixel[MAXN][MAXN];
Cell block[MAXN][MAXN];
std::pair <int,int> delta[] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};

bool out(int x, int y)
{
    return (x == -1 || y == -1 || x == H / BASE2 || y == W / BASE2);
}

bool outDFS(int x, int y)
{
    return (x == -1 || y == -1 || x == H || y == W);
}

bool vis[MAXN][MAXN][CNTBASE];
void dfs(int x, int y, int cnt)
{
    vis[x][y][cnt] = true;
    for (const auto &[dx, dy] : delta)
    {
        if (outDFS(x + dx, y + dy) || !close(pixel[x][y], pixel[x + dx][y + dy], cnt) || vis[x + dx][y + dy][cnt])
        {
            continue;
        }

        dfs(x + dx, y + dy, cnt);
    }
}

int style(int h, int w, int R[500][500], int G[500][500], int B[500][500]) 
{
    H = h;
    W = w;
    llong sum = 0;
    llong green = 0;
    for (int i = 0 ; i < H ; ++i)
    {
        for (int j = 0 ; j < W ; ++j)
        {
            sum += R[i][j];
            sum += G[i][j];
            sum += B[i][j];
            pixel[i][j] = {R[i][j], G[i][j], B[i][j]};
            block[i / BASE2][j / BASE2].x += R[i][j];
            block[i / BASE2][j / BASE2].y += G[i][j];
            block[i / BASE2][j / BASE2].z += B[i][j];
            green += (G[i][j] - std::min(R[i][j], B[i][j]));
            s.insert({convert(R[i][j]), convert(G[i][j]), convert(B[i][j])});
        }
    }

    llong diff = 0;
    llong diff2 = 0;
    for (int i = 0 ; i * BASE2 < H ; ++i)
    {
        for (int j = 0 ; j * BASE2 < W ; ++j)
        {
            for (const auto &[dx, dy] : delta)
            {
                if (out(i + dx, j + dy))
                {
                    continue;
                }

                diff += block[i][j] - block[i + dx][j + dy];
            }   
        }
    }

    for (int i = 0 ; i < H ; ++i)
    {
        for (int j = 0 ; j < W ; ++j)
        {
            for (const auto &[dx, dy] : delta)
            {
                if (out(i + dx, j + dy))
                {
                    continue;
                }

                diff2 += pixel[i][j] - pixel[i + dx][j + dy];
            }   
        }
    }

    int compCnt[CNTBASE];
    for (int k = 0 ; k < CNTBASE ; ++k)
    {
        compCnt[k] = 0;
        for (int i = 0 ; i < H ; ++i)
        {
            for (int j = 0 ; j < W ; ++j)
            {
                if (!vis[i][j][k])
                {
                    compCnt[k]++;
                    dfs(i, j, k);
                }
            }
        }
    }

    if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 50  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 4;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 9000 <= compCnt[1] && compCnt[1] <= 60000  && 0 <= compCnt[2] && compCnt[2] <= 123208  && 0 <= compCnt[3] && compCnt[3] <= 98996  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 8828  && 0 <= compCnt[6] && compCnt[6] <= 20 ) return 1;
if (0 <= compCnt[0] && compCnt[0] <= 101339  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 18601  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 4;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 29574  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 99 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 1;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 172117  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 33890 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 3;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 163567 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 2;    
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 102029 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 1;    
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 7217  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 2;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 12099 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 70850  && 70527 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 3;      
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 1102 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 5132 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 68 ) return 4;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 182241 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 4;    
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 60423 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 1;     
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 140430  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 4;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 52894 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 3067 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 2;  
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 44210  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 2;
if (203496 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 98 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 1;   
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 56928 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 3;     
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 4525  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 5681 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 3;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 6063 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 4;      
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 97426  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 2;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 17506  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 2;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 1042 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 4;      
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 77886  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 1;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 83 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 1;        
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 99 ) return 3;
if (0 <= compCnt[0] && compCnt[0] <= 24610  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 76362 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 4;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 25 ) return 2;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 30733  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 2;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 67256  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 4;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 60 ) return 4;
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 71201 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 2;     
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 39431 <= compCnt[1] && compCnt[1] <= 1000000000  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 1;     
if (0 <= compCnt[0] && compCnt[0] <= 1000000000  && 0 <= compCnt[1] && compCnt[1] <= 92262  && 0 <= compCnt[2] && compCnt[2] <= 1000000000  && 0 <= compCnt[3] && compCnt[3] <= 1000000000  && 0 <= compCnt[4] && compCnt[4] <= 1000000000  && 0 <= compCnt[5] && compCnt[5] <= 1000000000  && 0 <= compCnt[6] && compCnt[6] <= 1000000000 ) return 1;
return 2;
}

Subtask #1
54.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 112 ms 24720 KB Output isn't correct
2 Correct 128 ms 28888 KB Output is correct
3 Incorrect 94 ms 24304 KB Output isn't correct
4 Incorrect 124 ms 27468 KB Output isn't correct
5 Correct 126 ms 21300 KB Output is correct
6 Incorrect 108 ms 24372 KB Output isn't correct
7 Incorrect 122 ms 27980 KB Output isn't correct
8 Correct 135 ms 25496 KB Output is correct
9 Correct 120 ms 26384 KB Output is correct
10 Incorrect 125 ms 28988 KB Output isn't correct
11 Correct 101 ms 23148 KB Output is correct
12 Correct 131 ms 22844 KB Output is correct
13 Incorrect 123 ms 24120 KB Output isn't correct
14 Correct 123 ms 26616 KB Output is correct
15 Correct 78 ms 15080 KB Output is correct
16 Correct 122 ms 22564 KB Output is correct
17 Correct 105 ms 20760 KB Output is correct
18 Correct 81 ms 23200 KB Output is correct
19 Correct 79 ms 19344 KB Output is correct
20 Correct 88 ms 19100 KB Output is correct
21 Correct 93 ms 21352 KB Output is correct
22 Incorrect 150 ms 28272 KB Output isn't correct
23 Incorrect 123 ms 27104 KB Output isn't correct
24 Correct 116 ms 27832 KB Output is correct
25 Correct 121 ms 27016 KB Output is correct
26 Correct 101 ms 20400 KB Output is correct
27 Correct 86 ms 12892 KB Output is correct
28 Correct 128 ms 24784 KB Output is correct
29 Correct 72 ms 15352 KB Output is correct
30 Correct 99 ms 22400 KB Output is correct
31 Incorrect 149 ms 23196 KB Output isn't correct
32 Correct 173 ms 27608 KB Output is correct
33 Correct 108 ms 24080 KB Output is correct
34 Correct 132 ms 26652 KB Output is correct
35 Incorrect 175 ms 28512 KB Output isn't correct
36 Correct 128 ms 26476 KB Output is correct
37 Correct 140 ms 26656 KB Output is correct
38 Incorrect 122 ms 24064 KB Output isn't correct
39 Correct 101 ms 21932 KB Output is correct
40 Correct 130 ms 25316 KB Output is correct
41 Incorrect 105 ms 23116 KB Output isn't correct
42 Correct 119 ms 24340 KB Output is correct
43 Correct 154 ms 26572 KB Output is correct
44 Incorrect 163 ms 24952 KB Output isn't correct
45 Correct 149 ms 21792 KB Output is correct
46 Incorrect 116 ms 17144 KB Output isn't correct
47 Correct 95 ms 21100 KB Output is correct
48 Correct 147 ms 26204 KB Output is correct
49 Correct 140 ms 25444 KB Output is correct
50 Incorrect 138 ms 27216 KB Output isn't correct
51 Correct 128 ms 23828 KB Output is correct
52 Incorrect 144 ms 19688 KB Output isn't correct
53 Correct 115 ms 21020 KB Output is correct
54 Correct 167 ms 23864 KB Output is correct
55 Correct 180 ms 31444 KB Output is correct
56 Correct 133 ms 27392 KB Output is correct
57 Correct 36 ms 13300 KB Output is correct
58 Correct 80 ms 16348 KB Output is correct
59 Incorrect 31 ms 6236 KB Output isn't correct
60 Correct 87 ms 15328 KB Output is correct
61 Correct 106 ms 26436 KB Output is correct
62 Correct 86 ms 18936 KB Output is correct
63 Correct 84 ms 18736 KB Output is correct
64 Incorrect 114 ms 27548 KB Output isn't correct
65 Correct 106 ms 24712 KB Output is correct
66 Correct 138 ms 29456 KB Output is correct
67 Correct 130 ms 26408 KB Output is correct
68 Correct 60 ms 11328 KB Output is correct
69 Incorrect 129 ms 23000 KB Output isn't correct
70 Incorrect 118 ms 22956 KB Output isn't correct
71 Correct 85 ms 23888 KB Output is correct
72 Correct 134 ms 26112 KB Output is correct
73 Correct 75 ms 14044 KB Output is correct
74 Incorrect 122 ms 23756 KB Output isn't correct
75 Correct 120 ms 25620 KB Output is correct
76 Correct 110 ms 22400 KB Output is correct
77 Incorrect 110 ms 24596 KB Output isn't correct
78 Incorrect 120 ms 23932 KB Output isn't correct
79 Incorrect 143 ms 23632 KB Output isn't correct
80 Correct 142 ms 25648 KB Output is correct
81 Correct 129 ms 27392 KB Output is correct
82 Incorrect 135 ms 29732 KB Output isn't correct
83 Correct 149 ms 29836 KB Output is correct
84 Correct 52 ms 11000 KB Output is correct
85 Incorrect 107 ms 20540 KB Output isn't correct
86 Incorrect 117 ms 26912 KB Output isn't correct
87 Correct 147 ms 27228 KB Output is correct
88 Correct 113 ms 24152 KB Output is correct
89 Correct 132 ms 25624 KB Output is correct
90 Correct 103 ms 15532 KB Output is correct
91 Correct 100 ms 20748 KB Output is correct
92 Incorrect 147 ms 28164 KB Output isn't correct
93 Incorrect 84 ms 18024 KB Output isn't correct
94 Correct 86 ms 19600 KB Output is correct
95 Correct 111 ms 20612 KB Output is correct
96 Correct 115 ms 26936 KB Output is correct
97 Correct 113 ms 21396 KB Output is correct
98 Incorrect 121 ms 24924 KB Output isn't correct
99 Correct 130 ms 27244 KB Output is correct
100 Correct 119 ms 28364 KB Output is correct
101 Correct 126 ms 27184 KB Output is correct
102 Correct 60 ms 19680 KB Output is correct