oj.uz

답안 #557302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557302 2022-05-05T05:55:51 Z krit3379 Mecho (IOI09_mecho) C++17
54 / 100
 219 ms 9976 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){
    if(mid>=dis[sx][sy])return false;
    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[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=1e9;
    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:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     scanf("%d %d",&n,&step);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
mecho.cpp:47:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         scanf(" %s",s+1);
      |         ~~~~~^~~~~~~~~~~

Subtask #1
54.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 140 ms 9116 KB Output is correct
8 Incorrect 1 ms 340 KB Output isn't correct
9 Correct 1 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 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Incorrect 1 ms 440 KB Output isn't correct
16 Correct 1 ms 468 KB Output is correct
17 Incorrect 1 ms 440 KB Output isn't correct
18 Correct 1 ms 468 KB Output is correct
19 Incorrect 1 ms 468 KB Output isn't correct
20 Correct 1 ms 468 KB Output is correct
21 Incorrect 1 ms 596 KB Output isn't correct
22 Correct 1 ms 596 KB Output is correct
23 Incorrect 1 ms 692 KB Output isn't correct
24 Correct 1 ms 596 KB Output is correct
25 Incorrect 1 ms 724 KB Output isn't correct
26 Correct 1 ms 724 KB Output is correct
27 Incorrect 1 ms 852 KB Output isn't correct
28 Correct 1 ms 852 KB Output is correct
29 Incorrect 1 ms 852 KB Output isn't correct
30 Correct 1 ms 852 KB Output is correct
31 Incorrect 1 ms 852 KB Output isn't correct
32 Correct 1 ms 852 KB Output is correct
33 Incorrect 7 ms 3780 KB Output isn't correct
34 Correct 7 ms 3780 KB Output is correct
35 Correct 32 ms 3796 KB Output is correct
36 Incorrect 6 ms 4308 KB Output isn't correct
37 Correct 7 ms 4252 KB Output is correct
38 Correct 53 ms 4356 KB Output is correct
39 Incorrect 10 ms 4808 KB Output isn't correct
40 Correct 9 ms 4804 KB Output is correct
41 Correct 71 ms 4880 KB Output is correct
42 Incorrect 9 ms 5312 KB Output isn't correct
43 Correct 8 ms 5388 KB Output is correct
44 Correct 72 ms 5396 KB Output is correct
45 Incorrect 15 ms 5884 KB Output isn't correct
46 Correct 11 ms 5844 KB Output is correct
47 Correct 90 ms 5936 KB Output is correct
48 Incorrect 16 ms 6360 KB Output isn't correct
49 Correct 19 ms 6480 KB Output is correct
50 Correct 111 ms 6476 KB Output is correct
51 Incorrect 18 ms 6952 KB Output isn't correct
52 Correct 17 ms 6996 KB Output is correct
53 Correct 117 ms 7024 KB Output is correct
54 Incorrect 22 ms 7528 KB Output isn't correct
55 Correct 24 ms 7508 KB Output is correct
56 Correct 148 ms 7572 KB Output is correct
57 Incorrect 24 ms 8012 KB Output isn't correct
58 Correct 17 ms 7992 KB Output is correct
59 Correct 157 ms 8124 KB Output is correct
60 Incorrect 23 ms 8576 KB Output isn't correct
61 Correct 30 ms 8592 KB Output is correct
62 Correct 212 ms 8676 KB Output is correct
63 Correct 146 ms 8668 KB Output is correct
64 Correct 219 ms 8640 KB Output is correct
65 Correct 218 ms 8664 KB Output is correct
66 Incorrect 165 ms 8612 KB Output isn't correct
67 Correct 128 ms 8664 KB Output is correct
68 Correct 53 ms 8660 KB Output is correct
69 Correct 51 ms 8668 KB Output is correct
70 Correct 34 ms 8724 KB Output is correct
71 Correct 36 ms 8652 KB Output is correct
72 Correct 29 ms 8640 KB Output is correct
73 Correct 54 ms 9804 KB Output is correct
74 Correct 95 ms 9976 KB Output is correct
75 Correct 111 ms 9740 KB Output is correct
76 Correct 92 ms 9720 KB Output is correct
77 Correct 96 ms 9456 KB Output is correct
78 Correct 108 ms 9632 KB Output is correct
79 Correct 92 ms 9648 KB Output is correct
80 Correct 91 ms 9548 KB Output is correct
81 Correct 101 ms 9612 KB Output is correct
82 Correct 94 ms 9584 KB Output is correct
83 Correct 127 ms 9420 KB Output is correct
84 Correct 113 ms 9412 KB Output is correct
85 Correct 110 ms 9568 KB Output is correct
86 Correct 130 ms 9508 KB Output is correct
87 Correct 124 ms 9524 KB Output is correct
88 Correct 125 ms 9292 KB Output is correct
89 Correct 122 ms 9292 KB Output is correct
90 Correct 151 ms 9216 KB Output is correct
91 Correct 145 ms 9260 KB Output is correct
92 Correct 126 ms 9292 KB Output is correct