oj.uz

Submission #263486

# Submission time Handle Problem Language Result Execution time Memory
263486 2020-08-13T17:47:27 Z uacoder123 Mecho (IOI09_mecho) C++14
100 / 100
 212 ms 7032 KB 
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)

typedef long long int lli;
typedef pair <int, int> df;
typedef vector <int> vi;

int te,n,s;pair<int,int> pob,poh;
char grid[800][800];
int tobc[800][800];
int visited[800][800];
pair<int,int> movearr[] = {{0,-1},{1,0},{0,1},{-1,0}};

int canmove(const pair<int,int>& pos, const pair<int,int>& ptom, const int& bearob)
{
    if(ptom.S>=n||ptom.S<0||ptom.F>=n||ptom.F<0||grid[ptom.F][ptom.S]=='T')
        return(0);
    if(bearob==0&&grid[ptom.F][ptom.S]=='D')
        return(0);
  
    return(1);
}

int check(int t,int r)
{
    if(tobc[pob.F][pob.S] <= t) return 0;
    memset(visited, 0, sizeof(visited));
    int maccom=0,step=0;
    queue<pair<int,int>> sp1,sp2;
    sp1.push(pob);
    visited[pob.F][pob.S]=1;
    while(sp1.size()!=0)
    {
        pair<int,int> pos=sp1.front();
        for(int i=0;i<4;++i)
        {
            int x=pos.F+movearr[i].F,y=pos.S+movearr[i].S;
            if(canmove(pos,{x, y},1) && !visited[x][y] )
            {
                if(tobc[x][y]>t&&(step!=s-1||tobc[x][y]!=t+1))
                {
                    sp2.push({x,y});
                    visited[x][y]=1;
                    if(mp(x,y)==poh)
                    {
                        maccom++;
                    }
                }
            }
        }
        sp1.pop();
        if(sp1.size()==0)
        {
            step = (1 + step)%s;
            if(!step) ++t;
            swap(sp1,sp2);
        }
    }
    return(maccom);
}

