oj.uz

답안 #492134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492134 2021-12-05T15:10:52 Z ToroTN Tracks in the Snow (BOI13_tracks) C++14
31.25 / 100
 487 ms 78648 KB 
#include<bits/stdc++.h>
using namespace std;
int n,m,dx[]={1,-1,0,0},dy[]={0,0,1,-1},d[4005][4005],u,v,sx,sy,x,y;
char s[4005][4005];
queue<pair<int,int> > q;
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%s",s[i]+1);
    }
    sx=1;
    sy=1;
    for(int i=1;;i++)
    {
        //printf("%d\n",i);
        q.push({sx,sy});
        d[sx][sy]=1;
        sx=-1;
        sy=-1;
        while(!q.empty())
        {
            u=q.front().first;
            v=q.front().second;
            ///printf("%d %d %d\n",u,v,d[u][v]);
            q.pop();
            for(int j=0;j<4;j++)
            {
                x=u+dx[j];
                y=v+dy[j];
                if(x>=1&&x<=n&&y>=1&&y<=m)
                {
                    if(s[x][y]!='.')
                    {
                        if(s[x][y]!=s[u][v])
                        {
                            if(d[x][y]==0)
                            {
                                sx=x;
                                sy=y;
                            }
                        }else
                        {
                            //printf("%d %d %d %d\n",u,v,x,y);
                            if(d[x][y]==0)
                            {
                                //printf("%d %d %d\n",x,y,d[x][y]);
                                d[x][y]=1;
                                q.push({x,y});
                            }
                        }
                    }
                }
            }
        }
        if(sx==-1&&sy==-1)
        {
            printf("%d\n",i);
            break;
        }
    }
}

Compilation message

tracks.cpp: In function 'int main()':
tracks.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
tracks.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         scanf("%s",s[i]+1);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 4172 KB Output isn't correct
2 Correct 0 ms 460 KB Output is correct
3 Incorrect 1 ms 588 KB Output isn't correct
4 Incorrect 5 ms 4600 KB Output isn't correct
5 Incorrect 2 ms 2508 KB Output isn't correct
6 Correct 0 ms 460 KB Output is correct
7 Incorrect 1 ms 588 KB Output isn't correct
8 Incorrect 1 ms 716 KB Output isn't correct
9 Incorrect 1 ms 1100 KB Output isn't correct
10 Incorrect 2 ms 2252 KB Output isn't correct
11 Correct 2 ms 1996 KB Output is correct
12 Incorrect 2 ms 2636 KB Output isn't correct
13 Incorrect 2 ms 2508 KB Output isn't correct
14 Incorrect 1 ms 2508 KB Output isn't correct
15 Incorrect 3 ms 4172 KB Output isn't correct
16 Incorrect 3 ms 4172 KB Output isn't correct
17 Incorrect 3 ms 4044 KB Output isn't correct
18 Incorrect 6 ms 4556 KB Output isn't correct

Subtask #2
26.25 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 30692 KB Output is correct
2 Incorrect 10 ms 10188 KB Output isn't correct
3 Incorrect 69 ms 32136 KB Output isn't correct
4 Incorrect 20 ms 15244 KB Output isn't correct
5 Correct 160 ms 44488 KB Output is correct
6 Incorrect 213 ms 61276 KB Output isn't correct
7 Correct 17 ms 32196 KB Output is correct
8 Correct 17 ms 30720 KB Output is correct
9 Incorrect 1 ms 460 KB Output isn't correct
10 Correct 1 ms 288 KB Output is correct
11 Incorrect 16 ms 31380 KB Output isn't correct
12 Correct 1 ms 1484 KB Output is correct
13 Incorrect 10 ms 10188 KB Output isn't correct
14 Incorrect 7 ms 7500 KB Output isn't correct
15 Correct 24 ms 12120 KB Output is correct
16 Incorrect 5 ms 3404 KB Output isn't correct
17 Incorrect 24 ms 16340 KB Output isn't correct
18 Correct 89 ms 31692 KB Output is correct
19 Incorrect 20 ms 15180 KB Output isn't correct
20 Incorrect 18 ms 14156 KB Output isn't correct
21 Incorrect 42 ms 24948 KB Output isn't correct
22 Correct 159 ms 44716 KB Output is correct
23 Incorrect 35 ms 20092 KB Output isn't correct
24 Correct 134 ms 40860 KB Output is correct
25 Correct 410 ms 78648 KB Output is correct
26 Correct 487 ms 68932 KB Output is correct
27 Incorrect 430 ms 78084 KB Output isn't correct
28 Incorrect 202 ms 61296 KB Output isn't correct
29 Incorrect 264 ms 71212 KB Output isn't correct
30 Incorrect 225 ms 66892 KB Output isn't correct
31 Incorrect 55 ms 26052 KB Output isn't correct
32 Incorrect 239 ms 58760 KB Output isn't correct