제출 #462426

#제출 시각아이디문제언어결과실행 시간메모리
462426KhizriTracks in the Snow (BOI13_tracks)C++17
45.31 / 100
2148 ms1048580 KiB
#include <bits/stdc++.h> using namespace std; //------------------------------DEFINE------------------------------ //****************************************************************** #define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0) #define ll long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) #define endl "\n" //****************************************************************** //----------------------------FUNCTION------------------------------ //****************************************************************** ll gcd(ll a,ll b){ if(a>b) swap(a,b); if(a==0) return a+b; return gcd(b%a,a); } ll lcm(ll a,ll b){ return a/gcd(a,b)*b; } bool is_prime(ll n){ ll k=sqrt(n); if(n==2) return true; if(n<2||n%2==0||k*k==n) return false; for(int i=3;i<=k;i+=2){ if(n%i==0){ return false; } } return true; } //***************************************************************** //--------------------------MAIN-CODE------------------------------ const int mxn=4000+5; int t=1,n,m,k,a,b; char arr[mxn][mxn]; char c[3]; void dfs(int i,int j){ b++; char cc=arr[i][j]; arr[i][j]=c[1-k]; if(arr[i+1][j]==cc){ dfs(i+1,j); } if(arr[i-1][j]==cc){ dfs(i-1,j); } if(arr[i][j+1]==cc){ dfs(i,j+1); } if(arr[i][j-1]==cc){ dfs(i,j-1); } } void solve(){ c[0]='F'; c[1]='R'; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>arr[i][j]; } } if(arr[1][1]=='F'){ k=0; } else{ k=1; } a=-1,b=0; int ans=0; while(a!=b){ a=b; b=0; ans++; dfs(1,1); k=1-k; } cout<<ans-1<<endl; } int main(){ IOS; //cin>>t; while(t--){ solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...