oj.uz

Submission #91072

# Submission time Handle Problem Language Result Execution time Memory
91072 2018-12-26T06:35:18 Z Retro3014 Mecho (IOI09_mecho) C++17
26 / 100
 250 ms 5300 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <deque>


#define MAX_N 800

struct S{
    int x, y;
    bool operator ==(const S &a)const{
        return (x==a.x) && (y==a.y);
    }
};

using namespace std;
int N, K;
string str[MAX_N+1];
bool type[MAX_N+1][MAX_N+1];
S M, D, H;
bool visited[MAX_N+1][MAX_N+1];
int dist[MAX_N+1][MAX_N+1];

bool chk(int t, int p){
    S tmp={t, p};
    if(tmp.x<0 || tmp.x>=N || tmp.y<0 || tmp.y>=N)  return false;
    if(visited[t][p])   return false;
    if(type[t][p]==1)   return false;
    return true;
}

int dx[4]={0, 0, 1, -1}, dy[4]={1, -1, 0, 0};
deque<S> dq;
void BFS(){
    dq.push_back(H);
    visited[H.x][H.y]=true;
    while(!dq.empty()){
        S now = dq.front();
        dq.pop_front();
        for(int k=0; k<4; k++){
            if(chk(now.x+dx[k], now.y+dy[k])){
                dist[now.x+dx[k]][now.y+dy[k]]=dist[now.x][now.y]+1;
                visited[now.x+dx[k]][now.y+dy[k]]=true;
                dq.push_back({now.x+dx[k], now.y+dy[k]});
            }
        }
    }
    for(int i=0; i<N; i++){
        for(int j=0; j<N; j++){
            visited[i][j]=false;
        }
    }
}

bool can(int T){
    for(int i=0; i<N; i++){
        for(int j=0; j<N; j++){
            visited[i][j]=false;
        }
    }
    int t=0;
    dq.clear();
    dq.push_back(M);
    visited[M.x][M.y]=true;
    while(!dq.empty()){
        int sz=(int)dq.size();
        while(sz--){
            S now = dq.front();
            dq.pop_front();
            if(dist[now.x][now.y]>T){
                if(now==D)  return true;
                for(int k=0; k<4; k++){
                    if(chk(now.x+dx[k], now.y+dy[k]) && dist[now.x+dx[k]][now.y+dy[k]]>T){
                        visited[now.x+dx[k]][now.y+dy[k]]=true;
                        dq.push_back({now.x+dx[k], now.y+dy[k]});
                    }
                }
            }
        }
        t++;
        if(t==K){
            t=0; T++;
        }
    }
    return false;
}

int main(){
    scanf("%d%d", &N, &K);
    for(int i=0; i<N; i++){
        cin>>str[i];
        for(int j=0; j<N; j++){
            if(str[i][j]=='T')  type[i][j]=1;
            else if(str[i][j]=='M')    M={i, j};
            else if(str[i][j]=='D')    D={i, j};
            else if(str[i][j]=='H')    H={i, j};
        }
    }
    BFS();
    int s=0, e=N*N+1, mid;
    while(s<e){
        if(s==e-1){
            if(can(e)){
                s=e;
            }else{
                e=s;
            }
        }else{
            mid=(s+e)/2;
            if(can(mid)){
                s=mid;
            }else{
                e=mid-1;
            }
        }
    }
    printf("%d", s);
    return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:90:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &K);
     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
