oj.uz

답안 #583996

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583996 2022-06-26T16:01:40 Z Omar_Elgedawy Mecho (IOI09_mecho) C++14
84 / 100
 231 ms 9996 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();
    if(block[i][j]<=t){
      continue;
    }
    block[i][j]=t;
    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')){
        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+(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')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=n*n*n;
  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:74:15: warning: variable 'xed' set but not used [-Wunused-but-set-variable]
   74 |   int xst,yst,xed,yed;
      |               ^~~
mecho.cpp:74:19: warning: variable 'yed' set but not used [-Wunused-but-set-variable]
   74 |   int xst,yst,xed,yed;
      |                   ^~~
mecho.cpp:97:15: warning: 'yst' may be used uninitialized in this function [-Wmaybe-uninitialized]
   97 |     int x=bfs2(xst,yst,m);
      |           ~~~~^~~~~~~~~~~
mecho.cpp:97:15: warning: 'xst' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 136 ms 7780 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 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 596 KB Output isn't correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 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 468 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 596 KB Output is correct
24 Correct 1 ms 596 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 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 2 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 724 KB Output is correct
33 Correct 6 ms 3028 KB Output is correct
34 Correct 6 ms 3028 KB Output is correct
35 Correct 24 ms 3108 KB Output is correct
36 Correct 7 ms 3352 KB Output is correct
37 Correct 9 ms 3388 KB Output is correct
38 Correct 37 ms 3476 KB Output is correct
39 Correct 10 ms 3796 KB Output is correct
40 Correct 9 ms 3776 KB Output is correct
41 Correct 42 ms 3812 KB Output is correct
42 Correct 12 ms 4180 KB Output is correct
43 Correct 12 ms 4180 KB Output is correct
44 Correct 72 ms 4180 KB Output is correct
45 Correct 15 ms 4600 KB Output is correct
46 Correct 13 ms 4564 KB Output is correct
47 Correct 91 ms 4652 KB Output is correct
48 Correct 16 ms 4956 KB Output is correct
49 Correct 17 ms 4952 KB Output is correct
50 Correct 89 ms 5052 KB Output is correct
51 Correct 18 ms 5436 KB Output is correct
52 Correct 18 ms 5416 KB Output is correct
53 Correct 111 ms 5376 KB Output is correct
54 Correct 20 ms 5784 KB Output is correct
55 Correct 20 ms 5728 KB Output is correct
56 Correct 134 ms 5964 KB Output is correct
57 Correct 24 ms 6100 KB Output is correct
58 Correct 24 ms 6092 KB Output is correct
59 Correct 166 ms 6356 KB Output is correct
60 Correct 26 ms 6496 KB Output is correct
61 Correct 30 ms 6492 KB Output is correct
62 Correct 170 ms 6676 KB Output is correct
63 Correct 118 ms 6608 KB Output is correct
64 Correct 180 ms 6616 KB Output is correct
65 Correct 167 ms 6616 KB Output is correct
66 Correct 164 ms 6496 KB Output is correct
67 Correct 123 ms 6492 KB Output is correct
68 Correct 65 ms 6776 KB Output is correct
69 Correct 59 ms 6780 KB Output is correct
70 Correct 61 ms 6776 KB Output is correct
71 Correct 52 ms 6792 KB Output is correct
72 Incorrect 49 ms 6664 KB Output isn't correct
73 Incorrect 87 ms 9804 KB Output isn't correct
74 Correct 108 ms 9780 KB Output is correct
75 Correct 114 ms 9644 KB Output is correct
76 Correct 106 ms 9784 KB Output is correct
77 Correct 135 ms 9996 KB Output is correct
78 Correct 125 ms 9264 KB Output is correct
79 Correct 120 ms 9388 KB Output is correct
80 Correct 113 ms 9444 KB Output is correct
81 Correct 117 ms 9452 KB Output is correct
82 Correct 90 ms 9440 KB Output is correct
83 Correct 120 ms 9032 KB Output is correct
84 Correct 107 ms 8908 KB Output is correct
85 Correct 107 ms 8908 KB Output is correct
86 Correct 145 ms 8788 KB Output is correct
87 Correct 139 ms 8504 KB Output is correct
88 Correct 152 ms 8396 KB Output is correct
89 Correct 163 ms 8388 KB Output is correct
90 Correct 158 ms 8344 KB Output is correct
91 Correct 206 ms 8508 KB Output is correct
92 Correct 231 ms 8248 KB Output is correct