oj.uz

답안 #1105491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105491 2024-10-26T14:16:13 Z clams1606 Maze (JOI23_ho_t3) C++14
8 / 100
 179 ms 95116 KB 
#include <bits/stdc++.h>

#define _files
#define _multitest
#define _Debug_

using namespace std;

void just_do_it();

int main() {
    #define task ""
    #ifdef _files_
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    #endif
    #ifdef _Debug
        ios_base::sync_with_stdio(0);
    #endif
    cin.tie(0);
    just_do_it();
    return 0;
}

#define __builtin_popcount __builtin_popcountll
#define BIT(x, i) (((x)>> (i))& (1LL))
#define MASK(x) (1LL<< (x))
#define MOD 1000000007
#define ll long long

const int maxm= (int)1e6, maxn= (int)1e5, maxb= (int)1e3;

ll INF= (ll)1e18;

const int dx[]= {-1, 1,  0, 0};
const int dy[]= { 0, 0, -1, 1};

struct DSU{
    DSU(){}
    vector<int> f;
    void init(int n){
        f.resize(n+ 1);
        iota(f.begin(), f.end(), 0);
    }
    int lab(int u){
        while(u!= f[u]){
            u= f[u]= f[f[u]];
        }
        return u;
    }
    void mer(int u, int v){
        u= lab(u);
        v= lab(v);
        if(u!= v){
            f[v]= u;
        }
    }
};

struct state{
    state(){}
    int t, x, y;
    state(int _t, int _x, int _y){
        t= _t;
        x= _x;
        y= _y;
    }
};



vector<vector<char> > a;
vector<vector<bool> > vis;
vector<DSU> nxtr, nxtc;
pair<int, int> sta, en;
int r, c, n;
deque<state> st;

bool ok(int pr, int pc){
        return ((0< pr)&& (pr<= r)&& (0< pc)&& (pc<= c));
}

void input(){
    cin>> r>> c>> n>> sta.first>> sta.second>> en.first>> en.second;
    a.resize(r+ 3, vector<char> (c+ 3));
    vis.resize(r+ 3, vector<bool> (c+ 3));
    nxtr.resize(c+ 3);
    for(int i= 1; i<= c; i++){
        nxtr[i].init(r+ 3);
    }
    nxtc.resize(r+ 2);
    for(int i= 1; i<= r; i++){
        nxtc[i].init(c+ 3);
    }
    for(int i= 1; i<= r; i++){
        for(int j= 1; j<= c; j++){
            cin>> a[i][j];
        }
    }
}

void prepare(){

}

void solve(){
    st.push_back(state(0, sta.first, sta.second));
    while(st.size()){
        int t= st.front().t, pr= st.front().x, pc= st.front().y;st.pop_front();
        if((pr== en.first)&& (pc== en.second)){
            cout<< t;
            return;
        }
        if(vis[pr][pc]) continue;
        else vis[pr][pc]= true;
        for(int k= 0; k< 4; k++){
            int nr= pr+ dx[k], nc= pc+ dy[k];
            if(ok(nr, nc)&& (vis[nr][nc]== false)){
                if(a[nr][nc]== '.') st.push_front(state(t, nr, nc));
                else st.push_back(state(t+ 1, nr, nc));
            }
        }
        int mnr= max(pr- n+ 1, 1), mxr= min(pr+ n- 1, r), mnc= max(pc- n+ 1, 1), mxc= min(pc+ n- 1, c);
        if(a[pr][pc]== '#'){
            for(int i= nxtr[mnc].lab(mnr); i<= mxr; i= nxtr[mnc].lab(i+ 1)){
                for(int j= nxtc[i].lab(mnc); j<= mxc; j= nxtc[i].lab(j+ 1)){
                    st.push_back(state(t, i, j));
                    nxtc[i].mer(j+ 1, j);
                }
                nxtr[mnc].mer(i+ 1, i);
            }
        }
    }
}

