oj.uz

답안 #733334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733334 2023-04-30T13:41:02 Z n0sk1ll Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 641 ms 174276 KB 
#include <bits/stdc++.h>
 
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)
 
using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;
 
 
 
 
 
 
 
//Note to self: Check for overflow
 
int n,m;
char tab[4004][4004];
 
bool valid(int x, int y)
{
    if (x<0 || y<0) return false;
    if (x>=n || y>=m) return false;
    if (tab[x][y]=='.') return false;
    return true;
}
 
int main()
{
    FAST;
 
    cin>>n>>m;
    ff(i,0,n) cin>>tab[i];
 
    if (tab[0][0]=='.') return cout<<0,0;
 
    int maxd=-1;
    deque<pair<int,pii>> bfs;
    bfs.pb({1,{0,0}});
 
    while (!bfs.empty())
    {
        int d=bfs.front().xx;
        int x=bfs.front().yy.xx;
        int y=bfs.front().yy.yy;
        bfs.popf();
 
        if (tab[x][y]=='.') continue;
 
        if (valid(x-1,y))
        {
            if (tab[x-1][y]!=tab[x][y]) bfs.pb({d+1,{x-1,y}});
            else bfs.pf({d,{x-1,y}});
        }
        if (valid(x+1,y))
        {
            if (tab[x+1][y]!=tab[x][y]) bfs.pb({d+1,{x+1,y}});
            else bfs.pf({d,{x+1,y}});
        }
        if (valid(x,y-1))
        {
            if (tab[x][y-1]!=tab[x][y]) bfs.pb({d+1,{x,y-1}});
            else bfs.pf({d,{x,y-1}});
        }
        if (valid(x,y+1))
        {
            if (tab[x][y+1]!=tab[x][y]) bfs.pb({d+1,{x,y+1}});
            else bfs.pf({d,{x,y+1}});
        }
 
        tab[x][y]='.';
        maxd=max(maxd,d);
    }
 
    cout<<maxd<<"\n";
}
 
//Note to self: Check for overflow

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2644 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 8 ms 2916 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 584 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1236 KB Output is correct
12 Correct 5 ms 1644 KB Output is correct
13 Correct 2 ms 1492 KB Output is correct
14 Correct 2 ms 1544 KB Output is correct
15 Correct 10 ms 2516 KB Output is correct
16 Correct 12 ms 2644 KB Output is correct
17 Correct 7 ms 2424 KB Output is correct
18 Correct 7 ms 2900 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15320 KB Output is correct
2 Correct 31 ms 6792 KB Output is correct
3 Correct 147 ms 31564 KB Output is correct
4 Correct 32 ms 11340 KB Output is correct
5 Correct 98 ms 20840 KB Output is correct
6 Correct 641 ms 68632 KB Output is correct
7 Correct 7 ms 15956 KB Output is correct
8 Correct 8 ms 15316 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 7 ms 15648 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 33 ms 6748 KB Output is correct
14 Correct 18 ms 4800 KB Output is correct
15 Correct 10 ms 5212 KB Output is correct
16 Correct 17 ms 2552 KB Output is correct
17 Correct 76 ms 12152 KB Output is correct
18 Correct 34 ms 11968 KB Output is correct
19 Correct 34 ms 11440 KB Output is correct
20 Correct 36 ms 10556 KB Output is correct
21 Correct 89 ms 21552 KB Output is correct
22 Correct 94 ms 20828 KB Output is correct
23 Correct 146 ms 17768 KB Output is correct
24 Correct 80 ms 21328 KB Output is correct
25 Correct 135 ms 31540 KB Output is correct
26 Correct 442 ms 174276 KB Output is correct
27 Correct 535 ms 70548 KB Output is correct
28 Correct 621 ms 68708 KB Output is correct
29 Correct 619 ms 63152 KB Output is correct
30 Correct 593 ms 74556 KB Output is correct
31 Correct 489 ms 24200 KB Output is correct
32 Correct 472 ms 76684 KB Output is correct