oj.uz

답안 #584007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
584007 2022-06-26T16:23:05 Z Omar_Elgedawy Mecho (IOI09_mecho) C++14
84 / 100
 204 ms 7628 KB 
#include <bits/stdc++.h>
using namespace std;
#define cin(vec)        for(auto& i : vec) cin >> i
#define cout(vec)       for(auto& i : vec) cout << i << " "; cout << "\n";
#define fast            ios::sync_with_stdio(0);cin.tie(0);
#define loop(i,a,b)     for (int i = a; i < b; i++)
#define F               first
#define S               second
#define pb(n)           push_back(n)
#define pf(n)           push_front(n)
#define dci(d)          fixed<<setprecision(d)
#define sp              ' '
#define el              '\n'
#define all(v)          v.begin(),v.end()
#define int             long long
int dx[8]= {0,0,1,-1,-1,1,1,-1};
int dy[8]= {-1,1,0,0,-1,1,-1,1};
int const N=8e2+5,M=1e2+5,Mod=1e9;
char grid[N][N];
int block[N][N],n,s;
bool vis[N][N];
int valid(int i,int j){
  return (i>=0&&j>=0&&i<n&&j<n);
}
struct cell{
  int i;
  int j;
  int t;
};
queue<cell>q;
void bfs(){
  while(q.size()){
    int i=q.front().i;
    int j=q.front().j;
    int t=q.front().t;
    q.pop();
    for(int k=0;k<4;k++){
      int x=dx[k]+i;
      int y=dy[k]+j;
      if(valid(x,y)&&(grid[x][y]=='G'||grid[x][y]=='M')&&block[x][y]>t+1){
        block[x][y]=t+1;
        q.push({x,y,t+1});
      }
    }
  }
}
bool bfs2(int i,int j,int st){
  while(q.size())q.pop();
  q.push({i,j,0});
  vis[i][j]=1;
  int t;
  while(q.size()){
    i=q.front().i;
    j=q.front().j;
    t=q.front().t;
    q.pop();
    if(grid[i][j]=='D')return 1;
    for(int k=0;k<4;k++){
      int x=dx[k]+i;
      int y=dy[k]+j;
      if(valid(x,y)&&(grid[x][y]=='G'||grid[x][y]=='D'||grid[x][y]=='M')
        &&block[x][y]>st+floor((double)(t+1)/s)&&!vis[x][y]){
        q.push({x,y,t+1});
        vis[x][y]=1;
      }
    }
  }
  return 0;
}
void testcase(int h){
  cin>>n>>s;
  int xst,yst,xed,yed;
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      block[i][j]=1e9;
    }
  }
  for(int i=0;i<n;i++){
    string s;cin>>s;
    for(int j=0;j<n;j++){
      grid[i][j]=s[j];
      if(s[j]=='H')block[i][j]=0,q.push({i,j,0});
      if(s[j]=='M')xst=i,yst=j;
      if(s[j]=='D')xed=i,yed=j;
    }
  }
  bfs();
  int l=0,r=1e9;
  int mx=-1;
  while(l<=r){
    int m=(l+r)/2;
    for(int i=0;i<n;i++)
      for(int j=0;j<n;j++)
        vis[i][j]=0;
    int x=bfs2(xst,yst,m);
    if(x){
      mx=m;
      l=m+1;
    }
    else{
      r=m-1;
    }
  }
  cout<<mx<<el;
}
int32_t main()
{
  // fast
  testcase(1);
  // int tc;cin>>tc;for(int i=1;i<=tc;i++)testcase(i);
  return 0;
}

Compilation message

mecho.cpp: In function 'void testcase(long long int)':
mecho.cpp:72:15: warning: variable 'xed' set but not used [-Wunused-but-set-variable]
   72 |   int xst,yst,xed,yed;
      |               ^~~
mecho.cpp:72:19: warning: variable 'yed' set but not used [-Wunused-but-set-variable]
   72 |   int xst,yst,xed,yed;
      |                   ^~~
