답안 #244300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
244300	2020-07-03T14:36:40 Z	JovanK26	Mecho (IOI09_mecho)	C++14	95 / 100	153 ms	5160 KB

mecho

#include <bits/stdc++.h>

using namespace std;
int n,s;
bool is[801][801];
int tim[801][801];
bool vis[801][801];
struct field
{
    int x,y;
};
vector<field> hives;
field start;
field home;
bool check(int m)
{
     bool visited[801][801];
     for(int i=0;i<n;i++)
     {
         for(int j=0;j<n;j++)
         {
             visited[i][j]=0;
         }
     }
     if(m>=tim[start.x][start.y])return 0;
     queue<pair<field,int> > q;
     q.push(make_pair(start,0));
     while(!q.empty())
    {
        auto x=q.front();
        q.pop();
        field cur=x.first;
        if(cur.x==home.x && cur.y==home.y)return 1;
        int d=x.second;
        visited[cur.x][cur.y]=1;
        if(cur.x+1<n && !visited[cur.x+1][cur.y] && is[cur.x+1][cur.y] && m+(d+1)/s<tim[cur.x+1][cur.y])
        {
            cur.x++;
            visited[cur.x][cur.y]=1;
            q.push(make_pair(cur,d+1));
            cur.x--;
        }
        if(cur.x-1>=0 && !visited[cur.x-1][cur.y] && is[cur.x-1][cur.y] && m+(d+1)/s<tim[cur.x-1][cur.y])
        {
            cur.x--;
            visited[cur.x][cur.y]=1;
            q.push(make_pair(cur,d+1));
            cur.x++;
        }
        if(cur.y+1<n && !visited[cur.x][cur.y+1] && is[cur.x][cur.y+1] && m+(d+1)/s<tim[cur.x][cur.y+1])
        {
            cur.y++;
            visited[cur.x][cur.y]=1;
            q.push(make_pair(cur,d+1));
            cur.y--;
        }
        if(cur.y-1>=0 && !visited[cur.x][cur.y-1] && is[cur.x][cur.y-1] && m+(d+1)/s<tim[cur.x][cur.y-1])
        {
            cur.y--;
            visited[cur.x][cur.y]=1;
            q.push(make_pair(cur,d+1));
            cur.y++;
        }
    }
    return 0;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> s;
    char c;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
           cin >> c;
           if(c=='T')
           {
               is[i][j]=0;
           }
           else if(c=='M')
           {
               is[i][j]=1;
               start.x=i;
               start.y=j;
           }
           else if(c=='D')
           {
               is[i][j]=1;
               home.x=i;
               home.y=j;
           }
           else if(c=='H')
           {
               is[i][j]=0;
               field temp;
               temp.x=i;
               temp.y=j;
               hives.push_back(temp);
           }
           else
           {
               is[i][j]=1;
           }
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            tim[i][j]=1000000000;
        }
    }
    queue<pair<field,int> > q;
    for(int i=0;i<hives.size();i++)
    {
        q.push(make_pair(hives[i],0));
        vis[hives[i].x][hives[i].y]=1;
    }
    while(!q.empty())
    {
        auto x=q.front();
        q.pop();
        field cur=x.first;
        int d=x.second;
        //if(vis[cur.x][cur.y])continue;
        vis[cur.x][cur.y]=1;
        tim[cur.x][cur.y]=min(tim[cur.x][cur.y],d);
        if(cur.x+1<n && !vis[cur.x+1][cur.y] && is[cur.x+1][cur.y])
        {
            cur.x++;
            vis[cur.x][cur.y]=1;
            q.push(make_pair(cur,d+1));
            cur.x--;
        }
        if(cur.x-1>=0 && !vis[cur.x-1][cur.y] && is[cur.x-1][cur.y])
        {
            cur.x--;
            vis[cur.x][cur.y]=1;
            q.push(make_pair(cur,d+1));
            cur.x++;
        }
        if(cur.y+1<n && !vis[cur.x][cur.y+1] && is[cur.x][cur.y+1])
        {
            cur.y++;
            vis[cur.x][cur.y]=1;
            q.push(make_pair(cur,d+1));
            cur.y--;
        }
        if(cur.y-1>=0 && !vis[cur.x][cur.y-1] && is[cur.x][cur.y-1])
        {
            cur.y--;
            vis[cur.x][cur.y]=1;
            q.push(make_pair(cur,d+1));
            cur.y++;
        }
    }
    tim[home.x][home.y]=1000000000;
    int l=0;
    int r=1000000;
    int m;
    int rez=-1;
    while(l<r)
    {
        m=(l+r)/2;
        if(check(m))
        {
            l=m+1;
            rez=max(rez,m);
        }
        else
        {
            r=m;
        }
    }
    cout << rez;
    return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:117:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<hives.size();i++)
                 ~^~~~~~~~~~~~~

