oj.uz

Submission #442341

# Submission time Handle Problem Language Result Execution time Memory
442341 2021-07-07T13:20:24 Z Haidara Mecho (IOI09_mecho) C++17
79 / 100
 230 ms 7116 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 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(x<0||y<0||x>=n||y>=n||a[x][y]=='T'||a[x][y]=='H'||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||x>=n||y<0||y>=n||a[x][y]!='G'||dist[x][y]!=inf)
                continue;
            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 164 ms 6816 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 972 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 1 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 1 ms 1228 KB Output is correct
33 Correct 11 ms 3404 KB Output is correct
34 Correct 11 ms 3404 KB Output is correct
35 Correct 36 ms 3428 KB Output is correct
36 Correct 15 ms 3720 KB Output is correct
37 Correct 14 ms 3784 KB Output is correct
38 Correct 46 ms 3788 KB Output is correct
39 Correct 17 ms 4136 KB Output is correct
40 Correct 17 ms 4080 KB Output is correct
41 Correct 59 ms 4132 KB Output is correct
42 Correct 21 ms 4388 KB Output is correct
43 Correct 21 ms 4360 KB Output is correct
44 Correct 78 ms 4488 KB Output is correct
45 Correct 25 ms 4748 KB Output is correct
46 Correct 26 ms 4816 KB Output is correct
47 Correct 88 ms 4812 KB Output is correct
48 Correct 29 ms 5132 KB Output is correct
49 Correct 29 ms 5188 KB Output is correct
50 Correct 108 ms 5192 KB Output is correct
51 Correct 34 ms 5444 KB Output is correct
52 Correct 34 ms 5520 KB Output is correct
53 Correct 138 ms 5644 KB Output is correct
54 Correct 40 ms 5876 KB Output is correct
55 Correct 40 ms 5892 KB Output is correct
56 Correct 168 ms 5844 KB Output is correct
57 Correct 45 ms 6248 KB Output is correct
58 Correct 45 ms 6128 KB Output is correct
59 Correct 191 ms 6196 KB Output is correct
60 Correct 52 ms 6596 KB Output is correct
61 Correct 51 ms 6552 KB Output is correct
62 Correct 204 ms 6628 KB Output is correct
63 Incorrect 142 ms 6556 KB Output isn't correct
64 Correct 230 ms 6616 KB Output is correct
65 Correct 217 ms 6504 KB Output is correct
66 Correct 174 ms 6608 KB Output is correct
67 Correct 173 ms 6616 KB Output is correct
68 Incorrect 90 ms 6544 KB Output isn't correct
69 Correct 83 ms 6660 KB Output is correct
70 Correct 88 ms 6656 KB Output is correct
71 Correct 78 ms 6604 KB Output is correct
72 Correct 68 ms 6560 KB Output is correct
73 Correct 76 ms 7100 KB Output is correct
74 Correct 102 ms 7116 KB Output is correct
75 Correct 115 ms 7084 KB Output is correct
76 Correct 113 ms 7108 KB Output is correct
77 Correct 115 ms 7084 KB Output is correct
78 Correct 134 ms 7036 KB Output is correct
79 Correct 92 ms 7092 KB Output is correct
80 Correct 109 ms 7052 KB Output is correct
81 Correct 119 ms 7036 KB Output is correct
82 Correct 111 ms 7108 KB Output is correct
83 Incorrect 141 ms 6936 KB Output isn't correct
84 Correct 124 ms 6964 KB Output is correct
85 Correct 127 ms 6976 KB Output is correct
86 Correct 154 ms 6980 KB Output is correct
87 Correct 145 ms 6980 KB Output is correct
88 Incorrect 139 ms 6844 KB Output isn't correct
89 Correct 155 ms 6868 KB Output is correct
90 Correct 160 ms 7056 KB Output is correct
91 Correct 154 ms 6936 KB Output is correct
92 Correct 140 ms 6924 KB Output is correct