oj.uz

답안 #770731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770731 2023-07-01T20:14:02 Z boris_mihov Maze (JOI23_ho_t3) C++17
8 / 100
 945 ms 671060 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>

typedef long long llong;
const int MAXLOG = 23;
const int MAXN = 6000000 + 10;
const int INF  = 1e9;

struct BIT
{
    std::vector <int> tree;
    void build(int sz)
    {
        tree.resize(sz + 1, 0);
    }

    void update(int pos, int value)
    {
        for (int idx = pos ; idx < tree.size() ; idx += idx & (-idx))
        {
            tree[idx] += value;
        }
    }

    int query(int pos)
    {
        int res = 0;
        for (int idx = pos ; idx > 0 ; idx -= idx & (-idx))
        {
            res += tree[idx];
        }

        return pos - res;
    }

    int findKth(int k)
    {
        int l = 0, r = tree.size(), mid;
        while (l < r - 1)
        {
            mid = (l + r) / 2;
            if (query(mid) < k) l = mid;
            else r = mid;
        }

        return r;
        int idx = 0;
        for (int log = MAXLOG - 1 ; log >= 0 ; --log)
        {
            if (idx + (1 << log) < tree.size() && (1 << log) - tree[idx + (1 << log)] < k)
            {
                idx += (1 << log);
                k -= (1 << log) - tree[idx];
            }
        }

        return idx + 1;
    }
};

int r, c, n;
int sRow, sCol;
int eRow, eCol;
BIT byROW[MAXN];
BIT byCOL[MAXN];
std::pair <int,int> delta[] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};
std::deque <std::pair <int,int>> dq;
std::vector <int> dist[MAXN];
std::string t[MAXN];

bool isOutside(int row, int col)
{
    return row == 0 || row == r + 1 || col == 0 || col == c + 1;
}

void setCELL(int row, int col)
{
    byROW[row].update(col, 1); 
    byCOL[col].update(row, 1); 
}

void addROW(int row, int colL, int colR, int currDist)
{
    int curr = byROW[row].query(colL - 1);
    while (true)
    {
        int search = byROW[row].findKth(curr + 1);
        if (search > colR)
        {
            break;
        }

        dist[row][search] = currDist + 1;
        dq.push_back({row, search});
        setCELL(row, search);
    }
}

void addCOL(int col, int rowL, int rowR, int currDist)
{
    int curr = byCOL[col].query(rowL - 1);
    while (true)
    {
        int search = byCOL[col].findKth(curr + 1);
        if (search > rowR)
        {
            break;
        }

        dist[search][col] = currDist + 1;
        dq.push_back({search, col});
        setCELL(search, col);
    }
}

void solve()
{
    for (int i = 1 ; i <= r ; ++i)
    {
        std::fill(dist[i].begin(), dist[i].end(), INF);
    }

    for (int i = 1 ; i <= r ; ++i)
    {
        byROW[i].build(c);
    }
    
    for (int i = 1 ; i <= c ; ++i)
    {
        byCOL[i].build(r);
    }
    
    dq.push_back({sRow, sCol});
    dist[sRow][sCol] = 0;
    setCELL(sRow, sCol);

    while (!dq.empty())
    {
        auto [row, col] = dq.front();
        dq.pop_front();    

        if (row == eRow && col == eCol)
        {
            std::cout << dist[row][col] << '\n';
            break;
        }

        for (const auto &[dx, dy] : delta)
        {
            if (isOutside(row + dx, col + dy) || dist[row + dx][col + dy] <= dist[row][col])
            {
                continue;
            }

            if (t[row + dx][col + dy] == '.')
            {
                setCELL(row + dx, col + dy);
                dist[row + dx][col + dy] = dist[row][col]; 
                dq.push_front({row + dx, col + dy});
            }
        }

        if (abs(row - eRow) <= n && abs(col - eCol) <= n && dist[eRow][eCol] > dist[row][col])
        {
            setCELL(eRow, eCol);
            dist[eRow][eCol] = dist[row][col] + 1;
            dq.push_back({eRow, eCol});
        }

        addROW(std::max(1, row - n), std::max(1, col - n + 1), std::min(c, col + n - 1), dist[row][col]);
        addROW(std::min(r, row + n), std::max(1, col - n + 1), std::min(c, col + n - 1), dist[row][col]);
        addCOL(std::max(1, col - n), std::max(1, row - n + 1), std::min(r, row + n - 1), dist[row][col]);
        addCOL(std::min(c, col + n), std::max(1, row - n + 1), std::min(r, row + n - 1), dist[row][col]);
    }
}