mecho.cpp:95:15: warning: 'yst' may be used uninitialized in this function [-Wmaybe-uninitialized]
   95 |     int x=bfs2(xst,yst,m);
      |           ~~~~^~~~~~~~~~~
mecho.cpp:95:15: warning: 'xst' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 304 KB Output is correct
7 Correct 145 ms 7024 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Incorrect 1 ms 596 KB Output isn't correct
13 Incorrect 1 ms 568 KB Output isn't correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 436 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 564 KB Output is correct
24 Correct 1 ms 568 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 696 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 700 KB Output is correct
33 Correct 6 ms 3180 KB Output is correct
34 Correct 8 ms 3156 KB Output is correct
35 Correct 31 ms 3156 KB Output is correct
36 Correct 7 ms 3540 KB Output is correct
37 Correct 8 ms 3540 KB Output is correct
38 Correct 38 ms 3540 KB Output is correct
39 Correct 9 ms 4028 KB Output is correct
40 Correct 8 ms 4032 KB Output is correct
41 Correct 52 ms 3920 KB Output is correct
42 Correct 11 ms 4416 KB Output is correct
43 Correct 10 ms 4500 KB Output is correct
44 Correct 72 ms 4388 KB Output is correct
45 Correct 12 ms 4820 KB Output is correct
46 Correct 12 ms 4856 KB Output is correct
47 Correct 98 ms 4736 KB Output is correct
48 Correct 17 ms 5248 KB Output is correct
49 Correct 14 ms 5188 KB Output is correct
50 Correct 96 ms 5096 KB Output is correct
51 Correct 16 ms 5648 KB Output is correct
52 Correct 17 ms 5700 KB Output is correct
53 Correct 110 ms 5448 KB Output is correct
54 Correct 18 ms 6036 KB Output is correct
55 Correct 21 ms 6020 KB Output is correct
56 Correct 139 ms 5964 KB Output is correct
57 Correct 23 ms 6376 KB Output is correct
58 Correct 21 ms 6400 KB Output is correct
59 Correct 166 ms 6476 KB Output is correct
60 Correct 24 ms 6732 KB Output is correct
61 Correct 24 ms 6848 KB Output is correct
62 Correct 181 ms 6760 KB Output is correct
63 Correct 126 ms 6860 KB Output is correct
64 Correct 204 ms 6860 KB Output is correct
65 Correct 196 ms 6864 KB Output is correct
66 Correct 142 ms 6864 KB Output is correct
67 Correct 128 ms 6860 KB Output is correct
68 Correct 70 ms 6860 KB Output is correct
69 Correct 57 ms 6860 KB Output is correct
70 Correct 42 ms 6868 KB Output is correct
71 Correct 58 ms 6828 KB Output is correct
72 Incorrect 39 ms 6928 KB Output isn't correct
73 Incorrect 87 ms 7436 KB Output isn't correct
74 Correct 125 ms 7628 KB Output is correct
75 Correct 104 ms 7548 KB Output is correct
76 Correct 92 ms 7552 KB Output is correct
77 Correct 121 ms 7552 KB Output is correct
78 Correct 116 ms 7348 KB Output is correct
79 Correct 108 ms 7464 KB Output is correct
80 Correct 108 ms 7348 KB Output is correct
81 Correct 107 ms 7464 KB Output is correct
82 Correct 97 ms 7460 KB Output is correct
83 Correct 148 ms 7228 KB Output is correct
84 Correct 141 ms 7224 KB Output is correct
85 Correct 115 ms 7316 KB Output is correct
86 Correct 121 ms 7348 KB Output is correct
87 Correct 111 ms 7316 KB Output is correct
88 Correct 153 ms 7204 KB Output is correct
89 Correct 146 ms 7164 KB Output is correct
90 Correct 134 ms 7208 KB Output is correct
91 Correct 132 ms 7116 KB Output is correct
92 Correct 174 ms 7208 KB Output is correct