oj.uz

Submission #442178

# Submission time Handle Problem Language Result Execution time Memory
442178 2021-07-07T09:04:22 Z Haidara Mecho (IOI09_mecho) C++17
20 / 100
 391 ms 12084 KB 
/* * * * * * * * * *\
 * Author: Haidara *
 * LANG: C++17     *
 * PROB:           *
\* * * * * * * * * */
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define rep(i,x,n) for(int i=x;i<(n);i++)
#define FOR(i,n) rep(i,0,n)
#define per(i,x,n) for(int i=x;i>(n);i--)
#define ROF(i,x) for(int i=x;i>=0;i--)
#define v(i) vector< i >
#define p(i,j) pair< i , j >
#define pii pair<int,int>
#define m(i,j) map< i , j >
#define um(i,j) unordered_map< i , j >
#define pq(i) priority_queue< i >
#define ff first
#define all(x) x.begin(),x.end()
#define ss second
#define pp push_back
using namespace std;
void SIO(string name="")
{
    if(name!="")
    {
        freopen((name+".in").c_str(),"r",stdin);
        freopen((name+".out").c_str(),"w",stdout);
    }
}
const int inf=1LL<<60LL;
const int mod=1e9+7;
const int maxn=808;
int n,foot;
pii Mecho,House;
char a[maxn][maxn];
bool vis[maxn][maxn];
queue<pii>q;
v(v(int)) dist;
int dx[] {-1,1,0,0};
int dy[] {0,0,-1,1};
bool valid(int x,int y)
{
    return x>=0&&y>=0&&x<n&&y<n&&a[x][y]=='G';
}
bool nvalid(int x,int y)
{
    return x>=0&&y>=0&&x<n&&y<n;
}
bool check(int Time)
{
    v(v(int))newdist;
    newdist=dist;
    FOR(i,maxn)
    FOR(j,maxn)
    {
        vis[i][j]=0;
        if(a[i][j]=='T'||a[i][j]=='H'||a[i][j]=='M')
            vis[i][j]=1;
    }
    queue<p(pii,int)>nq;
    nq.push({Mecho,foot});
    newdist[Mecho.ff][Mecho.ss]=Time;
    while(nq.size())
    {
        pii f=nq.front().ff;
        int lft=nq.front().ss;
        nq.pop();
        FOR(i,4)
        {
            int x=f.ff+dx[i],y=f.ss+dy[i];
            if(nvalid(x,y)&&(a[x][y]=='G'||a[x][y]=='D'))
            {
                if(!vis[x][y])
                {
                    if(lft)
                    {
                        if(newdist[x][y]>newdist[f.ff][f.ss])
                        {
                            newdist[x][y]=newdist[f.ff][f.ss];
                            nq.push({{x,y},lft-1});
                            vis[x][y]=1;
                        }
                    }
                    else
                    {
                        if(newdist[x][y]>newdist[f.ff][f.ss]+1)
                        {
                            newdist[x][y]=newdist[f.ff][f.ss];
                            nq.push({{x,y},foot});
                            vis[x][y]=1;
                        }
                    }
                }
            }
        }
    }
    return newdist[House.ff][House.ss]!=inf;
}
void solve()
{
    while(q.size())
    {
        pii f=q.front();
        q.pop();
        FOR(i,4)
        {
            int x=f.ff+dx[i],y=f.ss+dy[i];
            if(valid(x,y))
            {
                if(!vis[x][y])
                {
                    vis[x][y]=1;
                    q.push({x,y});
                    dist[x][y]=dist[f.ff][f.ss]+1;
                }
                else if(dist[x][y]>dist[f.ff][f.ss]+1)
                {
                    dist[x][y]=dist[f.ff][f.ss]+1;
                    q.push({x,y});
                }
            }
        }
    }
}
signed main()
{
    SIO("");
    cin>>n>>foot;
    dist.resize(maxn);
    FOR(i,maxn)
    dist[i].resize(maxn);
    FOR(i,n)
    FOR(j,n)
    {
        cin>>a[i][j];
        dist[i][j]=inf;
        if(a[i][j]=='M')
            Mecho= {i,j};
        else if(a[i][j]=='H')
            q.push({i,j}),vis[i][j]=1,dist[i][j]=0;
        else if(a[i][j]=='T')
            vis[i][j]=1;
        else if(a[i][j]=='D')
        House={i,j};
    }
    solve();
    int l=1,r=800*800,ans=-1;
    while(l<=r)
    {
        int mid=l+(r-l)/2;
        if(check(mid))
            ans=max(ans,mid-1),l=mid+1;
        else
            r=mid-1;
    }
    cout<<ans;
}

Compilation message

