oj.uz

Submission #958651

# Submission time Handle Problem Language Result Execution time Memory
958651 2024-04-06T09:44:36 Z ramalzaher Tracks in the Snow (BOI13_tracks) C++14
2.1875 / 100
 941 ms 283096 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 ;
while(q.sz) {
    auto &[x , y ] = q.front() ;
    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<<dis[n-1][m-1]+1 << 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:87:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   87 |     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 21688 KB Output isn't correct
2 Incorrect 1 ms 6488 KB Output isn't correct
3 Incorrect 1 ms 6492 KB Output isn't correct
4 Incorrect 10 ms 24156 KB Output isn't correct
5 Incorrect 4 ms 11100 KB Output isn't correct
6 Incorrect 1 ms 6492 KB Output isn't correct
7 Incorrect 1 ms 6492 KB Output isn't correct
8 Incorrect 1 ms 6492 KB Output isn't correct
9 Incorrect 2 ms 8796 KB Output isn't correct
10 Incorrect 2 ms 8796 KB Output isn't correct
11 Incorrect 3 ms 8028 KB Output isn't correct
12 Incorrect 8 ms 12636 KB Output isn't correct
13 Incorrect 4 ms 11100 KB Output isn't correct
14 Incorrect 4 ms 11100 KB Output isn't correct
15 Incorrect 13 ms 19804 KB Output isn't correct
16 Incorrect 19 ms 21592 KB Output isn't correct
17 Incorrect 13 ms 21848 KB Output isn't correct
18 Incorrect 12 ms 24156 KB Output isn't correct

Subtask #2
2.1875 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 69 ms 154452 KB Output isn't correct
2 Incorrect 17 ms 16988 KB Output isn't correct
3 Incorrect 135 ms 36332 KB Output isn't correct
4 Incorrect 93 ms 98644 KB Output isn't correct
5 Incorrect 166 ms 167240 KB Output isn't correct
6 Incorrect 941 ms 282704 KB Output isn't correct
7 Incorrect 26 ms 159824 KB Output isn't correct
8 Incorrect 22 ms 154460 KB Output isn't correct
9 Incorrect 2 ms 4956 KB Output isn't correct
10 Incorrect 1 ms 4444 KB Output isn't correct
11 Incorrect 19 ms 87500 KB Output isn't correct
12 Incorrect 2 ms 9224 KB Output isn't correct
13 Incorrect 18 ms 16976 KB Output isn't correct
14 Incorrect 28 ms 40264 KB Output isn't correct
15 Incorrect 31 ms 48480 KB Output isn't correct
16 Incorrect 23 ms 22100 KB Output isn't correct
17 Incorrect 67 ms 52680 KB Output isn't correct
18 Incorrect 115 ms 113048 KB Output isn't correct
19 Incorrect 95 ms 98636 KB Output isn't correct
20 Incorrect 40 ms 74836 KB Output isn't correct
21 Incorrect 95 ms 136788 KB Output isn't correct
22 Incorrect 170 ms 167372 KB Output isn't correct
23 Incorrect 95 ms 43860 KB Output isn't correct
24 Incorrect 166 ms 123336 KB Output isn't correct
25 Incorrect 636 ms 282976 KB Output isn't correct
26 Correct 727 ms 247856 KB Output is correct
27 Incorrect 873 ms 282636 KB Output isn't correct
28 Incorrect 931 ms 282760 KB Output isn't correct
29 Incorrect 905 ms 283096 KB Output isn't correct
30 Incorrect 862 ms 278112 KB Output isn't correct
31 Incorrect 518 ms 214100 KB Output isn't correct
32 Incorrect 827 ms 282920 KB Output isn't correct