oj.uz

Submission #442325

# Submission time Handle Problem Language Result Execution time Memory
442325 2021-07-07T12:59:16 Z Haidara Mecho (IOI09_mecho) C++17
58 / 100
 226 ms 7164 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;
    queue<pii>q;
    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';
    }
    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)&&dist[x][y]==inf)
                    dist[x][y]=dist[f.ff][f.ss]+jump,q.push({x,y});
            }
        }
    }
    bool check(int st)
    {
        queue<p(pii,int)>qq;
        qq.push({M,st*jump});
        bool vis[maxn][maxn];
        FOR(i,maxn)
        FOR(j,maxn)
        vis[i][j]=0;
        bool ret=0;
        vis[M.ff][M.ss]=1;
        while(qq.size())
        {
            pii f=qq.front().ff;
            int curr=qq.front().ss;
            qq.pop();
            if(f==D)
                ret=1;
            FOR(i,4)
            {
                int x=f.ff+dx[i],y=f.ss+dy[i];
                if(valid(x,y))
                {
                    if(dist[x][y]>curr+1&&!vis[x][y])
                        qq.push({{x,y},curr+1}),vis[x][y]=1;
                }
            }
        }
        return ret;
    }
    signed main()
    {
        SIO("");
        cin>>n>>jump;
        FOR(i,n){
          cin>>ws;
        FOR(j,n)
        {
            dist[i][j]=inf;
            cin>>a[i][j];
            if(a[i][j]=='M')
                M= {i,j};
            else if(a[i][j]=='D')
                D= {i,j};
            else if(a[i][j]=='H')
                q.push({i,j}),dist[i][j]=0;
        }}
        solve();
        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:20: 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:20: 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
58.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 844 KB Output is correct
2 Incorrect 1 ms 844 KB Output isn't correct
3 Correct 1 ms 844 KB Output is correct
4 Incorrect 1 ms 844 KB Output isn't correct
5 Incorrect 1 ms 972 KB Output isn't correct
6 Incorrect 1 ms 972 KB Output isn't correct
7 Incorrect 153 ms 6832 KB Output isn't correct
8 Correct 2 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 Incorrect 2 ms 1228 KB Output isn't correct
13 Incorrect 2 ms 1100 KB Output isn't correct
14 Correct 3 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 2 ms 1100 KB Output is correct
20 Correct 1 ms 972 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 2 ms 1100 KB Output is correct
24 Correct 2 ms 1100 KB Output is correct
25 Correct 2 ms 1248 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1176 KB Output is correct
28 Correct 2 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 13 ms 3428 KB Output is correct
34 Correct 13 ms 3360 KB Output is correct
35 Correct 37 ms 3392 KB Output is correct
36 Correct 16 ms 3688 KB Output is correct
37 Correct 16 ms 3780 KB Output is correct
38 Correct 47 ms 3676 KB Output is correct
39 Correct 18 ms 4044 KB Output is correct
40 Correct 18 ms 4044 KB Output is correct
41 Correct 60 ms 4144 KB Output is correct
42 Correct 22 ms 4496 KB Output is correct
43 Correct 23 ms 4484 KB Output is correct
44 Correct 73 ms 4480 KB Output is correct
45 Correct 27 ms 4764 KB Output is correct
46 Correct 29 ms 4760 KB Output is correct
47 Correct 92 ms 4840 KB Output is correct
48 Correct 31 ms 5072 KB Output is correct
49 Correct 30 ms 5104 KB Output is correct
50 Correct 109 ms 5188 KB Output is correct
51 Correct 35 ms 5444 KB Output is correct
52 Correct 37 ms 5472 KB Output is correct
53 Correct 137 ms 5556 KB Output is correct
54 Correct 41 ms 5836 KB Output is correct
55 Correct 43 ms 5828 KB Output is correct
56 Correct 165 ms 5796 KB Output is correct
57 Correct 47 ms 6244 KB Output is correct
58 Correct 49 ms 6212 KB Output is correct
59 Correct 188 ms 6280 KB Output is correct
60 Correct 62 ms 6604 KB Output is correct
61 Correct 58 ms 6596 KB Output is correct
62 Correct 211 ms 6724 KB Output is correct
63 Incorrect 141 ms 6504 KB Output isn't correct
64 Correct 226 ms 6724 KB Output is correct
65 Correct 220 ms 6620 KB Output is correct
66 Correct 168 ms 6616 KB Output is correct
67 Correct 172 ms 6620 KB Output is correct
68 Incorrect 89 ms 6644 KB Output isn't correct
69 Correct 85 ms 6668 KB Output is correct
70 Correct 81 ms 6596 KB Output is correct
71 Correct 78 ms 6608 KB Output is correct
72 Incorrect 70 ms 6596 KB Output isn't correct
73 Incorrect 72 ms 7164 KB Output isn't correct
74 Correct 108 ms 7108 KB Output is correct
75 Correct 115 ms 7108 KB Output is correct
76 Correct 119 ms 7104 KB Output is correct
77 Correct 112 ms 7104 KB Output is correct
78 Correct 136 ms 7108 KB Output is correct
79 Correct 93 ms 7036 KB Output is correct
80 Correct 115 ms 7100 KB Output is correct
81 Correct 126 ms 6980 KB Output is correct
82 Correct 107 ms 6988 KB Output is correct
83 Incorrect 137 ms 7028 KB Output isn't correct
84 Correct 123 ms 6976 KB Output is correct
85 Correct 125 ms 6964 KB Output is correct
86 Correct 143 ms 6980 KB Output is correct
87 Correct 143 ms 7024 KB Output is correct
88 Incorrect 144 ms 6876 KB Output isn't correct
89 Correct 151 ms 6892 KB Output is correct
90 Correct 155 ms 6872 KB Output is correct
91 Correct 175 ms 6932 KB Output is correct
92 Correct 145 ms 6932 KB Output is correct