26.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Incorrect 2 ms 560 KB Output isn't correct
3 Correct 2 ms 560 KB Output is correct
4 Incorrect 2 ms 604 KB Output isn't correct
5 Correct 2 ms 604 KB Output is correct
6 Incorrect 2 ms 604 KB Output isn't correct
7 Incorrect 203 ms 5036 KB Output isn't correct
8 Incorrect 2 ms 5036 KB Output isn't correct
9 Correct 2 ms 5036 KB Output is correct
10 Incorrect 2 ms 5036 KB Output isn't correct
11 Incorrect 2 ms 5036 KB Output isn't correct
12 Incorrect 2 ms 5036 KB Output isn't correct
13 Correct 2 ms 5036 KB Output is correct
14 Incorrect 3 ms 5036 KB Output isn't correct
15 Correct 2 ms 5036 KB Output is correct
16 Correct 2 ms 5036 KB Output is correct
17 Correct 2 ms 5036 KB Output is correct
18 Correct 2 ms 5036 KB Output is correct
19 Correct 2 ms 5036 KB Output is correct
20 Correct 2 ms 5036 KB Output is correct
21 Correct 2 ms 5036 KB Output is correct
22 Correct 2 ms 5036 KB Output is correct
23 Correct 2 ms 5036 KB Output is correct
24 Correct 2 ms 5036 KB Output is correct
25 Correct 2 ms 5036 KB Output is correct
26 Correct 2 ms 5036 KB Output is correct
27 Correct 2 ms 5036 KB Output is correct
28 Correct 2 ms 5036 KB Output is correct
29 Correct 2 ms 5036 KB Output is correct
30 Correct 3 ms 5036 KB Output is correct
31 Correct 3 ms 5036 KB Output is correct
32 Correct 2 ms 5036 KB Output is correct
33 Correct 9 ms 5036 KB Output is correct
34 Correct 13 ms 5036 KB Output is correct
35 Incorrect 30 ms 5036 KB Output isn't correct
36 Correct 11 ms 5036 KB Output is correct
37 Correct 15 ms 5036 KB Output is correct
38 Incorrect 39 ms 5036 KB Output isn't correct
39 Correct 14 ms 5036 KB Output is correct
40 Correct 21 ms 5036 KB Output is correct
41 Incorrect 52 ms 5036 KB Output isn't correct
42 Correct 17 ms 5036 KB Output is correct
43 Correct 22 ms 5036 KB Output is correct
44 Incorrect 67 ms 5036 KB Output isn't correct
45 Correct 19 ms 5036 KB Output is correct
46 Correct 30 ms 5036 KB Output is correct
47 Incorrect 81 ms 5036 KB Output isn't correct
48 Correct 22 ms 5036 KB Output is correct
49 Correct 35 ms 5036 KB Output is correct
50 Incorrect 100 ms 5036 KB Output isn't correct
51 Correct 25 ms 5036 KB Output is correct
52 Correct 41 ms 5036 KB Output is correct
53 Incorrect 113 ms 5036 KB Output isn't correct
54 Correct 28 ms 5036 KB Output is correct
55 Correct 49 ms 5036 KB Output is correct
56 Incorrect 152 ms 5036 KB Output isn't correct
57 Correct 35 ms 5036 KB Output is correct
58 Correct 47 ms 5036 KB Output is correct
59 Incorrect 167 ms 5036 KB Output isn't correct
60 Correct 37 ms 5116 KB Output is correct
61 Correct 60 ms 5244 KB Output is correct
62 Incorrect 191 ms 5244 KB Output isn't correct
63 Incorrect 119 ms 5244 KB Output isn't correct
64 Incorrect 183 ms 5300 KB Output isn't correct
65 Incorrect 196 ms 5300 KB Output isn't correct
66 Incorrect 227 ms 5300 KB Output isn't correct
67 Incorrect 157 ms 5300 KB Output isn't correct
68 Incorrect 250 ms 5300 KB Output isn't correct
69 Incorrect 243 ms 5300 KB Output isn't correct
70 Incorrect 208 ms 5300 KB Output isn't correct
71 Incorrect 213 ms 5300 KB Output isn't correct
72 Incorrect 52 ms 5300 KB Output isn't correct
73 Incorrect 179 ms 5300 KB Output isn't correct
74 Incorrect 210 ms 5300 KB Output isn't correct
75 Incorrect 196 ms 5300 KB Output isn't correct
76 Incorrect 192 ms 5300 KB Output isn't correct
77 Incorrect 188 ms 5300 KB Output isn't correct
78 Incorrect 218 ms 5300 KB Output isn't correct
79 Incorrect 109 ms 5300 KB Output isn't correct
80 Incorrect 122 ms 5300 KB Output isn't correct
81 Incorrect 100 ms 5300 KB Output isn't correct
82 Incorrect 184 ms 5300 KB Output isn't correct
83 Incorrect 95 ms 5300 KB Output isn't correct
84 Incorrect 81 ms 5300 KB Output isn't correct
85 Incorrect 76 ms 5300 KB Output isn't correct
86 Incorrect 179 ms 5300 KB Output isn't correct
87 Incorrect 89 ms 5300 KB Output isn't correct
88 Incorrect 75 ms 5300 KB Output isn't correct
89 Incorrect 94 ms 5300 KB Output isn't correct
90 Incorrect 71 ms 5300 KB Output isn't correct
91 Incorrect 80 ms 5300 KB Output isn't correct
92 Incorrect 73 ms 5300 KB Output isn't correct