oj.uz

답안 #442343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442343 2021-07-07T13:24:14 Z Haidara Mecho (IOI09_mecho) C++17
100 / 100
 241 ms 7232 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=0,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
100.0 / 100.0

# 결과 실행 시간 메모리 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 Correct 1 ms 844 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 168 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 Correct 1 ms 1100 KB Output is 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 972 KB Output is correct
21 Correct 1 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 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 1 ms 1228 KB Output is correct
32 Correct 2 ms 1228 KB Output is correct
33 Correct 12 ms 3404 KB Output is correct
34 Correct 12 ms 3412 KB Output is correct
35 Correct 35 ms 3416 KB Output is correct
36 Correct 14 ms 3764 KB Output is correct
37 Correct 15 ms 3788 KB Output is correct
38 Correct 45 ms 3672 KB Output is correct
39 Correct 18 ms 4044 KB Output is correct
40 Correct 18 ms 4024 KB Output is correct
41 Correct 58 ms 4072 KB Output is correct
42 Correct 21 ms 4384 KB Output is correct
43 Correct 21 ms 4492 KB Output is correct
44 Correct 75 ms 4380 KB Output is correct
45 Correct 26 ms 4812 KB Output is correct
46 Correct 26 ms 4852 KB Output is correct
47 Correct 89 ms 4840 KB Output is correct
48 Correct 30 ms 5128 KB Output is correct
49 Correct 30 ms 5060 KB Output is correct
50 Correct 105 ms 5196 KB Output is correct
51 Correct 35 ms 5528 KB Output is correct
52 Correct 34 ms 5516 KB Output is correct
53 Correct 139 ms 5552 KB Output is correct
54 Correct 41 ms 5772 KB Output is correct
55 Correct 40 ms 5836 KB Output is correct
56 Correct 157 ms 5912 KB Output is correct
57 Correct 46 ms 6212 KB Output is correct
58 Correct 45 ms 6212 KB Output is correct
59 Correct 186 ms 6392 KB Output is correct
60 Correct 51 ms 6568 KB Output is correct
61 Correct 65 ms 6564 KB Output is correct
62 Correct 217 ms 6552 KB Output is correct
63 Correct 155 ms 6616 KB Output is correct
64 Correct 225 ms 6612 KB Output is correct
65 Correct 241 ms 6560 KB Output is correct
66 Correct 175 ms 6612 KB Output is correct
67 Correct 176 ms 6596 KB Output is correct
68 Correct 91 ms 6664 KB Output is correct
69 Correct 90 ms 6596 KB Output is correct
70 Correct 78 ms 6640 KB Output is correct
71 Correct 80 ms 6628 KB Output is correct
72 Correct 67 ms 6584 KB Output is correct
73 Correct 74 ms 7048 KB Output is correct
74 Correct 106 ms 7108 KB Output is correct
75 Correct 117 ms 7108 KB Output is correct
76 Correct 123 ms 7232 KB Output is correct
77 Correct 124 ms 7168 KB Output is correct
78 Correct 133 ms 7104 KB Output is correct
79 Correct 94 ms 6972 KB Output is correct
80 Correct 114 ms 7220 KB Output is correct
81 Correct 133 ms 7052 KB Output is correct
82 Correct 115 ms 7108 KB Output is correct
83 Correct 149 ms 7032 KB Output is correct
84 Correct 139 ms 6992 KB Output is correct
85 Correct 146 ms 6900 KB Output is correct
86 Correct 139 ms 7032 KB Output is correct
87 Correct 144 ms 7080 KB Output is correct
88 Correct 141 ms 6892 KB Output is correct
89 Correct 158 ms 6932 KB Output is correct
90 Correct 163 ms 7028 KB Output is correct
91 Correct 157 ms 6864 KB Output is correct
92 Correct 155 ms 6932 KB Output is correct