oj.uz

답안 #780305

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780305 2023-07-12T08:06:39 Z boris_mihov Maze (JOI23_ho_t3) C++17
27 / 100
 613 ms 1138972 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)
    {
        assert(pos >= 1 && pos < (int)tree.size());
        for (int idx = pos ; idx < (int)tree.size() ; idx += idx & (-idx))
        {
            tree[idx] += value;
        }
    }

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

        return pos - res;
    }

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

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

        // if (l != idx)
        // {
        //     std::cout << "bad: " << l << ' ' << idx << '\n' << std::flush;
        // }
        // assert(l == idx);
        return r;
    }
};

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;
    //     }

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

    for (int i = colL ; i <= colR ; ++i)
    {
        if (dist[row][i] == INF)
        {
            if (byROW[row].findKth(curr + 1) != i)
            {
                // assert(false);
                int res = byROW[row].findKth(curr + 1); assert(res != i);
                // // assert(byROW[row].query(res) - byROW[row].query(res - 1) == 1);
                // bool was = (res > i);
                assert(res >= 1 && res <= c);
                // while ((res < i) || (res > i));
                while (res < i);
                while (res > i);
                // assert(res == byROW[row].findKth(curr + 1));
                // assert(res != i && (res > i) == was);
                // // while (true) assert((res > i) == was);
            }

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

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;
    //     }

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

    for (int i = rowL ; i <= rowR ; ++i)
    {
        if (dist[i][col] == INF)
        {
            if (byCOL[col].findKth(curr + 1) != i)
            {
                // assert(false);
                int res = byCOL[col].findKth(curr + 1); assert(res != i);
                // // assert(byCOL[col].query(res) - byCOL[col].query(res - 1) == 1);
                // bool was = (res > i);
                while (res < i){}
                while (res > i){}
                // assert(res != i && (res > i) == was);
                // // while (true) assert((res > i) == was);
            }

            setCELL(i, col);
            dist[i][col] = currDist + 1;
            dq.push_back({i, 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;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 610760 KB Output is correct
2 Correct 275 ms 610764 KB Output is correct
3 Correct 257 ms 610788 KB Output is correct
4 Correct 247 ms 610768 KB Output is correct
5 Correct 245 ms 610880 KB Output is correct
6 Correct 249 ms 610880 KB Output is correct
7 Correct 250 ms 610832 KB Output is correct
8 Correct 247 ms 610904 KB Output is correct
9 Correct 252 ms 610880 KB Output is correct
10 Correct 252 ms 610864 KB Output is correct
11 Correct 254 ms 610864 KB Output is correct
12 Correct 249 ms 610788 KB Output is correct
13 Correct 251 ms 610876 KB Output is correct
14 Correct 250 ms 610868 KB Output is correct
15 Correct 268 ms 610764 KB Output is correct
16 Correct 289 ms 610788 KB Output is correct
17 Correct 251 ms 610872 KB Output is correct
18 Correct 249 ms 610884 KB Output is correct
19 Correct 263 ms 611588 KB Output is correct
20 Correct 261 ms 612676 KB Output is correct
21 Correct 257 ms 611840 KB Output is correct
22 Correct 262 ms 611648 KB Output is correct
23 Correct 259 ms 611704 KB Output is correct
24 Correct 254 ms 613264 KB Output is correct
25 Correct 256 ms 613232 KB Output is correct
26 Correct 253 ms 611640 KB Output is correct
27 Correct 256 ms 611832 KB Output is correct
28 Correct 252 ms 611600 KB Output is correct
29 Correct 280 ms 612812 KB Output is correct
30 Correct 260 ms 612428 KB Output is correct
31 Correct 263 ms 613100 KB Output is correct
32 Correct 268 ms 612952 KB Output is correct
33 Correct 284 ms 612844 KB Output is correct
34 Correct 261 ms 617020 KB Output is correct
35 Correct 269 ms 617036 KB Output is correct
36 Correct 261 ms 612956 KB Output is correct
37 Correct 265 ms 612956 KB Output is correct
38 Correct 260 ms 613040 KB Output is correct
39 Correct 552 ms 630320 KB Output is correct
40 Correct 258 ms 613324 KB Output is correct
41 Correct 261 ms 618376 KB Output is correct
42 Correct 287 ms 613708 KB Output is correct
43 Correct 271 ms 616920 KB Output is correct
44 Correct 295 ms 623488 KB Output is correct
45 Correct 299 ms 623128 KB Output is correct
46 Correct 365 ms 636492 KB Output is correct
47 Correct 484 ms 630352 KB Output is correct
48 Correct 484 ms 630324 KB Output is correct
49 Correct 374 ms 671276 KB Output is correct
50 Correct 381 ms 671276 KB Output is correct
51 Correct 467 ms 630452 KB Output is correct
52 Correct 364 ms 630420 KB Output is correct
53 Correct 487 ms 630312 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 610800 KB Output is correct
2 Correct 264 ms 610752 KB Output is correct
3 Correct 246 ms 610764 KB Output is correct
4 Correct 247 ms 610776 KB Output is correct
5 Correct 251 ms 610832 KB Output is correct
6 Correct 250 ms 610740 KB Output is correct
7 Correct 251 ms 610864 KB Output is correct
8 Correct 258 ms 610780 KB Output is correct
9 Correct 254 ms 610768 KB Output is correct
10 Correct 284 ms 610880 KB Output is correct
11 Correct 255 ms 610764 KB Output is correct
12 Correct 253 ms 610880 KB Output is correct
13 Correct 251 ms 610880 KB Output is correct
14 Correct 248 ms 610804 KB Output is correct
15 Correct 249 ms 610908 KB Output is correct
16 Correct 247 ms 610852 KB Output is correct
17 Correct 265 ms 610888 KB Output is correct
18 Correct 264 ms 610832 KB Output is correct
19 Correct 271 ms 610880 KB Output is correct
20 Correct 286 ms 610832 KB Output is correct
21 Correct 261 ms 610848 KB Output is correct
22 Correct 252 ms 610880 KB Output is correct
23 Correct 272 ms 610864 KB Output is correct
24 Correct 250 ms 610744 KB Output is correct
25 Correct 252 ms 610764 KB Output is correct
26 Correct 255 ms 610788 KB Output is correct
27 Correct 253 ms 610872 KB Output is correct
28 Correct 251 ms 610852 KB Output is correct
29 Correct 250 ms 611084 KB Output is correct
30 Correct 251 ms 610792 KB Output is correct
31 Correct 254 ms 610880 KB Output is correct
32 Correct 265 ms 610768 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 610864 KB Output is correct
2 Correct 250 ms 610828 KB Output is correct
3 Correct 255 ms 610864 KB Output is correct
4 Correct 263 ms 610832 KB Output is correct
5 Correct 251 ms 610852 KB Output is correct
6 Correct 257 ms 610772 KB Output is correct
7 Correct 251 ms 610800 KB Output is correct
8 Correct 273 ms 610880 KB Output is correct
9 Correct 253 ms 610880 KB Output is correct
10 Correct 271 ms 610876 KB Output is correct
11 Correct 257 ms 610880 KB Output is correct
12 Correct 257 ms 610804 KB Output is correct
13 Correct 256 ms 610852 KB Output is correct
14 Correct 253 ms 610880 KB Output is correct
15 Correct 253 ms 610872 KB Output is correct
16 Correct 252 ms 610880 KB Output is correct
17 Correct 250 ms 610812 KB Output is correct
18 Correct 250 ms 610760 KB Output is correct
19 Correct 253 ms 610752 KB Output is correct
20 Correct 251 ms 610864 KB Output is correct
21 Correct 291 ms 610880 KB Output is correct
22 Correct 257 ms 610760 KB Output is correct
23 Correct 253 ms 610764 KB Output is correct
24 Correct 255 ms 610792 KB Output is correct
25 Correct 251 ms 611412 KB Output is correct
26 Runtime error 613 ms 1138972 KB Execution killed with signal 6
27 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 610800 KB Output is correct
2 Correct 264 ms 610752 KB Output is correct
3 Correct 246 ms 610764 KB Output is correct
4 Correct 247 ms 610776 KB Output is correct
5 Correct 251 ms 610832 KB Output is correct
6 Correct 250 ms 610740 KB Output is correct
7 Correct 251 ms 610864 KB Output is correct
8 Correct 258 ms 610780 KB Output is correct
9 Correct 254 ms 610768 KB Output is correct
10 Correct 284 ms 610880 KB Output is correct
11 Correct 255 ms 610764 KB Output is correct
12 Correct 253 ms 610880 KB Output is correct
13 Correct 251 ms 610880 KB Output is correct
14 Correct 248 ms 610804 KB Output is correct
15 Correct 249 ms 610908 KB Output is correct
16 Correct 247 ms 610852 KB Output is correct
17 Correct 265 ms 610888 KB Output is correct
18 Correct 264 ms 610832 KB Output is correct
19 Correct 271 ms 610880 KB Output is correct
20 Correct 286 ms 610832 KB Output is correct
21 Correct 261 ms 610848 KB Output is correct
22 Correct 252 ms 610880 KB Output is correct
23 Correct 272 ms 610864 KB Output is correct
24 Correct 250 ms 610744 KB Output is correct
25 Correct 252 ms 610764 KB Output is correct
26 Correct 255 ms 610788 KB Output is correct
27 Correct 253 ms 610872 KB Output is correct
28 Correct 251 ms 610852 KB Output is correct
29 Correct 250 ms 611084 KB Output is correct
30 Correct 251 ms 610792 KB Output is correct
31 Correct 254 ms 610880 KB Output is correct
32 Correct 265 ms 610768 KB Output is correct
33 Correct 262 ms 611648 KB Output is correct
34 Correct 261 ms 610784 KB Output is correct
35 Correct 255 ms 610888 KB Output is correct
36 Correct 257 ms 611380 KB Output is correct
37 Correct 258 ms 612676 KB Output is correct
38 Runtime error 586 ms 1138872 KB Execution killed with signal 6
39 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 610800 KB Output is correct
2 Correct 264 ms 610752 KB Output is correct
3 Correct 246 ms 610764 KB Output is correct
4 Correct 247 ms 610776 KB Output is correct
5 Correct 251 ms 610832 KB Output is correct
6 Correct 250 ms 610740 KB Output is correct
7 Correct 251 ms 610864 KB Output is correct
8 Correct 258 ms 610780 KB Output is correct
9 Correct 254 ms 610768 KB Output is correct
10 Correct 284 ms 610880 KB Output is correct
11 Correct 255 ms 610764 KB Output is correct
12 Correct 253 ms 610880 KB Output is correct
13 Correct 251 ms 610880 KB Output is correct
14 Correct 248 ms 610804 KB Output is correct
15 Correct 249 ms 610908 KB Output is correct
16 Correct 247 ms 610852 KB Output is correct
17 Correct 265 ms 610888 KB Output is correct
18 Correct 264 ms 610832 KB Output is correct
19 Correct 271 ms 610880 KB Output is correct
20 Correct 286 ms 610832 KB Output is correct
21 Correct 261 ms 610848 KB Output is correct
22 Correct 252 ms 610880 KB Output is correct
23 Correct 272 ms 610864 KB Output is correct
24 Correct 250 ms 610744 KB Output is correct
25 Correct 252 ms 610764 KB Output is correct
26 Correct 255 ms 610788 KB Output is correct
27 Correct 253 ms 610872 KB Output is correct
28 Correct 251 ms 610852 KB Output is correct
29 Correct 250 ms 611084 KB Output is correct
30 Correct 251 ms 610792 KB Output is correct
31 Correct 254 ms 610880 KB Output is correct
32 Correct 265 ms 610768 KB Output is correct
33 Correct 262 ms 611648 KB Output is correct
34 Correct 261 ms 610784 KB Output is correct
35 Correct 255 ms 610888 KB Output is correct
36 Correct 257 ms 611380 KB Output is correct
37 Correct 258 ms 612676 KB Output is correct
38 Runtime error 586 ms 1138872 KB Execution killed with signal 6
39 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 610760 KB Output is correct
2 Correct 275 ms 610764 KB Output is correct
3 Correct 257 ms 610788 KB Output is correct
4 Correct 247 ms 610768 KB Output is correct
5 Correct 245 ms 610880 KB Output is correct
6 Correct 249 ms 610880 KB Output is correct
7 Correct 250 ms 610832 KB Output is correct
8 Correct 247 ms 610904 KB Output is correct
9 Correct 252 ms 610880 KB Output is correct
10 Correct 252 ms 610864 KB Output is correct
11 Correct 254 ms 610864 KB Output is correct
12 Correct 249 ms 610788 KB Output is correct
13 Correct 251 ms 610876 KB Output is correct
14 Correct 250 ms 610868 KB Output is correct
15 Correct 268 ms 610764 KB Output is correct
16 Correct 289 ms 610788 KB Output is correct
17 Correct 251 ms 610872 KB Output is correct
18 Correct 249 ms 610884 KB Output is correct
19 Correct 263 ms 611588 KB Output is correct
20 Correct 261 ms 612676 KB Output is correct
21 Correct 257 ms 611840 KB Output is correct
22 Correct 262 ms 611648 KB Output is correct
23 Correct 259 ms 611704 KB Output is correct
24 Correct 254 ms 613264 KB Output is correct
25 Correct 256 ms 613232 KB Output is correct
26 Correct 253 ms 611640 KB Output is correct
27 Correct 256 ms 611832 KB Output is correct
28 Correct 252 ms 611600 KB Output is correct
29 Correct 280 ms 612812 KB Output is correct
30 Correct 260 ms 612428 KB Output is correct
31 Correct 263 ms 613100 KB Output is correct
32 Correct 268 ms 612952 KB Output is correct
33 Correct 284 ms 612844 KB Output is correct
34 Correct 261 ms 617020 KB Output is correct
35 Correct 269 ms 617036 KB Output is correct
36 Correct 261 ms 612956 KB Output is correct
37 Correct 265 ms 612956 KB Output is correct
38 Correct 260 ms 613040 KB Output is correct
39 Correct 552 ms 630320 KB Output is correct
40 Correct 258 ms 613324 KB Output is correct
41 Correct 261 ms 618376 KB Output is correct
42 Correct 287 ms 613708 KB Output is correct
43 Correct 271 ms 616920 KB Output is correct
44 Correct 295 ms 623488 KB Output is correct
45 Correct 299 ms 623128 KB Output is correct
46 Correct 365 ms 636492 KB Output is correct
47 Correct 484 ms 630352 KB Output is correct
48 Correct 484 ms 630324 KB Output is correct
49 Correct 374 ms 671276 KB Output is correct
50 Correct 381 ms 671276 KB Output is correct
51 Correct 467 ms 630452 KB Output is correct
52 Correct 364 ms 630420 KB Output is correct
53 Correct 487 ms 630312 KB Output is correct
54 Correct 255 ms 610800 KB Output is correct
55 Correct 264 ms 610752 KB Output is correct
56 Correct 246 ms 610764 KB Output is correct
57 Correct 247 ms 610776 KB Output is correct
58 Correct 251 ms 610832 KB Output is correct
59 Correct 250 ms 610740 KB Output is correct
60 Correct 251 ms 610864 KB Output is correct
61 Correct 258 ms 610780 KB Output is correct
62 Correct 254 ms 610768 KB Output is correct
63 Correct 284 ms 610880 KB Output is correct
64 Correct 255 ms 610764 KB Output is correct
65 Correct 253 ms 610880 KB Output is correct
66 Correct 251 ms 610880 KB Output is correct
67 Correct 248 ms 610804 KB Output is correct
68 Correct 249 ms 610908 KB Output is correct
69 Correct 247 ms 610852 KB Output is correct
70 Correct 265 ms 610888 KB Output is correct
71 Correct 264 ms 610832 KB Output is correct
72 Correct 271 ms 610880 KB Output is correct
73 Correct 286 ms 610832 KB Output is correct
74 Correct 261 ms 610848 KB Output is correct
75 Correct 252 ms 610880 KB Output is correct
76 Correct 272 ms 610864 KB Output is correct
77 Correct 250 ms 610744 KB Output is correct
78 Correct 252 ms 610764 KB Output is correct
79 Correct 255 ms 610788 KB Output is correct
80 Correct 253 ms 610872 KB Output is correct
81 Correct 251 ms 610852 KB Output is correct
82 Correct 250 ms 611084 KB Output is correct
83 Correct 251 ms 610792 KB Output is correct
84 Correct 254 ms 610880 KB Output is correct
85 Correct 265 ms 610768 KB Output is correct
86 Correct 251 ms 610864 KB Output is correct
87 Correct 250 ms 610828 KB Output is correct
88 Correct 255 ms 610864 KB Output is correct
89 Correct 263 ms 610832 KB Output is correct
90 Correct 251 ms 610852 KB Output is correct
91 Correct 257 ms 610772 KB Output is correct
92 Correct 251 ms 610800 KB Output is correct
93 Correct 273 ms 610880 KB Output is correct
94 Correct 253 ms 610880 KB Output is correct
95 Correct 271 ms 610876 KB Output is correct
96 Correct 257 ms 610880 KB Output is correct
97 Correct 257 ms 610804 KB Output is correct
98 Correct 256 ms 610852 KB Output is correct
99 Correct 253 ms 610880 KB Output is correct
100 Correct 253 ms 610872 KB Output is correct
101 Correct 252 ms 610880 KB Output is correct
102 Correct 250 ms 610812 KB Output is correct
103 Correct 250 ms 610760 KB Output is correct
104 Correct 253 ms 610752 KB Output is correct
105 Correct 251 ms 610864 KB Output is correct
106 Correct 291 ms 610880 KB Output is correct
107 Correct 257 ms 610760 KB Output is correct
108 Correct 253 ms 610764 KB Output is correct
109 Correct 255 ms 610792 KB Output is correct
110 Correct 251 ms 611412 KB Output is correct
111 Runtime error 613 ms 1138972 KB Execution killed with signal 6
112 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 610760 KB Output is correct
2 Correct 275 ms 610764 KB Output is correct
3 Correct 257 ms 610788 KB Output is correct
4 Correct 247 ms 610768 KB Output is correct
5 Correct 245 ms 610880 KB Output is correct
6 Correct 249 ms 610880 KB Output is correct
7 Correct 250 ms 610832 KB Output is correct
8 Correct 247 ms 610904 KB Output is correct
9 Correct 252 ms 610880 KB Output is correct
10 Correct 252 ms 610864 KB Output is correct
11 Correct 254 ms 610864 KB Output is correct
12 Correct 249 ms 610788 KB Output is correct
13 Correct 251 ms 610876 KB Output is correct
14 Correct 250 ms 610868 KB Output is correct
15 Correct 268 ms 610764 KB Output is correct
16 Correct 289 ms 610788 KB Output is correct
17 Correct 251 ms 610872 KB Output is correct
18 Correct 249 ms 610884 KB Output is correct
19 Correct 263 ms 611588 KB Output is correct
20 Correct 261 ms 612676 KB Output is correct
21 Correct 257 ms 611840 KB Output is correct
22 Correct 262 ms 611648 KB Output is correct
23 Correct 259 ms 611704 KB Output is correct
24 Correct 254 ms 613264 KB Output is correct
25 Correct 256 ms 613232 KB Output is correct
26 Correct 253 ms 611640 KB Output is correct
27 Correct 256 ms 611832 KB Output is correct
28 Correct 252 ms 611600 KB Output is correct
29 Correct 280 ms 612812 KB Output is correct
30 Correct 260 ms 612428 KB Output is correct
31 Correct 263 ms 613100 KB Output is correct
32 Correct 268 ms 612952 KB Output is correct
33 Correct 284 ms 612844 KB Output is correct
34 Correct 261 ms 617020 KB Output is correct
35 Correct 269 ms 617036 KB Output is correct
36 Correct 261 ms 612956 KB Output is correct
37 Correct 265 ms 612956 KB Output is correct
38 Correct 260 ms 613040 KB Output is correct
39 Correct 552 ms 630320 KB Output is correct
40 Correct 258 ms 613324 KB Output is correct
41 Correct 261 ms 618376 KB Output is correct
42 Correct 287 ms 613708 KB Output is correct
43 Correct 271 ms 616920 KB Output is correct
44 Correct 295 ms 623488 KB Output is correct
45 Correct 299 ms 623128 KB Output is correct
46 Correct 365 ms 636492 KB Output is correct
47 Correct 484 ms 630352 KB Output is correct
48 Correct 484 ms 630324 KB Output is correct
49 Correct 374 ms 671276 KB Output is correct
50 Correct 381 ms 671276 KB Output is correct
51 Correct 467 ms 630452 KB Output is correct
52 Correct 364 ms 630420 KB Output is correct
53 Correct 487 ms 630312 KB Output is correct
54 Correct 255 ms 610800 KB Output is correct
55 Correct 264 ms 610752 KB Output is correct
56 Correct 246 ms 610764 KB Output is correct
57 Correct 247 ms 610776 KB Output is correct
58 Correct 251 ms 610832 KB Output is correct
59 Correct 250 ms 610740 KB Output is correct
60 Correct 251 ms 610864 KB Output is correct
61 Correct 258 ms 610780 KB Output is correct
62 Correct 254 ms 610768 KB Output is correct
63 Correct 284 ms 610880 KB Output is correct
64 Correct 255 ms 610764 KB Output is correct
65 Correct 253 ms 610880 KB Output is correct
66 Correct 251 ms 610880 KB Output is correct
67 Correct 248 ms 610804 KB Output is correct
68 Correct 249 ms 610908 KB Output is correct
69 Correct 247 ms 610852 KB Output is correct
70 Correct 265 ms 610888 KB Output is correct
71 Correct 264 ms 610832 KB Output is correct
72 Correct 271 ms 610880 KB Output is correct
73 Correct 286 ms 610832 KB Output is correct
74 Correct 261 ms 610848 KB Output is correct
75 Correct 252 ms 610880 KB Output is correct
76 Correct 272 ms 610864 KB Output is correct
77 Correct 250 ms 610744 KB Output is correct
78 Correct 252 ms 610764 KB Output is correct
79 Correct 255 ms 610788 KB Output is correct
80 Correct 253 ms 610872 KB Output is correct
81 Correct 251 ms 610852 KB Output is correct
82 Correct 250 ms 611084 KB Output is correct
83 Correct 251 ms 610792 KB Output is correct
84 Correct 254 ms 610880 KB Output is correct
85 Correct 265 ms 610768 KB Output is correct
86 Correct 251 ms 610864 KB Output is correct
87 Correct 250 ms 610828 KB Output is correct
88 Correct 255 ms 610864 KB Output is correct
89 Correct 263 ms 610832 KB Output is correct
90 Correct 251 ms 610852 KB Output is correct
91 Correct 257 ms 610772 KB Output is correct
92 Correct 251 ms 610800 KB Output is correct
93 Correct 273 ms 610880 KB Output is correct
94 Correct 253 ms 610880 KB Output is correct
95 Correct 271 ms 610876 KB Output is correct
96 Correct 257 ms 610880 KB Output is correct
97 Correct 257 ms 610804 KB Output is correct
98 Correct 256 ms 610852 KB Output is correct
99 Correct 253 ms 610880 KB Output is correct
100 Correct 253 ms 610872 KB Output is correct
101 Correct 252 ms 610880 KB Output is correct
102 Correct 250 ms 610812 KB Output is correct
103 Correct 250 ms 610760 KB Output is correct
104 Correct 253 ms 610752 KB Output is correct
105 Correct 251 ms 610864 KB Output is correct
106 Correct 291 ms 610880 KB Output is correct
107 Correct 257 ms 610760 KB Output is correct
108 Correct 253 ms 610764 KB Output is correct
109 Correct 255 ms 610792 KB Output is correct
110 Correct 251 ms 611412 KB Output is correct
111 Runtime error 613 ms 1138972 KB Execution killed with signal 6
112 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 610760 KB Output is correct
2 Correct 275 ms 610764 KB Output is correct
3 Correct 257 ms 610788 KB Output is correct
4 Correct 247 ms 610768 KB Output is correct
5 Correct 245 ms 610880 KB Output is correct
6 Correct 249 ms 610880 KB Output is correct
7 Correct 250 ms 610832 KB Output is correct
8 Correct 247 ms 610904 KB Output is correct
9 Correct 252 ms 610880 KB Output is correct
10 Correct 252 ms 610864 KB Output is correct
11 Correct 254 ms 610864 KB Output is correct
12 Correct 249 ms 610788 KB Output is correct
13 Correct 251 ms 610876 KB Output is correct
14 Correct 250 ms 610868 KB Output is correct
15 Correct 268 ms 610764 KB Output is correct
16 Correct 289 ms 610788 KB Output is correct
17 Correct 251 ms 610872 KB Output is correct
18 Correct 249 ms 610884 KB Output is correct
19 Correct 263 ms 611588 KB Output is correct
20 Correct 261 ms 612676 KB Output is correct
21 Correct 257 ms 611840 KB Output is correct
22 Correct 262 ms 611648 KB Output is correct
23 Correct 259 ms 611704 KB Output is correct
24 Correct 254 ms 613264 KB Output is correct
25 Correct 256 ms 613232 KB Output is correct
26 Correct 253 ms 611640 KB Output is correct
27 Correct 256 ms 611832 KB Output is correct
28 Correct 252 ms 611600 KB Output is correct
29 Correct 280 ms 612812 KB Output is correct
30 Correct 260 ms 612428 KB Output is correct
31 Correct 263 ms 613100 KB Output is correct
32 Correct 268 ms 612952 KB Output is correct
33 Correct 284 ms 612844 KB Output is correct
34 Correct 261 ms 617020 KB Output is correct
35 Correct 269 ms 617036 KB Output is correct
36 Correct 261 ms 612956 KB Output is correct
37 Correct 265 ms 612956 KB Output is correct
38 Correct 260 ms 613040 KB Output is correct
39 Correct 552 ms 630320 KB Output is correct
40 Correct 258 ms 613324 KB Output is correct
41 Correct 261 ms 618376 KB Output is correct
42 Correct 287 ms 613708 KB Output is correct
43 Correct 271 ms 616920 KB Output is correct
44 Correct 295 ms 623488 KB Output is correct
45 Correct 299 ms 623128 KB Output is correct
46 Correct 365 ms 636492 KB Output is correct
47 Correct 484 ms 630352 KB Output is correct
48 Correct 484 ms 630324 KB Output is correct
49 Correct 374 ms 671276 KB Output is correct
50 Correct 381 ms 671276 KB Output is correct
51 Correct 467 ms 630452 KB Output is correct
52 Correct 364 ms 630420 KB Output is correct
53 Correct 487 ms 630312 KB Output is correct
54 Correct 255 ms 610800 KB Output is correct
55 Correct 264 ms 610752 KB Output is correct
56 Correct 246 ms 610764 KB Output is correct
57 Correct 247 ms 610776 KB Output is correct
58 Correct 251 ms 610832 KB Output is correct
59 Correct 250 ms 610740 KB Output is correct
60 Correct 251 ms 610864 KB Output is correct
61 Correct 258 ms 610780 KB Output is correct
62 Correct 254 ms 610768 KB Output is correct
63 Correct 284 ms 610880 KB Output is correct
64 Correct 255 ms 610764 KB Output is correct
65 Correct 253 ms 610880 KB Output is correct
66 Correct 251 ms 610880 KB Output is correct
67 Correct 248 ms 610804 KB Output is correct
68 Correct 249 ms 610908 KB Output is correct
69 Correct 247 ms 610852 KB Output is correct
70 Correct 265 ms 610888 KB Output is correct
71 Correct 264 ms 610832 KB Output is correct
72 Correct 271 ms 610880 KB Output is correct
73 Correct 286 ms 610832 KB Output is correct
74 Correct 261 ms 610848 KB Output is correct
75 Correct 252 ms 610880 KB Output is correct
76 Correct 272 ms 610864 KB Output is correct
77 Correct 250 ms 610744 KB Output is correct
78 Correct 252 ms 610764 KB Output is correct
79 Correct 255 ms 610788 KB Output is correct
80 Correct 253 ms 610872 KB Output is correct
81 Correct 251 ms 610852 KB Output is correct
82 Correct 250 ms 611084 KB Output is correct
83 Correct 251 ms 610792 KB Output is correct
84 Correct 254 ms 610880 KB Output is correct
85 Correct 265 ms 610768 KB Output is correct
86 Correct 251 ms 610864 KB Output is correct
87 Correct 250 ms 610828 KB Output is correct
88 Correct 255 ms 610864 KB Output is correct
89 Correct 263 ms 610832 KB Output is correct
90 Correct 251 ms 610852 KB Output is correct
91 Correct 257 ms 610772 KB Output is correct
92 Correct 251 ms 610800 KB Output is correct
93 Correct 273 ms 610880 KB Output is correct
94 Correct 253 ms 610880 KB Output is correct
95 Correct 271 ms 610876 KB Output is correct
96 Correct 257 ms 610880 KB Output is correct
97 Correct 257 ms 610804 KB Output is correct
98 Correct 256 ms 610852 KB Output is correct
99 Correct 253 ms 610880 KB Output is correct
100 Correct 253 ms 610872 KB Output is correct
101 Correct 252 ms 610880 KB Output is correct
102 Correct 250 ms 610812 KB Output is correct
103 Correct 250 ms 610760 KB Output is correct
104 Correct 253 ms 610752 KB Output is correct
105 Correct 251 ms 610864 KB Output is correct
106 Correct 291 ms 610880 KB Output is correct
107 Correct 257 ms 610760 KB Output is correct
108 Correct 253 ms 610764 KB Output is correct
109 Correct 255 ms 610792 KB Output is correct
110 Correct 251 ms 611412 KB Output is correct
111 Runtime error 613 ms 1138972 KB Execution killed with signal 6
112 Halted 0 ms 0 KB -