oj.uz

Submission #442338

# Submission time Handle Problem Language Result Execution time Memory
442338 2021-07-07T13:17:33 Z Haidara Mecho (IOI09_mecho) C++17
79 / 100
 220 ms 7184 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<<62LL;
const int mod=1e9+7;
const int maxn=808;
char a[maxn][maxn];
int n,jump;
pii M,D;
int dist[maxn][maxn],dx[] {-1,1,0,0},dy[] {0,0,1,-1};
bool valid(int x,int y)
{
    return x>=0&&y>=0&&x<n&&y<n&&a[x][y]!='T'&&a[x][y]!='H';
}
bool check(int st)
{
    queue<p(pii,int)>q;
    if(st*jump>=dist[M.ff][M.ss])
        return 0;
    q.push({M,st*jump});
    bool vis[maxn][maxn];
    FOR(i,maxn)
    FOR(j,maxn)
    vis[i][j]=0;
    vis[M.ff][M.ss]=1;
    while(q.size())
    {
        pii f=q.front().ff;
        int curr=q.front().ss;
        q.pop();
        if(f==D)
            return 1;
        FOR(i,4)
        {
            int x=f.ff+dx[i],y=f.ss+dy[i];
            if(!valid(x,y)||dist[x][y]<=curr+1||vis[x][y])
                continue;
            q.push({{x,y},curr+1}),vis[x][y]=1;
        }
    }
    return 0;
}
signed main()
{
    SIO("");
    cin>>n>>jump;
    queue<pii>q;
    FOR(i,n)
    {
        cin>>ws;
        FOR(j,n)
        {
            dist[i][j]=inf;
            cin>>a[i][j];
            if(a[i][j]=='M')
                M= {i,j},a[i][j]='G';
            else if(a[i][j]=='D')
                D= {i,j};
            else if(a[i][j]=='H')
                q.push({i,j}),dist[i][j]=0;
        }
    }
    while(q.size())
    {
        pii f=q.front();
        q.pop();
        FOR(i,4)
        {
            int x=f.ff+dx[i],y=f.ss+dy[i];
            if(x>=0&&y>=0&&x<n&&y<n&&a[x][y]=='G'&&dist[x][y]==inf)
                dist[x][y]=dist[f.ff][f.ss]+jump,q.push({x,y});
        }
    }
    int l=1,r=maxn*maxn*2,ans=-1;
    while(l<=r)
    {
        int mid=l+(r-l)/2;
        if(check(mid))
            ans=max(ans,mid),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
79.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Incorrect 1 ms 972 KB Output isn't correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 170 ms 6828 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 1 ms 972 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Incorrect 1 ms 1100 KB Output isn't correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 1 ms 972 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 972 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 1 ms 1100 KB Output is correct
25 Correct 1 ms 1228 KB Output is correct
26 Correct 1 ms 1228 KB Output is correct
27 Correct 1 ms 1228 KB Output is correct
28 Correct 1 ms 1228 KB Output is correct
29 Correct 2 ms 1228 KB Output is correct
30 Correct 2 ms 1228 KB Output is correct
31 Correct 2 ms 1228 KB Output is correct
32 Correct 2 ms 1228 KB Output is correct
33 Correct 11 ms 3400 KB Output is correct
34 Correct 13 ms 3404 KB Output is correct
35 Correct 36 ms 3336 KB Output is correct
36 Correct 14 ms 3660 KB Output is correct
37 Correct 14 ms 3676 KB Output is correct
38 Correct 46 ms 3792 KB Output is correct
39 Correct 17 ms 4136 KB Output is correct
40 Correct 18 ms 4152 KB Output is correct
41 Correct 60 ms 4096 KB Output is correct
42 Correct 21 ms 4364 KB Output is correct
43 Correct 21 ms 4452 KB Output is correct
44 Correct 73 ms 4500 KB Output is correct
45 Correct 25 ms 4744 KB Output is correct
46 Correct 26 ms 4800 KB Output is correct
47 Correct 91 ms 4804 KB Output is correct
48 Correct 30 ms 5064 KB Output is correct
49 Correct 32 ms 5076 KB Output is correct
50 Correct 106 ms 5200 KB Output is correct
51 Correct 35 ms 5460 KB Output is correct
52 Correct 38 ms 5452 KB Output is correct
53 Correct 132 ms 5448 KB Output is correct
54 Correct 40 ms 5792 KB Output is correct
55 Correct 40 ms 5896 KB Output is correct
56 Correct 154 ms 5828 KB Output is correct
57 Correct 46 ms 6212 KB Output is correct
58 Correct 46 ms 6184 KB Output is correct
59 Correct 178 ms 6180 KB Output is correct
60 Correct 51 ms 6596 KB Output is correct
61 Correct 51 ms 6608 KB Output is correct
62 Correct 207 ms 6600 KB Output is correct
63 Incorrect 146 ms 6736 KB Output isn't correct
64 Correct 220 ms 6724 KB Output is correct
65 Correct 213 ms 6500 KB Output is correct
66 Correct 166 ms 6540 KB Output is correct
67 Correct 171 ms 6596 KB Output is correct
68 Incorrect 91 ms 6596 KB Output isn't correct
69 Correct 84 ms 6548 KB Output is correct
70 Correct 82 ms 6596 KB Output is correct
71 Correct 82 ms 6636 KB Output is correct
72 Correct 69 ms 6544 KB Output is correct
73 Correct 73 ms 7032 KB Output is correct
74 Correct 103 ms 7108 KB Output is correct
75 Correct 118 ms 7164 KB Output is correct
76 Correct 120 ms 7152 KB Output is correct
77 Correct 122 ms 7184 KB Output is correct
78 Correct 129 ms 6980 KB Output is correct
79 Correct 92 ms 7024 KB Output is correct
80 Correct 109 ms 7108 KB Output is correct
81 Correct 123 ms 6980 KB Output is correct
82 Correct 114 ms 6980 KB Output is correct
83 Incorrect 140 ms 6976 KB Output isn't correct
84 Correct 125 ms 6948 KB Output is correct
85 Correct 126 ms 6984 KB Output is correct
86 Correct 150 ms 7024 KB Output is correct
87 Correct 158 ms 6988 KB Output is correct
88 Incorrect 150 ms 6852 KB Output isn't correct
89 Correct 165 ms 6812 KB Output is correct
90 Correct 172 ms 6864 KB Output is correct
91 Correct 149 ms 6868 KB Output is correct
92 Correct 152 ms 6932 KB Output is correct