Subtask #1

95.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	84 ms	4860 KB	Output is correct
8	Correct	5 ms	512 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Incorrect	5 ms	640 KB	Output isn't correct
13	Correct	5 ms	640 KB	Output is correct
14	Correct	5 ms	640 KB	Output is correct
15	Correct	5 ms	512 KB	Output is correct
16	Correct	5 ms	512 KB	Output is correct
17	Correct	5 ms	512 KB	Output is correct
18	Correct	5 ms	512 KB	Output is correct
19	Correct	5 ms	512 KB	Output is correct
20	Correct	5 ms	512 KB	Output is correct
21	Correct	5 ms	512 KB	Output is correct
22	Correct	5 ms	512 KB	Output is correct
23	Correct	5 ms	640 KB	Output is correct
24	Correct	5 ms	640 KB	Output is correct
25	Correct	5 ms	640 KB	Output is correct
26	Correct	5 ms	640 KB	Output is correct
27	Correct	5 ms	768 KB	Output is correct
28	Correct	5 ms	640 KB	Output is correct
29	Correct	5 ms	768 KB	Output is correct
30	Correct	5 ms	768 KB	Output is correct
31	Correct	5 ms	768 KB	Output is correct
32	Correct	5 ms	768 KB	Output is correct
33	Correct	10 ms	2304 KB	Output is correct
34	Correct	11 ms	2304 KB	Output is correct
35	Correct	23 ms	2304 KB	Output is correct
36	Correct	13 ms	2560 KB	Output is correct
37	Correct	13 ms	2560 KB	Output is correct
38	Correct	26 ms	2560 KB	Output is correct
39	Correct	15 ms	2816 KB	Output is correct
40	Correct	14 ms	2816 KB	Output is correct
41	Correct	33 ms	2816 KB	Output is correct
42	Correct	17 ms	3072 KB	Output is correct
43	Correct	16 ms	3072 KB	Output is correct
44	Correct	41 ms	3072 KB	Output is correct
45	Correct	19 ms	3328 KB	Output is correct
46	Correct	20 ms	3328 KB	Output is correct
47	Correct	49 ms	3328 KB	Output is correct
48	Correct	22 ms	3584 KB	Output is correct
49	Correct	22 ms	3584 KB	Output is correct
50	Correct	59 ms	3704 KB	Output is correct
51	Correct	27 ms	3968 KB	Output is correct
52	Correct	23 ms	3968 KB	Output is correct
53	Correct	66 ms	3968 KB	Output is correct
54	Correct	27 ms	4224 KB	Output is correct
55	Correct	27 ms	4224 KB	Output is correct
56	Correct	82 ms	4224 KB	Output is correct
57	Correct	31 ms	4480 KB	Output is correct
58	Correct	30 ms	4480 KB	Output is correct
59	Correct	88 ms	4480 KB	Output is correct
60	Correct	34 ms	4736 KB	Output is correct
61	Correct	32 ms	4736 KB	Output is correct
62	Correct	98 ms	4736 KB	Output is correct
63	Correct	108 ms	4856 KB	Output is correct
64	Correct	153 ms	4728 KB	Output is correct
65	Correct	148 ms	4784 KB	Output is correct
66	Correct	131 ms	4728 KB	Output is correct
67	Correct	115 ms	4856 KB	Output is correct
68	Correct	61 ms	4856 KB	Output is correct
69	Correct	60 ms	4828 KB	Output is correct
70	Correct	53 ms	4736 KB	Output is correct
71	Correct	49 ms	4736 KB	Output is correct
72	Correct	48 ms	4732 KB	Output is correct
73	Correct	47 ms	5112 KB	Output is correct
74	Correct	62 ms	5120 KB	Output is correct
75	Correct	65 ms	5120 KB	Output is correct
76	Correct	64 ms	5112 KB	Output is correct
77	Correct	67 ms	5120 KB	Output is correct
78	Correct	73 ms	5112 KB	Output is correct
79	Correct	60 ms	5120 KB	Output is correct
80	Correct	64 ms	5160 KB	Output is correct
81	Correct	67 ms	5112 KB	Output is correct
82	Correct	61 ms	5112 KB	Output is correct
83	Correct	78 ms	5112 KB	Output is correct
84	Correct	67 ms	5112 KB	Output is correct
85	Correct	74 ms	5124 KB	Output is correct
86	Correct	75 ms	4984 KB	Output is correct
87	Correct	70 ms	5016 KB	Output is correct
88	Correct	82 ms	4984 KB	Output is correct
89	Correct	88 ms	4992 KB	Output is correct
90	Correct	82 ms	4992 KB	Output is correct
91	Correct	83 ms	4988 KB	Output is correct
92	Correct	76 ms	4992 KB	Output is correct