oj.uz

Submission #780266

# Submission time Handle Problem Language Result Execution time Memory
780266 2023-07-12T07:47:01 Z boris_mihov Maze (JOI23_ho_t3) C++17
0 / 100
 1106 ms 1082876 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 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;
    //     }

    //     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)
            {
                int res = byROW[row].findKth(curr + 1); assert(res != i);
                // assert(byROW[row].query(res) - byROW[row].query(res - 1) == 1);
                while (res < i){assert(true);}
                while (res > i){assert(true);}
                assert(false);
            }

            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)
            {
                int res = byCOL[col].findKth(curr + 1); assert(res != i);
                // assert(byCOL[col].query(res) - byCOL[col].query(res - 1) == 1);
                while (res < i){assert(false);}
                while (res > i){assert(false);}
            }

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

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:45:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             if (idx + (1 << log) < tree.size() && (1 << log) - tree[idx + (1 << log)] < k)
      |                 ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 610868 KB Output is correct
2 Correct 284 ms 610868 KB Output is correct
3 Correct 278 ms 610884 KB Output is correct
4 Correct 288 ms 610888 KB Output is correct
5 Correct 281 ms 610876 KB Output is correct
6 Correct 306 ms 610872 KB Output is correct
7 Correct 283 ms 610928 KB Output is correct
8 Correct 278 ms 610908 KB Output is correct
9 Correct 278 ms 610824 KB Output is correct
10 Correct 279 ms 610904 KB Output is correct
11 Runtime error 1106 ms 990340 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 610836 KB Output is correct
2 Correct 302 ms 610864 KB Output is correct
3 Correct 328 ms 610864 KB Output is correct
4 Correct 307 ms 610868 KB Output is correct
5 Correct 316 ms 610876 KB Output is correct
6 Correct 304 ms 610872 KB Output is correct
7 Correct 300 ms 610788 KB Output is correct
8 Correct 316 ms 610864 KB Output is correct
9 Correct 295 ms 610764 KB Output is correct
10 Correct 325 ms 610764 KB Output is correct
11 Correct 302 ms 610880 KB Output is correct
12 Correct 301 ms 610772 KB Output is correct
13 Correct 314 ms 610840 KB Output is correct
14 Correct 311 ms 610848 KB Output is correct
15 Correct 297 ms 610900 KB Output is correct
16 Correct 315 ms 611008 KB Output is correct
17 Correct 297 ms 610820 KB Output is correct
18 Correct 303 ms 610804 KB Output is correct
19 Runtime error 697 ms 1059936 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 610784 KB Output is correct
2 Correct 301 ms 610860 KB Output is correct
3 Correct 313 ms 610984 KB Output is correct
4 Correct 310 ms 610984 KB Output is correct
5 Correct 305 ms 610820 KB Output is correct
6 Correct 303 ms 610864 KB Output is correct
7 Correct 303 ms 610776 KB Output is correct
8 Correct 313 ms 610880 KB Output is correct
9 Correct 308 ms 610880 KB Output is correct
10 Correct 328 ms 610880 KB Output is correct
11 Correct 306 ms 610764 KB Output is correct
12 Correct 308 ms 610840 KB Output is correct
13 Correct 305 ms 610864 KB Output is correct
14 Runtime error 686 ms 1082876 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 610836 KB Output is correct
2 Correct 302 ms 610864 KB Output is correct
3 Correct 328 ms 610864 KB Output is correct
4 Correct 307 ms 610868 KB Output is correct
5 Correct 316 ms 610876 KB Output is correct
6 Correct 304 ms 610872 KB Output is correct
7 Correct 300 ms 610788 KB Output is correct
8 Correct 316 ms 610864 KB Output is correct
9 Correct 295 ms 610764 KB Output is correct
10 Correct 325 ms 610764 KB Output is correct
11 Correct 302 ms 610880 KB Output is correct
12 Correct 301 ms 610772 KB Output is correct
13 Correct 314 ms 610840 KB Output is correct
14 Correct 311 ms 610848 KB Output is correct
15 Correct 297 ms 610900 KB Output is correct
16 Correct 315 ms 611008 KB Output is correct
17 Correct 297 ms 610820 KB Output is correct
18 Correct 303 ms 610804 KB Output is correct
19 Runtime error 697 ms 1059936 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 610836 KB Output is correct
2 Correct 302 ms 610864 KB Output is correct
3 Correct 328 ms 610864 KB Output is correct
4 Correct 307 ms 610868 KB Output is correct
5 Correct 316 ms 610876 KB Output is correct
6 Correct 304 ms 610872 KB Output is correct
7 Correct 300 ms 610788 KB Output is correct
8 Correct 316 ms 610864 KB Output is correct
9 Correct 295 ms 610764 KB Output is correct
10 Correct 325 ms 610764 KB Output is correct
11 Correct 302 ms 610880 KB Output is correct
12 Correct 301 ms 610772 KB Output is correct
13 Correct 314 ms 610840 KB Output is correct
14 Correct 311 ms 610848 KB Output is correct
15 Correct 297 ms 610900 KB Output is correct
16 Correct 315 ms 611008 KB Output is correct
17 Correct 297 ms 610820 KB Output is correct
18 Correct 303 ms 610804 KB Output is correct
19 Runtime error 697 ms 1059936 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 610868 KB Output is correct
2 Correct 284 ms 610868 KB Output is correct
3 Correct 278 ms 610884 KB Output is correct
4 Correct 288 ms 610888 KB Output is correct
5 Correct 281 ms 610876 KB Output is correct
6 Correct 306 ms 610872 KB Output is correct
7 Correct 283 ms 610928 KB Output is correct
8 Correct 278 ms 610908 KB Output is correct
9 Correct 278 ms 610824 KB Output is correct
10 Correct 279 ms 610904 KB Output is correct
11 Runtime error 1106 ms 990340 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 610868 KB Output is correct
2 Correct 284 ms 610868 KB Output is correct
3 Correct 278 ms 610884 KB Output is correct
4 Correct 288 ms 610888 KB Output is correct
5 Correct 281 ms 610876 KB Output is correct
6 Correct 306 ms 610872 KB Output is correct
7 Correct 283 ms 610928 KB Output is correct
8 Correct 278 ms 610908 KB Output is correct
9 Correct 278 ms 610824 KB Output is correct
10 Correct 279 ms 610904 KB Output is correct
11 Runtime error 1106 ms 990340 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 610868 KB Output is correct
2 Correct 284 ms 610868 KB Output is correct
3 Correct 278 ms 610884 KB Output is correct
4 Correct 288 ms 610888 KB Output is correct
5 Correct 281 ms 610876 KB Output is correct
6 Correct 306 ms 610872 KB Output is correct
7 Correct 283 ms 610928 KB Output is correct
8 Correct 278 ms 610908 KB Output is correct
9 Correct 278 ms 610824 KB Output is correct
10 Correct 279 ms 610904 KB Output is correct
11 Runtime error 1106 ms 990340 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -