oj.uz

Submission #958654

# Submission time Handle Problem Language Result Execution time Memory
958654 2024-04-06T09:48:23 Z ramalzaher Tracks in the Snow (BOI13_tracks) C++14
0 / 100
 1153 ms 617296 KB 
/** * * * * * * * * * * * * * **\
 *                             *
 *   Author:Ram Azar Alzaher   *
 * Coded in: YYYY\M\D HH:MM:SS *
 *          Lang: C++          *
 *                             *
\** * * * * * * * * * * * * * **/
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define itn int
#define rep(i,x,n) for(int i=(x);i<(n);i++)
#define FOR(i,n) rep(i,0,n)
#define per(i,x,n) for(int i=(x);i>(n);i--)
#define ROF(i,x) for(int i=x;i>=0;i--)
#define v(i) vector< i >
#define vi vector< int >
#define p(i,j) pair< i , j >
#define pii pair<int,int>
#define m(i,j) map< i , j >
#define um(i,j) unordered_map< i , j >
#define s(i) set< i >
#define us(i) unordered_set< i >
#define set set<int>
#define uset unordered_set<int>
#define mp make_pair
#define f first
#define rall(x) x.rbegin(),x.rend()
#define all(x) x.begin(),x.end()
#define so(x) sort(all(s))
#define so(x) sort(all(s))
#define s second
#define sz size()
#define pb push_back
#define test long long t ;cin >> t ;while(t--)
using namespace std;
//*****************************************************VARIABLES***************************************************************\\\\*******************************\\
//*****************************************************************************************************************************\\\\
//***************************************************************************************************************************************
const double pi=2.0*acos(0.0);
const int inf=1LL<<62LL;
const int mod=1e9+7;
int dx[] {1,-1,0,0};
int dy[] {0,0,-1,1};
int max1 = INT_MIN;
int min1 = INT_MAX;
//*****************************************************************************************************************************\\\\
//**************************************************************************************************************************************
//******************************************************************************************************************************\****************


//*****************************************************FUNCTIONS***************************************************************\\\\*******************************\\
//*****************************************************************************************************************************\\\\
//***************************************************************************************************************************************
void setIO(string name = "") {
	if(name != ""){

		freopen((name+".in").c_str(), "r", stdin);
		freopen((name+".out").c_str(), "w", stdout);
	}
}
const int N = 4004 ;
int n , m ;
char a[N][N] ;
int vis[N][N] , dis[N][N];
bool isvalid(int x  ,int y  ){
if(x >= n || y >= m || y < 0 || x < 0 || vis[x][y]||a[x][y] == '.' )return 0 ;
return 1 ;
}

//*****************************************************************************************************************************\\\\
//**************************************************************************************************************************************
//******************************************************************************************************************************\****************


signed main()
{
fast;
setIO();
cin >> n >> m ;
FOR(i , n )FOR(j , m )cin >> a[i][j] ;
deque<pii> q ;
q.push_back({0 ,0  });
vis[0][0]=0 ;
dis[0][0] = 0 ;
int ans(1) ;
while(q.sz) {
    auto &[x , y ] = q.front() ;
    ans=max(ans , dis[x][y] ) ;
    q.pop_front() ;
    FOR(i ,  4){
       int nx = dx[i]+x;
       int ny = dy[i]+y;
    if(isvalid(nx , ny )){
        if( a[x][y] == a[nx][ny] ){
           q.push_front({nx , ny });
           dis[nx][ny] = dis[x][y] + 1;
        }else {
           q.push_back({nx , ny });
           dis[nx][ny] = dis[x][y] ;
        }
        vis[nx][ny] = 1 ;
    }
}
}
cout<<ans<< endl ;

return 0 ;
}
/**
input :


output :
*/

Compilation message

tracks.cpp:32: warning: "s" redefined
   32 | #define s second
      | 
tracks.cpp:22: note: this is the location of the previous definition
   22 | #define s(i) set< i >
      | 
tracks.cpp:37:1: warning: multi-line comment [-Wcomment]
   37 | //*****************************************************VARIABLES***************************************************************\\\\*******************************\\
      | ^
tracks.cpp:47:1: warning: multi-line comment [-Wcomment]
   47 | //*****************************************************************************************************************************\\\\
      | ^
tracks.cpp:52:1: warning: multi-line comment [-Wcomment]
   52 | //*****************************************************FUNCTIONS***************************************************************\\\\*******************************\\
      | ^
tracks.cpp:71:1: warning: multi-line comment [-Wcomment]
   71 | //*****************************************************************************************************************************\\\\
      | ^
tracks.cpp: In function 'int main()':
tracks.cpp:88:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   88 |     auto &[x , y ] = q.front() ;
      |           ^
tracks.cpp: In function 'void setIO(std::string)':
tracks.cpp:58:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |   freopen((name+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tracks.cpp:59:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |   freopen((name+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 17488 KB Output isn't correct
2 Incorrect 1 ms 4440 KB Output isn't correct
3 Incorrect 1 ms 4700 KB Output isn't correct
4 Incorrect 10 ms 16332 KB Output isn't correct
5 Incorrect 4 ms 10844 KB Output isn't correct
6 Incorrect 1 ms 4444 KB Output isn't correct
7 Incorrect 1 ms 4700 KB Output isn't correct
8 Incorrect 1 ms 4700 KB Output isn't correct
9 Incorrect 1 ms 4956 KB Output isn't correct
10 Incorrect 3 ms 6748 KB Output isn't correct
11 Incorrect 3 ms 8192 KB Output isn't correct
12 Incorrect 6 ms 14684 KB Output isn't correct
13 Incorrect 4 ms 10844 KB Output isn't correct
14 Incorrect 4 ms 10844 KB Output isn't correct
15 Incorrect 13 ms 14956 KB Output isn't correct
16 Incorrect 15 ms 17340 KB Output isn't correct
17 Incorrect 17 ms 18780 KB Output isn't correct
18 Incorrect 10 ms 16428 KB Output isn't correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 48984 KB Output isn't correct
2 Incorrect 51 ms 38836 KB Output isn't correct
3 Incorrect 137 ms 26640 KB Output isn't correct
4 Incorrect 102 ms 88404 KB Output isn't correct
5 Incorrect 208 ms 118968 KB Output isn't correct
6 Runtime error 1153 ms 579296 KB Execution killed with signal 11
7 Incorrect 3 ms 18520 KB Output isn't correct
8 Incorrect 18 ms 48988 KB Output isn't correct
9 Incorrect 1 ms 4440 KB Output isn't correct
10 Incorrect 1 ms 4444 KB Output isn't correct
11 Incorrect 18 ms 50124 KB Output isn't correct
12 Incorrect 1 ms 4444 KB Output isn't correct
13 Incorrect 54 ms 37792 KB Output isn't correct
14 Incorrect 30 ms 22620 KB Output isn't correct
15 Incorrect 34 ms 31564 KB Output isn't correct
16 Incorrect 22 ms 15704 KB Output isn't correct
17 Incorrect 34 ms 12628 KB Output isn't correct
18 Incorrect 129 ms 89812 KB Output isn't correct
19 Incorrect 100 ms 86356 KB Output isn't correct
20 Incorrect 29 ms 10588 KB Output isn't correct
21 Incorrect 92 ms 42696 KB Output isn't correct
22 Incorrect 209 ms 114384 KB Output isn't correct
23 Incorrect 79 ms 22108 KB Output isn't correct
24 Incorrect 75 ms 16720 KB Output isn't correct
25 Incorrect 130 ms 18392 KB Output isn't correct
26 Incorrect 683 ms 284644 KB Output isn't correct
27 Runtime error 1115 ms 617296 KB Execution killed with signal 11
28 Runtime error 1141 ms 570776 KB Execution killed with signal 11
29 Runtime error 1150 ms 562528 KB Execution killed with signal 11
30 Runtime error 1087 ms 559880 KB Execution killed with signal 11
31 Incorrect 549 ms 205516 KB Output isn't correct
32 Incorrect 793 ms 305596 KB Output isn't correct