void bfs1(vector<pair<int,int>> pos_vec)
{
    memset(visited, 0, sizeof(visited));
    queue<pair<int,int>> q;
    for(uint i=0;i<pos_vec.size();++i) 
    {
        q.push(pos_vec[i]);
        visited[pos_vec[i].F][pos_vec[i].S]=1;
    }
        
    while(q.size())
    {
        pair<int,int> pos=q.front();
        for(int i=0;i<4;++i)
        {
            int x=pos.F+movearr[i].F,y=pos.S+movearr[i].S;
            if(canmove(pos,{x,y},0) && !visited[x][y])
            {
                q.push({x,y});
                visited[x][y]=1;
                tobc[x][y]=min(tobc[x][y],tobc[pos.F][pos.S]+1);
            }
        }
        q.pop();
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    te=1;
     cin>>n>>s;   
     vector<pair<int,int>> pobees; 
     for(int i=0;i<n;++i)
     {
        for(int i1=0;i1<n;++i1)
            {
                tobc[i][i1]=650000;
                cin>>grid[i][i1];
                if(grid[i][i1]=='M')
                    pob={i,i1};
                else if(grid[i][i1]=='D')
                    poh={i,i1};
                else if(grid[i][i1]=='H')
                   {
                    pobees.pb(mp(i,i1));
                    tobc[i][i1]=0;
                   }
            }
     }   

     bfs1(pobees);
     int r=n*n,l=0,ans=-1;
     while(l<=r)
     {
        int mid=(l+r+1)/2;
        if(check(mid,r))
        {
            ans=mid;
            l=mid+1;
        }
        else
            r=mid-1;
     }
     cout<<ans<<endl;
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 2 ms 2816 KB Output is correct
3 Correct 3 ms 2816 KB Output is correct
4 Correct 3 ms 2816 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 3 ms 2944 KB Output is correct
7 Correct 147 ms 6784 KB Output is correct
8 Correct 3 ms 2944 KB Output is correct
9 Correct 2 ms 2944 KB Output is correct
10 Correct 3 ms 2944 KB Output is correct
11 Correct 3 ms 2944 KB Output is correct
12 Correct 3 ms 3072 KB Output is correct
13 Correct 2 ms 3072 KB Output is correct
14 Correct 4 ms 3200 KB Output is correct
15 Correct 3 ms 2944 KB Output is correct
16 Correct 3 ms 2944 KB Output is correct
17 Correct 3 ms 2944 KB Output is correct
18 Correct 3 ms 2944 KB Output is correct
19 Correct 3 ms 2944 KB Output is correct
20 Correct 3 ms 2944 KB Output is correct
21 Correct 3 ms 2944 KB Output is correct
22 Correct 3 ms 2944 KB Output is correct
23 Correct 3 ms 3072 KB Output is correct
24 Correct 3 ms 3072 KB Output is correct
25 Correct 3 ms 3072 KB Output is correct
26 Correct 3 ms 3072 KB Output is correct
27 Correct 3 ms 3072 KB Output is correct
28 Correct 4 ms 3072 KB Output is correct
29 Correct 3 ms 3072 KB Output is correct
30 Correct 3 ms 3072 KB Output is correct
31 Correct 3 ms 3200 KB Output is correct
32 Correct 3 ms 3200 KB Output is correct
33 Correct 9 ms 4352 KB Output is correct
34 Correct 10 ms 4352 KB Output is correct
35 Correct 32 ms 4480 KB Output is correct
36 Correct 10 ms 4608 KB Output is correct
37 Correct 12 ms 4608 KB Output is correct
38 Correct 46 ms 4728 KB Output is correct
39 Correct 12 ms 4992 KB Output is correct
40 Correct 16 ms 4864 KB Output is correct
41 Correct 56 ms 4864 KB Output is correct
42 Correct 15 ms 4992 KB Output is correct
43 Correct 15 ms 4992 KB Output is correct
44 Correct 65 ms 5112 KB Output is correct
45 Correct 16 ms 5248 KB Output is correct
46 Correct 24 ms 5248 KB Output is correct
47 Correct 84 ms 5352 KB Output is correct
48 Correct 21 ms 5504 KB Output is correct
49 Correct 20 ms 5504 KB Output is correct
50 Correct 89 ms 5504 KB Output is correct
51 Correct 22 ms 5760 KB Output is correct
52 Correct 24 ms 5760 KB Output is correct
53 Correct 116 ms 5760 KB Output is correct
54 Correct 26 ms 6144 KB Output is correct
55 Correct 29 ms 6132 KB Output is correct
56 Correct 130 ms 6016 KB Output is correct
57 Correct 27 ms 6392 KB Output is correct
58 Correct 31 ms 6392 KB Output is correct
59 Correct 161 ms 6392 KB Output is correct
60 Correct 30 ms 6656 KB Output is correct
61 Correct 34 ms 6776 KB Output is correct
62 Correct 188 ms 6656 KB Output is correct
63 Correct 140 ms 6776 KB Output is correct
64 Correct 212 ms 6608 KB Output is correct
65 Correct 212 ms 6656 KB Output is correct
66 Correct 160 ms 6656 KB Output is correct
67 Correct 159 ms 6656 KB Output is correct
68 Correct 73 ms 6656 KB Output is correct
69 Correct 60 ms 6656 KB Output is correct
70 Correct 60 ms 6776 KB Output is correct
71 Correct 53 ms 6752 KB Output is correct
72 Correct 44 ms 6656 KB Output is correct
73 Correct 54 ms 6904 KB Output is correct
74 Correct 97 ms 6912 KB Output is correct
75 Correct 105 ms 6912 KB Output is correct
76 Correct 109 ms 6912 KB Output is correct
77 Correct 118 ms 6912 KB Output is correct
78 Correct 136 ms 6904 KB Output is correct
79 Correct 68 ms 7032 KB Output is correct
80 Correct 84 ms 6904 KB Output is correct
81 Correct 100 ms 6912 KB Output is correct
82 Correct 83 ms 6912 KB Output is correct
83 Correct 117 ms 6784 KB Output is correct
84 Correct 98 ms 6816 KB Output is correct
85 Correct 98 ms 6784 KB Output is correct
86 Correct 104 ms 6904 KB Output is correct
87 Correct 109 ms 6784 KB Output is correct
88 Correct 123 ms 6904 KB Output is correct
89 Correct 114 ms 6784 KB Output is correct
90 Correct 124 ms 6784 KB Output is correct
91 Correct 132 ms 6776 KB Output is correct
92 Correct 115 ms 6868 KB Output is correct