void printans(){

}

void reset(){

}

void test(){
    input();
    prepare();
    solve();
    printans();
    reset();
}

void just_do_it() {
    int nTest= 1;
    #ifdef _multitest_
        cin>>nTest;
    #endif
    for (int it= 1; it <= nTest; it++) {
        test();
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 6 ms 848 KB Output is correct
20 Correct 6 ms 3320 KB Output is correct
21 Correct 3 ms 1540 KB Output is correct
22 Correct 6 ms 1024 KB Output is correct
23 Correct 8 ms 848 KB Output is correct
24 Correct 8 ms 4176 KB Output is correct
25 Correct 7 ms 4096 KB Output is correct
26 Correct 3 ms 848 KB Output is correct
27 Correct 2 ms 848 KB Output is correct
28 Correct 4 ms 848 KB Output is correct
29 Correct 12 ms 1872 KB Output is correct
30 Correct 7 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 15 ms 1944 KB Output is correct
33 Correct 11 ms 1872 KB Output is correct
34 Correct 17 ms 9812 KB Output is correct
35 Correct 18 ms 9916 KB Output is correct
36 Correct 13 ms 2128 KB Output is correct
37 Correct 12 ms 1872 KB Output is correct
38 Correct 5 ms 1872 KB Output is correct
39 Correct 133 ms 14136 KB Output is correct
40 Correct 8 ms 2552 KB Output is correct
41 Correct 20 ms 11928 KB Output is correct
42 Correct 19 ms 2384 KB Output is correct
43 Correct 23 ms 8700 KB Output is correct
44 Correct 39 ms 13136 KB Output is correct
45 Correct 56 ms 16304 KB Output is correct
46 Correct 70 ms 30204 KB Output is correct
47 Correct 139 ms 14156 KB Output is correct
48 Correct 104 ms 14072 KB Output is correct
49 Correct 160 ms 95116 KB Output is correct
50 Correct 179 ms 95116 KB Output is correct
51 Correct 102 ms 15436 KB Output is correct
52 Correct 78 ms 14588 KB Output is correct
53 Correct 123 ms 14152 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 6 ms 848 KB Output is correct
20 Correct 6 ms 3320 KB Output is correct
21 Correct 3 ms 1540 KB Output is correct
22 Correct 6 ms 1024 KB Output is correct
23 Correct 8 ms 848 KB Output is correct
24 Correct 8 ms 4176 KB Output is correct
25 Correct 7 ms 4096 KB Output is correct
26 Correct 3 ms 848 KB Output is correct
27 Correct 2 ms 848 KB Output is correct
28 Correct 4 ms 848 KB Output is correct
29 Correct 12 ms 1872 KB Output is correct
30 Correct 7 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 15 ms 1944 KB Output is correct
33 Correct 11 ms 1872 KB Output is correct
34 Correct 17 ms 9812 KB Output is correct
35 Correct 18 ms 9916 KB Output is correct
36 Correct 13 ms 2128 KB Output is correct
37 Correct 12 ms 1872 KB Output is correct
38 Correct 5 ms 1872 KB Output is correct
39 Correct 133 ms 14136 KB Output is correct
40 Correct 8 ms 2552 KB Output is correct
41 Correct 20 ms 11928 KB Output is correct
42 Correct 19 ms 2384 KB Output is correct
43 Correct 23 ms 8700 KB Output is correct
44 Correct 39 ms 13136 KB Output is correct
45 Correct 56 ms 16304 KB Output is correct
46 Correct 70 ms 30204 KB Output is correct
47 Correct 139 ms 14156 KB Output is correct
48 Correct 104 ms 14072 KB Output is correct
49 Correct 160 ms 95116 KB Output is correct
50 Correct 179 ms 95116 KB Output is correct
51 Correct 102 ms 15436 KB Output is correct
52 Correct 78 ms 14588 KB Output is correct
53 Correct 123 ms 14152 KB Output is correct
54 Incorrect 1 ms 336 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 6 ms 848 KB Output is correct
20 Correct 6 ms 3320 KB Output is correct
21 Correct 3 ms 1540 KB Output is correct
22 Correct 6 ms 1024 KB Output is correct
23 Correct 8 ms 848 KB Output is correct
24 Correct 8 ms 4176 KB Output is correct
25 Correct 7 ms 4096 KB Output is correct
26 Correct 3 ms 848 KB Output is correct
27 Correct 2 ms 848 KB Output is correct
28 Correct 4 ms 848 KB Output is correct
29 Correct 12 ms 1872 KB Output is correct
30 Correct 7 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 15 ms 1944 KB Output is correct
33 Correct 11 ms 1872 KB Output is correct
34 Correct 17 ms 9812 KB Output is correct
35 Correct 18 ms 9916 KB Output is correct
36 Correct 13 ms 2128 KB Output is correct
37 Correct 12 ms 1872 KB Output is correct
38 Correct 5 ms 1872 KB Output is correct
39 Correct 133 ms 14136 KB Output is correct
40 Correct 8 ms 2552 KB Output is correct
41 Correct 20 ms 11928 KB Output is correct
42 Correct 19 ms 2384 KB Output is correct
43 Correct 23 ms 8700 KB Output is correct
44 Correct 39 ms 13136 KB Output is correct
45 Correct 56 ms 16304 KB Output is correct
46 Correct 70 ms 30204 KB Output is correct
47 Correct 139 ms 14156 KB Output is correct
48 Correct 104 ms 14072 KB Output is correct
49 Correct 160 ms 95116 KB Output is correct
50 Correct 179 ms 95116 KB Output is correct
51 Correct 102 ms 15436 KB Output is correct
52 Correct 78 ms 14588 KB Output is correct
53 Correct 123 ms 14152 KB Output is correct
54 Incorrect 1 ms 336 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 6 ms 848 KB Output is correct
20 Correct 6 ms 3320 KB Output is correct
21 Correct 3 ms 1540 KB Output is correct
22 Correct 6 ms 1024 KB Output is correct
23 Correct 8 ms 848 KB Output is correct
24 Correct 8 ms 4176 KB Output is correct
25 Correct 7 ms 4096 KB Output is correct
26 Correct 3 ms 848 KB Output is correct
27 Correct 2 ms 848 KB Output is correct
28 Correct 4 ms 848 KB Output is correct
29 Correct 12 ms 1872 KB Output is correct
30 Correct 7 ms 2384 KB Output is correct
31 Correct 7 ms 2384 KB Output is correct
32 Correct 15 ms 1944 KB Output is correct
33 Correct 11 ms 1872 KB Output is correct
34 Correct 17 ms 9812 KB Output is correct
35 Correct 18 ms 9916 KB Output is correct
36 Correct 13 ms 2128 KB Output is correct
37 Correct 12 ms 1872 KB Output is correct
38 Correct 5 ms 1872 KB Output is correct
39 Correct 133 ms 14136 KB Output is correct
40 Correct 8 ms 2552 KB Output is correct
41 Correct 20 ms 11928 KB Output is correct
42 Correct 19 ms 2384 KB Output is correct
43 Correct 23 ms 8700 KB Output is correct
44 Correct 39 ms 13136 KB Output is correct
45 Correct 56 ms 16304 KB Output is correct
46 Correct 70 ms 30204 KB Output is correct
47 Correct 139 ms 14156 KB Output is correct
48 Correct 104 ms 14072 KB Output is correct
49 Correct 160 ms 95116 KB Output is correct
50 Correct 179 ms 95116 KB Output is correct
51 Correct 102 ms 15436 KB Output is correct
52 Correct 78 ms 14588 KB Output is correct
53 Correct 123 ms 14152 KB Output is correct
54 Incorrect 1 ms 336 KB Output isn't correct
55 Halted 0 ms 0 KB -