Submission #42404

#	Time	Username	Problem	Language	Result	Execution time	Memory
42404		Hassoony	Tracks in the Snow (BOI13_tracks)	C++14	29.58 / 100	1258 ms	780872 KiB

tracks

#include<bits/stdc++.h>
#include<unordered_map>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=4002;
int n,m,vis[MX][MX],cnt;
char a[MX][MX];
int dx[]={0,0,-1,1};
int dy[]={1,-1,0,0};
void dfs(int x,int y){
    if(vis[x][y])return;
    vis[x][y]=1;
    cnt++;
    for(int i=0;i<4;i++){
        int nx=dx[i]+x,ny=dy[i]+y;
        if(nx>=n||ny>=m||nx<0||ny<0||a[nx][ny]!=a[x][y])continue;
        dfs(nx,ny);
    }
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)scanf("%s",&a[i]);
    char c='R';
    if(a[0][0]=='R')c='F';
    int ans=1;
    dfs(0,0);
    int h=cnt;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(vis[i][j])a[i][j]=c;
        }
    }
    memset(vis,0,sizeof(vis));
    cnt=0;
    dfs(0,0);
    if(cnt!=h)ans++;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(vis[i][j]||a[i][j]=='.')continue;
            dfs(i,j);
            ans++;
        }
    }
    cout<<ans<<endl;
}

Compilation message (stderr)

tracks.cpp: In function 'int main()':
tracks.cpp:27:41: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[4002]' [-Wformat=]
     for(int i=0;i<n;i++)scanf("%s",&a[i]);
                                         ^
tracks.cpp:26:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
tracks.cpp:27:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<n;i++)scanf("%s",&a[i]);
                                          ^

• Subtask 1: 3.3333333333333335 / 30
• Subtask 2: 26.25 / 70