void input()
{
    std::cin >> r >> c >> n;
    std::cin >> sRow >> sCol;
    std::cin >> eRow >> eCol;
    for (int i = 1 ; i <= r ; ++i)
    {
        std::cin >> t[i];
        t[i] = ' ' + t[i];
        dist[i].resize(c + 1, INF);
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Compilation message

Main.cpp: In member function 'void BIT::update(int, int)':
Main.cpp:23:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int idx = pos ; idx < tree.size() ; idx += idx & (-idx))
      |                              ~~~~^~~~~~~~~~~~~
Main.cpp: In member function 'int BIT::findKth(int)':
Main.cpp:54:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |             if (idx + (1 << log) < tree.size() && (1 << log) - tree[idx + (1 << log)] < k)
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 292 ms 610952 KB Output is correct
2 Correct 256 ms 610812 KB Output is correct
3 Correct 243 ms 610884 KB Output is correct
4 Correct 253 ms 610888 KB Output is correct
5 Correct 242 ms 610876 KB Output is correct
6 Correct 247 ms 610952 KB Output is correct
7 Correct 240 ms 610912 KB Output is correct
8 Correct 243 ms 610824 KB Output is correct
9 Correct 254 ms 610764 KB Output is correct
10 Correct 254 ms 610784 KB Output is correct
11 Correct 243 ms 610868 KB Output is correct
12 Correct 246 ms 610912 KB Output is correct
13 Correct 244 ms 610760 KB Output is correct
14 Correct 242 ms 610796 KB Output is correct
15 Correct 247 ms 610896 KB Output is correct
16 Correct 241 ms 610784 KB Output is correct
17 Correct 279 ms 610876 KB Output is correct
18 Correct 242 ms 610772 KB Output is correct
19 Correct 273 ms 611664 KB Output is correct
20 Correct 259 ms 612692 KB Output is correct
21 Correct 252 ms 611828 KB Output is correct
22 Correct 257 ms 611628 KB Output is correct
23 Correct 260 ms 611528 KB Output is correct
24 Correct 261 ms 613220 KB Output is correct
25 Correct 256 ms 613172 KB Output is correct
26 Correct 246 ms 611644 KB Output is correct
27 Correct 252 ms 611644 KB Output is correct
28 Correct 274 ms 611644 KB Output is correct
29 Correct 296 ms 612684 KB Output is correct
30 Correct 273 ms 612344 KB Output is correct
31 Correct 258 ms 613132 KB Output is correct
32 Correct 290 ms 612816 KB Output is correct
33 Correct 303 ms 612748 KB Output is correct
34 Correct 303 ms 616908 KB Output is correct
35 Correct 289 ms 616900 KB Output is correct
36 Correct 271 ms 612924 KB Output is correct
37 Correct 281 ms 612840 KB Output is correct
38 Correct 243 ms 612712 KB Output is correct
39 Correct 945 ms 630140 KB Output is correct
40 Correct 264 ms 613184 KB Output is correct
41 Correct 272 ms 618244 KB Output is correct
42 Correct 330 ms 613696 KB Output is correct
43 Correct 308 ms 616744 KB Output is correct
44 Correct 345 ms 623236 KB Output is correct
45 Correct 402 ms 622984 KB Output is correct
46 Correct 584 ms 636336 KB Output is correct
47 Correct 764 ms 630096 KB Output is correct
48 Correct 767 ms 630060 KB Output is correct
49 Correct 865 ms 671008 KB Output is correct
50 Correct 860 ms 671060 KB Output is correct
51 Correct 619 ms 630312 KB Output is correct
52 Correct 515 ms 630164 KB Output is correct
53 Correct 796 ms 630096 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 610768 KB Output is correct
2 Correct 270 ms 610860 KB Output is correct
3 Correct 325 ms 610772 KB Output is correct
4 Correct 259 ms 610824 KB Output is correct
5 Correct 258 ms 610880 KB Output is correct
6 Correct 244 ms 610764 KB Output is correct
7 Correct 254 ms 610764 KB Output is correct
8 Correct 257 ms 610832 KB Output is correct
9 Correct 261 ms 610888 KB Output is correct
10 Correct 244 ms 610776 KB Output is correct
11 Correct 263 ms 610844 KB Output is correct
12 Correct 263 ms 610816 KB Output is correct
13 Correct 269 ms 610884 KB Output is correct
14 Correct 275 ms 610828 KB Output is correct
15 Correct 252 ms 610912 KB Output is correct
16 Correct 250 ms 610916 KB Output is correct
17 Correct 257 ms 610900 KB Output is correct
18 Correct 256 ms 610864 KB Output is correct
19 Correct 282 ms 610900 KB Output is correct
20 Incorrect 250 ms 610872 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 248 ms 610868 KB Output is correct
2 Correct 267 ms 610868 KB Output is correct
3 Correct 260 ms 610868 KB Output is correct
4 Correct 275 ms 610864 KB Output is correct
5 Correct 268 ms 610784 KB Output is correct
6 Correct 258 ms 610852 KB Output is correct
7 Correct 248 ms 610832 KB Output is correct
8 Correct 253 ms 610772 KB Output is correct
9 Correct 257 ms 610772 KB Output is correct
10 Correct 276 ms 610884 KB Output is correct
11 Correct 248 ms 610840 KB Output is correct
12 Correct 258 ms 610880 KB Output is correct
13 Correct 263 ms 610868 KB Output is correct
14 Correct 262 ms 610856 KB Output is correct
15 Correct 250 ms 610868 KB Output is correct
16 Correct 255 ms 610944 KB Output is correct
17 Correct 251 ms 610792 KB Output is correct
18 Correct 255 ms 610820 KB Output is correct
19 Correct 261 ms 610864 KB Output is correct
20 Correct 246 ms 610876 KB Output is correct
21 Correct 258 ms 610856 KB Output is correct
22 Correct 250 ms 611008 KB Output is correct
23 Correct 258 ms 610836 KB Output is correct
24 Correct 251 ms 610896 KB Output is correct
25 Incorrect 252 ms 611412 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 610768 KB Output is correct
2 Correct 270 ms 610860 KB Output is correct
3 Correct 325 ms 610772 KB Output is correct
4 Correct 259 ms 610824 KB Output is correct
5 Correct 258 ms 610880 KB Output is correct
6 Correct 244 ms 610764 KB Output is correct
7 Correct 254 ms 610764 KB Output is correct
8 Correct 257 ms 610832 KB Output is correct
9 Correct 261 ms 610888 KB Output is correct
10 Correct 244 ms 610776 KB Output is correct
11 Correct 263 ms 610844 KB Output is correct
12 Correct 263 ms 610816 KB Output is correct
13 Correct 269 ms 610884 KB Output is correct
14 Correct 275 ms 610828 KB Output is correct
15 Correct 252 ms 610912 KB Output is correct
16 Correct 250 ms 610916 KB Output is correct
17 Correct 257 ms 610900 KB Output is correct
18 Correct 256 ms 610864 KB Output is correct
19 Correct 282 ms 610900 KB Output is correct
20 Incorrect 250 ms 610872 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 610768 KB Output is correct
2 Correct 270 ms 610860 KB Output is correct
3 Correct 325 ms 610772 KB Output is correct
4 Correct 259 ms 610824 KB Output is correct
5 Correct 258 ms 610880 KB Output is correct
6 Correct 244 ms 610764 KB Output is correct
7 Correct 254 ms 610764 KB Output is correct
8 Correct 257 ms 610832 KB Output is correct
9 Correct 261 ms 610888 KB Output is correct
10 Correct 244 ms 610776 KB Output is correct
11 Correct 263 ms 610844 KB Output is correct
12 Correct 263 ms 610816 KB Output is correct
13 Correct 269 ms 610884 KB Output is correct
14 Correct 275 ms 610828 KB Output is correct
15 Correct 252 ms 610912 KB Output is correct
16 Correct 250 ms 610916 KB Output is correct
17 Correct 257 ms 610900 KB Output is correct
18 Correct 256 ms 610864 KB Output is correct
19 Correct 282 ms 610900 KB Output is correct
20 Incorrect 250 ms 610872 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 292 ms 610952 KB Output is correct
2 Correct 256 ms 610812 KB Output is correct
3 Correct 243 ms 610884 KB Output is correct
4 Correct 253 ms 610888 KB Output is correct
5 Correct 242 ms 610876 KB Output is correct
6 Correct 247 ms 610952 KB Output is correct
7 Correct 240 ms 610912 KB Output is correct
8 Correct 243 ms 610824 KB Output is correct
9 Correct 254 ms 610764 KB Output is correct
10 Correct 254 ms 610784 KB Output is correct
11 Correct 243 ms 610868 KB Output is correct
12 Correct 246 ms 610912 KB Output is correct
13 Correct 244 ms 610760 KB Output is correct
14 Correct 242 ms 610796 KB Output is correct
15 Correct 247 ms 610896 KB Output is correct
16 Correct 241 ms 610784 KB Output is correct
17 Correct 279 ms 610876 KB Output is correct
18 Correct 242 ms 610772 KB Output is correct
19 Correct 273 ms 611664 KB Output is correct
20 Correct 259 ms 612692 KB Output is correct
21 Correct 252 ms 611828 KB Output is correct
22 Correct 257 ms 611628 KB Output is correct
23 Correct 260 ms 611528 KB Output is correct
24 Correct 261 ms 613220 KB Output is correct
25 Correct 256 ms 613172 KB Output is correct
26 Correct 246 ms 611644 KB Output is correct
27 Correct 252 ms 611644 KB Output is correct
28 Correct 274 ms 611644 KB Output is correct
29 Correct 296 ms 612684 KB Output is correct
30 Correct 273 ms 612344 KB Output is correct
31 Correct 258 ms 613132 KB Output is correct
32 Correct 290 ms 612816 KB Output is correct
33 Correct 303 ms 612748 KB Output is correct
34 Correct 303 ms 616908 KB Output is correct
35 Correct 289 ms 616900 KB Output is correct
36 Correct 271 ms 612924 KB Output is correct
37 Correct 281 ms 612840 KB Output is correct
38 Correct 243 ms 612712 KB Output is correct
39 Correct 945 ms 630140 KB Output is correct
40 Correct 264 ms 613184 KB Output is correct
41 Correct 272 ms 618244 KB Output is correct
42 Correct 330 ms 613696 KB Output is correct
43 Correct 308 ms 616744 KB Output is correct
44 Correct 345 ms 623236 KB Output is correct
45 Correct 402 ms 622984 KB Output is correct
46 Correct 584 ms 636336 KB Output is correct
47 Correct 764 ms 630096 KB Output is correct
48 Correct 767 ms 630060 KB Output is correct
49 Correct 865 ms 671008 KB Output is correct
50 Correct 860 ms 671060 KB Output is correct
51 Correct 619 ms 630312 KB Output is correct
52 Correct 515 ms 630164 KB Output is correct
53 Correct 796 ms 630096 KB Output is correct
54 Correct 246 ms 610768 KB Output is correct
55 Correct 270 ms 610860 KB Output is correct
56 Correct 325 ms 610772 KB Output is correct
57 Correct 259 ms 610824 KB Output is correct
58 Correct 258 ms 610880 KB Output is correct
59 Correct 244 ms 610764 KB Output is correct
60 Correct 254 ms 610764 KB Output is correct
61 Correct 257 ms 610832 KB Output is correct
62 Correct 261 ms 610888 KB Output is correct
63 Correct 244 ms 610776 KB Output is correct
64 Correct 263 ms 610844 KB Output is correct
65 Correct 263 ms 610816 KB Output is correct
66 Correct 269 ms 610884 KB Output is correct
67 Correct 275 ms 610828 KB Output is correct
68 Correct 252 ms 610912 KB Output is correct
69 Correct 250 ms 610916 KB Output is correct
70 Correct 257 ms 610900 KB Output is correct
71 Correct 256 ms 610864 KB Output is correct
72 Correct 282 ms 610900 KB Output is correct
73 Incorrect 250 ms 610872 KB Output isn't correct
74 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 292 ms 610952 KB Output is correct
2 Correct 256 ms 610812 KB Output is correct
3 Correct 243 ms 610884 KB Output is correct
4 Correct 253 ms 610888 KB Output is correct
5 Correct 242 ms 610876 KB Output is correct
6 Correct 247 ms 610952 KB Output is correct
7 Correct 240 ms 610912 KB Output is correct
8 Correct 243 ms 610824 KB Output is correct
9 Correct 254 ms 610764 KB Output is correct
10 Correct 254 ms 610784 KB Output is correct
11 Correct 243 ms 610868 KB Output is correct
12 Correct 246 ms 610912 KB Output is correct
13 Correct 244 ms 610760 KB Output is correct
14 Correct 242 ms 610796 KB Output is correct
15 Correct 247 ms 610896 KB Output is correct
16 Correct 241 ms 610784 KB Output is correct
17 Correct 279 ms 610876 KB Output is correct
18 Correct 242 ms 610772 KB Output is correct
19 Correct 273 ms 611664 KB Output is correct
20 Correct 259 ms 612692 KB Output is correct
21 Correct 252 ms 611828 KB Output is correct
22 Correct 257 ms 611628 KB Output is correct
23 Correct 260 ms 611528 KB Output is correct
24 Correct 261 ms 613220 KB Output is correct
25 Correct 256 ms 613172 KB Output is correct
26 Correct 246 ms 611644 KB Output is correct
27 Correct 252 ms 611644 KB Output is correct
28 Correct 274 ms 611644 KB Output is correct
29 Correct 296 ms 612684 KB Output is correct
30 Correct 273 ms 612344 KB Output is correct
31 Correct 258 ms 613132 KB Output is correct
32 Correct 290 ms 612816 KB Output is correct
33 Correct 303 ms 612748 KB Output is correct
34 Correct 303 ms 616908 KB Output is correct
35 Correct 289 ms 616900 KB Output is correct
36 Correct 271 ms 612924 KB Output is correct
37 Correct 281 ms 612840 KB Output is correct
38 Correct 243 ms 612712 KB Output is correct
39 Correct 945 ms 630140 KB Output is correct
40 Correct 264 ms 613184 KB Output is correct
41 Correct 272 ms 618244 KB Output is correct
42 Correct 330 ms 613696 KB Output is correct
43 Correct 308 ms 616744 KB Output is correct
44 Correct 345 ms 623236 KB Output is correct
45 Correct 402 ms 622984 KB Output is correct
46 Correct 584 ms 636336 KB Output is correct
47 Correct 764 ms 630096 KB Output is correct
48 Correct 767 ms 630060 KB Output is correct
49 Correct 865 ms 671008 KB Output is correct
50 Correct 860 ms 671060 KB Output is correct
51 Correct 619 ms 630312 KB Output is correct
52 Correct 515 ms 630164 KB Output is correct
53 Correct 796 ms 630096 KB Output is correct
54 Correct 246 ms 610768 KB Output is correct
55 Correct 270 ms 610860 KB Output is correct
56 Correct 325 ms 610772 KB Output is correct
57 Correct 259 ms 610824 KB Output is correct
58 Correct 258 ms 610880 KB Output is correct
59 Correct 244 ms 610764 KB Output is correct
60 Correct 254 ms 610764 KB Output is correct
61 Correct 257 ms 610832 KB Output is correct
62 Correct 261 ms 610888 KB Output is correct
63 Correct 244 ms 610776 KB Output is correct
64 Correct 263 ms 610844 KB Output is correct
65 Correct 263 ms 610816 KB Output is correct
66 Correct 269 ms 610884 KB Output is correct
67 Correct 275 ms 610828 KB Output is correct
68 Correct 252 ms 610912 KB Output is correct
69 Correct 250 ms 610916 KB Output is correct
70 Correct 257 ms 610900 KB Output is correct
71 Correct 256 ms 610864 KB Output is correct
72 Correct 282 ms 610900 KB Output is correct
73 Incorrect 250 ms 610872 KB Output isn't correct
74 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 292 ms 610952 KB Output is correct
2 Correct 256 ms 610812 KB Output is correct
3 Correct 243 ms 610884 KB Output is correct
4 Correct 253 ms 610888 KB Output is correct
5 Correct 242 ms 610876 KB Output is correct
6 Correct 247 ms 610952 KB Output is correct
7 Correct 240 ms 610912 KB Output is correct
8 Correct 243 ms 610824 KB Output is correct
9 Correct 254 ms 610764 KB Output is correct
10 Correct 254 ms 610784 KB Output is correct
11 Correct 243 ms 610868 KB Output is correct
12 Correct 246 ms 610912 KB Output is correct
13 Correct 244 ms 610760 KB Output is correct
14 Correct 242 ms 610796 KB Output is correct
15 Correct 247 ms 610896 KB Output is correct
16 Correct 241 ms 610784 KB Output is correct
17 Correct 279 ms 610876 KB Output is correct
18 Correct 242 ms 610772 KB Output is correct
19 Correct 273 ms 611664 KB Output is correct
20 Correct 259 ms 612692 KB Output is correct
21 Correct 252 ms 611828 KB Output is correct
22 Correct 257 ms 611628 KB Output is correct
23 Correct 260 ms 611528 KB Output is correct
24 Correct 261 ms 613220 KB Output is correct
25 Correct 256 ms 613172 KB Output is correct
26 Correct 246 ms 611644 KB Output is correct
27 Correct 252 ms 611644 KB Output is correct
28 Correct 274 ms 611644 KB Output is correct
29 Correct 296 ms 612684 KB Output is correct
30 Correct 273 ms 612344 KB Output is correct
31 Correct 258 ms 613132 KB Output is correct
32 Correct 290 ms 612816 KB Output is correct
33 Correct 303 ms 612748 KB Output is correct
34 Correct 303 ms 616908 KB Output is correct
35 Correct 289 ms 616900 KB Output is correct
36 Correct 271 ms 612924 KB Output is correct
37 Correct 281 ms 612840 KB Output is correct
38 Correct 243 ms 612712 KB Output is correct
39 Correct 945 ms 630140 KB Output is correct
40 Correct 264 ms 613184 KB Output is correct
41 Correct 272 ms 618244 KB Output is correct
42 Correct 330 ms 613696 KB Output is correct
43 Correct 308 ms 616744 KB Output is correct
44 Correct 345 ms 623236 KB Output is correct
45 Correct 402 ms 622984 KB Output is correct
46 Correct 584 ms 636336 KB Output is correct
47 Correct 764 ms 630096 KB Output is correct
48 Correct 767 ms 630060 KB Output is correct
49 Correct 865 ms 671008 KB Output is correct
50 Correct 860 ms 671060 KB Output is correct
51 Correct 619 ms 630312 KB Output is correct
52 Correct 515 ms 630164 KB Output is correct
53 Correct 796 ms 630096 KB Output is correct
54 Correct 246 ms 610768 KB Output is correct
55 Correct 270 ms 610860 KB Output is correct
56 Correct 325 ms 610772 KB Output is correct
57 Correct 259 ms 610824 KB Output is correct
58 Correct 258 ms 610880 KB Output is correct
59 Correct 244 ms 610764 KB Output is correct
60 Correct 254 ms 610764 KB Output is correct
61 Correct 257 ms 610832 KB Output is correct
62 Correct 261 ms 610888 KB Output is correct
63 Correct 244 ms 610776 KB Output is correct
64 Correct 263 ms 610844 KB Output is correct
65 Correct 263 ms 610816 KB Output is correct
66 Correct 269 ms 610884 KB Output is correct
67 Correct 275 ms 610828 KB Output is correct
68 Correct 252 ms 610912 KB Output is correct
69 Correct 250 ms 610916 KB Output is correct
70 Correct 257 ms 610900 KB Output is correct
71 Correct 256 ms 610864 KB Output is correct
72 Correct 282 ms 610900 KB Output is correct
73 Incorrect 250 ms 610872 KB Output isn't correct
74 Halted 0 ms 0 KB -