oj.uz

답안 #557312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557312 2022-05-05T06:16:13 Z krit3379 Mecho (IOI09_mecho) C++17
100 / 100
 234 ms 9124 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 805
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

struct A{
    int x,y,w,cnt;
};

int dis[N][N],di[4]={1,-1,0,0},dj[4]={0,0,1,-1},ans=-1;
int n,step,sx,sy,ex,ey;
char s[N];
pair<int,int> dp[N][N];
vector<pair<int,int>> hive;
bitset<N> tree[N],vis[N];
queue<A> q;

bool sol(int mid){
    int i,j,k;
    for(i=1;i<=n;i++){
        vis[i]=0;
        for(j=1;j<=n;j++)dp[i][j]={1e9,1e9};
    }
    q.push({sx,sy,step,mid});
    while(!q.empty()){
        auto [x,y,w,cnt]=q.front();
        q.pop();
        if(vis[x][y])continue;
        vis[x][y]=true;
        for(k=0;k<4;k++){
            int xx=x+di[k],yy=y+dj[k];
            if(xx>0&&xx<=n&&yy>0&&yy<=n&&!vis[xx][yy]&&!tree[xx][yy]){
                if(w==step&&dis[x][y]>cnt&&dis[xx][yy]>=cnt+1&&make_pair(cnt+1,1)<dp[xx][yy])q.push({xx,yy,1,cnt+1}),dp[xx][yy]=make_pair(cnt+1,1);
                if(w<step&&dis[xx][yy]>=cnt&&make_pair(cnt,1)<dp[xx][yy])q.push({xx,yy,w+1,cnt}),dp[xx][yy]=make_pair(cnt,w+1);
            }
        }
    }
    return vis[ex][ey];
}

int main(){
    int i,j,k,l,r,mid;
    scanf("%d %d",&n,&step);
    for(i=1;i<=n;i++){
        scanf(" %s",s+1);
        for(j=1;j<=n;j++){
            if(s[j]=='T')tree[i][j]=true;
            else if(s[j]=='M')sx=i,sy=j;
            else if(s[j]=='D')ex=i,ey=j;
            else if(s[j]=='H')hive.push_back({i,j});
            dis[i][j]=1e9;
        }
    }
    for(auto [x,y]:hive)q.push({x,y,0});
    while(!q.empty()){
        auto [x,y,w,cnt]=q.front();
        q.pop();
        if(vis[x][y])continue;
        vis[x][y]=true;
        dis[x][y]=w;
        for(k=0;k<4;k++){
            int xx=x+di[k],yy=y+dj[k];
            if(xx>0&&xx<=n&&yy>0&&yy<=n&&!vis[xx][yy]&&!tree[xx][yy]&&(xx!=ex||yy!=ey))q.push({xx,yy,w+1});
        }
    }
    l=0,r=dis[sx][sy]+1;
    while(l<=r){
        mid=(l+r)/2;
        if(sol(mid))ans=mid,l=mid+1;
        else r=mid-1;
    }
    printf("%d",ans);
    return 0;
}

Compilation message

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

Subtask #1
100.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 1 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 1 ms 340 KB Output is correct
7 Correct 146 ms 8480 KB Output is correct
8 Correct 0 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 Correct 1 ms 728 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 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 724 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 852 KB Output is correct
30 Correct 1 ms 808 KB Output is correct
31 Correct 1 ms 852 KB Output is correct
32 Correct 1 ms 852 KB Output is correct
33 Correct 6 ms 3668 KB Output is correct
34 Correct 7 ms 3592 KB Output is correct
35 Correct 31 ms 3716 KB Output is correct
36 Correct 9 ms 4180 KB Output is correct
37 Correct 9 ms 4180 KB Output is correct
38 Correct 40 ms 4180 KB Output is correct
39 Correct 12 ms 4632 KB Output is correct
40 Correct 15 ms 4668 KB Output is correct
41 Correct 72 ms 4664 KB Output is correct
42 Correct 14 ms 5156 KB Output is correct
43 Correct 14 ms 5076 KB Output is correct
44 Correct 63 ms 5156 KB Output is correct
45 Correct 15 ms 5588 KB Output is correct
46 Correct 16 ms 5640 KB Output is correct
47 Correct 82 ms 5640 KB Output is correct
48 Correct 21 ms 6100 KB Output is correct
49 Correct 21 ms 6120 KB Output is correct
50 Correct 107 ms 6116 KB Output is correct
51 Correct 22 ms 6484 KB Output is correct
52 Correct 21 ms 6604 KB Output is correct
53 Correct 151 ms 6604 KB Output is correct
54 Correct 30 ms 6996 KB Output is correct
55 Correct 28 ms 6996 KB Output is correct
56 Correct 155 ms 7092 KB Output is correct
57 Correct 26 ms 7520 KB Output is correct
58 Correct 30 ms 7540 KB Output is correct
59 Correct 162 ms 7568 KB Output is correct
60 Correct 33 ms 8024 KB Output is correct
61 Correct 34 ms 8016 KB Output is correct
62 Correct 202 ms 8136 KB Output is correct
63 Correct 127 ms 7936 KB Output is correct
64 Correct 208 ms 8028 KB Output is correct
65 Correct 234 ms 8032 KB Output is correct
66 Correct 187 ms 7988 KB Output is correct
67 Correct 133 ms 8036 KB Output is correct
68 Correct 50 ms 8012 KB Output is correct
69 Correct 45 ms 8020 KB Output is correct
70 Correct 43 ms 8036 KB Output is correct
71 Correct 36 ms 8020 KB Output is correct
72 Correct 45 ms 8088 KB Output is correct
73 Correct 46 ms 9116 KB Output is correct
74 Correct 92 ms 9060 KB Output is correct
75 Correct 95 ms 9124 KB Output is correct
76 Correct 101 ms 9112 KB Output is correct
77 Correct 114 ms 8908 KB Output is correct
78 Correct 131 ms 8956 KB Output is correct
79 Correct 78 ms 8972 KB Output is correct
80 Correct 93 ms 9008 KB Output is correct
81 Correct 99 ms 9040 KB Output is correct
82 Correct 107 ms 8988 KB Output is correct
83 Correct 141 ms 8812 KB Output is correct
84 Correct 101 ms 8780 KB Output is correct
85 Correct 99 ms 8828 KB Output is correct
86 Correct 132 ms 8876 KB Output is correct
87 Correct 110 ms 8828 KB Output is correct
88 Correct 184 ms 8640 KB Output is correct
89 Correct 119 ms 8624 KB Output is correct
90 Correct 140 ms 8676 KB Output is correct
91 Correct 134 ms 8648 KB Output is correct
92 Correct 162 ms 8568 KB Output is correct