mecho.cpp: In function 'void SIO(std::string)':
mecho.cpp:28:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         freopen((name+".in").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen((name+".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 11152 KB Output is correct
2 Incorrect 51 ms 11108 KB Output isn't correct
3 Correct 49 ms 11220 KB Output is correct
4 Correct 47 ms 11212 KB Output is correct
5 Incorrect 45 ms 11136 KB Output isn't correct
6 Incorrect 45 ms 11212 KB Output isn't correct
7 Incorrect 256 ms 11888 KB Output isn't correct
8 Incorrect 42 ms 11212 KB Output isn't correct
9 Incorrect 41 ms 11220 KB Output isn't correct
10 Incorrect 46 ms 11212 KB Output isn't correct
11 Incorrect 44 ms 11212 KB Output isn't correct
12 Incorrect 53 ms 11212 KB Output isn't correct
13 Correct 66 ms 11320 KB Output is correct
14 Incorrect 84 ms 11316 KB Output isn't correct
15 Correct 38 ms 11212 KB Output is correct
16 Incorrect 40 ms 11212 KB Output isn't correct
17 Correct 44 ms 11212 KB Output is correct
18 Correct 41 ms 11212 KB Output is correct
19 Correct 40 ms 11236 KB Output is correct
20 Incorrect 39 ms 11132 KB Output isn't correct
21 Correct 41 ms 11204 KB Output is correct
22 Incorrect 39 ms 11212 KB Output isn't correct
23 Correct 40 ms 11236 KB Output is correct
24 Incorrect 39 ms 11256 KB Output isn't correct
25 Correct 42 ms 11260 KB Output is correct
26 Incorrect 51 ms 11212 KB Output isn't correct
27 Correct 52 ms 11268 KB Output is correct
28 Correct 39 ms 11212 KB Output is correct
29 Correct 38 ms 11272 KB Output is correct
30 Incorrect 46 ms 11272 KB Output isn't correct
31 Correct 54 ms 11212 KB Output is correct
32 Correct 39 ms 11212 KB Output is correct
33 Correct 50 ms 11396 KB Output is correct
34 Incorrect 50 ms 11468 KB Output isn't correct
35 Incorrect 102 ms 11532 KB Output isn't correct
36 Correct 55 ms 11520 KB Output is correct
37 Incorrect 56 ms 11408 KB Output isn't correct
38 Incorrect 104 ms 11568 KB Output isn't correct
39 Correct 55 ms 11556 KB Output is correct
40 Incorrect 61 ms 11656 KB Output isn't correct
41 Incorrect 123 ms 11608 KB Output isn't correct
42 Correct 63 ms 11596 KB Output is correct
43 Incorrect 60 ms 11596 KB Output isn't correct
44 Incorrect 135 ms 11656 KB Output isn't correct
45 Correct 75 ms 11632 KB Output is correct
46 Incorrect 83 ms 11636 KB Output isn't correct
47 Incorrect 146 ms 11720 KB Output isn't correct
48 Correct 89 ms 11688 KB Output is correct
49 Incorrect 75 ms 11576 KB Output isn't correct
50 Incorrect 186 ms 11736 KB Output isn't correct
51 Correct 81 ms 11648 KB Output is correct
52 Incorrect 78 ms 11692 KB Output isn't correct
53 Incorrect 212 ms 11804 KB Output isn't correct
54 Correct 85 ms 11796 KB Output is correct
55 Incorrect 82 ms 11716 KB Output isn't correct
56 Incorrect 229 ms 11824 KB Output isn't correct
57 Correct 89 ms 11732 KB Output is correct
58 Incorrect 89 ms 11712 KB Output isn't correct
59 Incorrect 261 ms 11936 KB Output isn't correct
60 Correct 102 ms 11912 KB Output is correct
61 Incorrect 98 ms 11832 KB Output isn't correct
62 Incorrect 297 ms 11916 KB Output isn't correct
63 Incorrect 343 ms 11912 KB Output isn't correct
64 Correct 391 ms 11924 KB Output is correct
65 Incorrect 380 ms 11872 KB Output isn't correct
66 Incorrect 330 ms 11860 KB Output isn't correct
67 Incorrect 364 ms 11844 KB Output isn't correct
68 Incorrect 211 ms 11908 KB Output isn't correct
69 Incorrect 208 ms 11968 KB Output isn't correct
70 Incorrect 210 ms 11896 KB Output isn't correct
71 Incorrect 210 ms 12004 KB Output isn't correct
72 Incorrect 203 ms 11860 KB Output isn't correct
73 Incorrect 184 ms 11924 KB Output isn't correct
74 Correct 219 ms 11984 KB Output is correct
75 Incorrect 219 ms 11904 KB Output isn't correct
76 Incorrect 194 ms 11924 KB Output isn't correct
77 Incorrect 221 ms 11924 KB Output isn't correct
78 Incorrect 215 ms 11984 KB Output isn't correct
79 Correct 185 ms 11904 KB Output is correct
80 Incorrect 168 ms 11916 KB Output isn't correct
81 Incorrect 198 ms 11948 KB Output isn't correct
82 Incorrect 184 ms 11900 KB Output isn't correct
83 Incorrect 230 ms 12084 KB Output isn't correct
84 Correct 221 ms 11984 KB Output is correct
85 Incorrect 226 ms 11940 KB Output isn't correct
86 Incorrect 274 ms 11928 KB Output isn't correct
87 Incorrect 265 ms 11948 KB Output isn't correct
88 Incorrect 247 ms 11924 KB Output isn't correct
89 Correct 250 ms 12020 KB Output is correct
90 Incorrect 248 ms 12056 KB Output isn't correct
91 Incorrect 271 ms 11972 KB Output isn't correct
92 Incorrect 239 ms 11900 KB Output isn't correct