oj.uz

Submission #861306

# Submission time Handle Problem Language Result Execution time Memory
861306 2023-10-16T01:23:24 Z nnhzzz Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 528 ms 122324 KB 
#include<bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i = (a); i<=(b); ++i)
#define REPD(i,a,b) for(int i = (a); i>=(b); --i)
#define REPDIS(i,a,b,c) for(int i = (a); i<=(b); i += c)
#define task "test"
#define task1 "nnhzzz"
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
#define MASK(x) (1LL<<x)
#define BIT(x,i) ((x>>i)&1LL)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vpii vector<pii>
#define fi first
#define se second
#define ld long double
#define ll long long

//-------------------------------------------------------------------------------//
template<typename T> bool mini(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> bool maxi(T &a, T b){if(a<b){a=b;return true;}return false;}
//-------------------------------------------------------------------------------//
const int MAXN = 4e3+7,N = 1e5+7,inf = 1e9,LOG = 20;
const int MOD = 1e9+7,MOD1 = 123456789;
const int dx[] = {1,0,0,-1};
const int dy[] = {0,1,-1,0};
//-------------------------------------------------------------------------------//

char c[MAXN][MAXN];
int d[MAXN][MAXN];
int n,m,res = 1;

bool ok(int x, int y){
    return (x>=1 && y>=1 && x<=n && y<=m);
}

void solve(){
    cin >> n >> m;
    REP(i,1,n) REP(j,1,m) cin >> c[i][j];
    deque<pii> q; d[1][1] = 1;
    q.emplace_back(1,1);
    while(SZ(q)!=0){
        int x = q.front().fi,y = q.front().se; q.pop_front();
        REP(i,0,3){
            int nx = x+dx[i],ny = y+dy[i];
            if(ok(nx,ny)==false || c[nx][ny]=='.' || d[nx][ny]!=0) continue;
            if(c[x][y]==c[nx][ny]){
                d[nx][ny] = d[x][y];
                q.emplace_front(nx,ny);
            }else{
                maxi(res,d[x][y]+1);
                d[nx][ny] = d[x][y]+1;
                q.emplace_back(nx,ny);
            }
        }
    }
    cout << res;
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if(fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    if(fopen(task1".inp","r")){
        freopen(task1".inp","r",stdin);
        freopen(task1".out","w",stdout);
    }
    solve();
    return 0;
}

Compilation message

tracks.cpp: In function 'int main()':
tracks.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
tracks.cpp:69:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
tracks.cpp:72:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen(task1".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
tracks.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen(task1".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7512 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 6 ms 7260 KB Output is correct
5 Correct 3 ms 5980 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 2 ms 5724 KB Output is correct
11 Correct 2 ms 3420 KB Output is correct
12 Correct 4 ms 5980 KB Output is correct
13 Correct 3 ms 5980 KB Output is correct
14 Correct 3 ms 5980 KB Output is correct
15 Correct 9 ms 7360 KB Output is correct
16 Correct 10 ms 7536 KB Output is correct
17 Correct 8 ms 7260 KB Output is correct
18 Correct 6 ms 7260 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 32344 KB Output is correct
2 Correct 37 ms 14860 KB Output is correct
3 Correct 239 ms 58024 KB Output is correct
4 Correct 66 ms 32080 KB Output is correct
5 Correct 154 ms 47520 KB Output is correct
6 Correct 514 ms 93232 KB Output is correct
7 Correct 11 ms 33116 KB Output is correct
8 Correct 9 ms 32348 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 9 ms 32600 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 36 ms 14876 KB Output is correct
14 Correct 22 ms 12248 KB Output is correct
15 Correct 18 ms 14428 KB Output is correct
16 Correct 18 ms 7772 KB Output is correct
17 Correct 90 ms 27352 KB Output is correct
18 Correct 74 ms 34184 KB Output is correct
19 Correct 65 ms 31936 KB Output is correct
20 Correct 59 ms 23468 KB Output is correct
21 Correct 143 ms 45796 KB Output is correct
22 Correct 145 ms 47316 KB Output is correct
23 Correct 173 ms 38736 KB Output is correct
24 Correct 143 ms 42956 KB Output is correct
25 Correct 386 ms 79164 KB Output is correct
26 Correct 308 ms 121820 KB Output is correct
27 Correct 470 ms 122324 KB Output is correct
28 Correct 520 ms 93248 KB Output is correct
29 Correct 528 ms 90684 KB Output is correct
30 Correct 486 ms 98056 KB Output is correct
31 Correct 368 ms 65364 KB Output is correct
32 Correct 408 ms 100612 KB Output is correct