oj.uz

답안 #1119666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119666 2024-11-27T09:45:13 Z sktodow Mecho (IOI09_mecho) C++17
84 / 100
 258 ms 8272 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
// #define int long long int
#define pb push_back
#define mid (l+(r-l)/2)
#define f first
#define s second
static const int N=805;
static const long long int MOD=(1LL<<61)-1;
static const long long int inf=INT64_MAX;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
 
void io(string name = ""){ 
    freopen((name+".in").c_str(), "r", stdin);
    freopen((name+".out").c_str(), "w", stdout);
}

int n,x,mx,my;
vector<vector<char>>v(N,vector<char>(N));
vector<vector<int>>bee(N,vector<int>(N,-1));
int mec[N][N];
int dx[4]={0,-1,0,1};
int dy[4]={-1,0,1,0};

bool inside(int a,int b){return ((a<=n && a>0)&&(b<=n && b>0)&&v[a][b]!='T');}

void calcbee(){
    queue<array<int,3>>q;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(v[i][j]=='H'){q.push({i,j,0});}
        }
    }
    while(q.size()){
        array<int,3>curr=q.front();
        q.pop();
        if(bee[curr[0]][curr[1]]!=-1){continue;}
        bee[curr[0]][curr[1]]=curr[2];
        for(int i=0;i<4;i++){
            if(inside(curr[0]+dx[i],curr[1]+dy[i])){
                q.push({curr[0]+dx[i],curr[1]+dy[i],curr[2]+1});
            }
        }
    }
}

bool mecho(int k){
    queue<array<int,3>>q;
    q.push({mx,my,k});
    while(q.size()){
        array<int,3>curr=q.front();
        q.pop();
        if(mec[curr[0]][curr[1]]!=-1){continue;}
        
        mec[curr[0]][curr[1]]=curr[2];
        if(v[curr[0]][curr[1]]=='D'){return 1;}
        for(int i=0;i<4;i++){
            if(inside(curr[0]+dx[i],curr[1]+dy[i]) && bee[curr[0]+dx[i]][curr[1]+dy[i]]>(curr[2]+1)/x){
                q.push({curr[0]+dx[i],curr[1]+dy[i],curr[2]+1});
            }
        }
    }
    return 0;
}

int32_t main(){
    //io("local");
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    cin>>n>>x;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>v[i][j];
            if(v[i][j]=='M'){mx=i,my=j;}
        }
    }
    calcbee();
    // for(int i=1;i<=n;i++){
    //     for(int j=1;j<=n;j++){cout<<bee[i][j]<<" ";}
    //     cout<<endl;
    // }
    int l=0,r=bee[mx][my];
    bool chc=0,achc=0;
    while(l<r-1){
        memset(mec,-1,sizeof(mec));
        chc=mecho(mid*(x));
        // cout<<mid<<" "<<chc<<endl;
        if(chc){l=mid;achc=1;}
        else{r=mid;}
        
        // for(int i=1;i<=n;i++){
        //     for(int j=1;j<=n;j++){cout<<mec[i][j]<<" ";}
        //     cout<<endl;
        // }
        // cout<<endl;
    }
    memset(mec,-1,sizeof(mec));
    if(!achc && mecho(0)){cout<<0;}
    else if(!achc){cout<<-1;}
    else{cout<<l;}
    return 0;
}

Compilation message

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

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6224 KB Output is correct
2 Incorrect 6 ms 6232 KB Output isn't correct
3 Correct 6 ms 6392 KB Output is correct
4 Incorrect 5 ms 6224 KB Output isn't correct
5 Correct 5 ms 6224 KB Output is correct
6 Incorrect 6 ms 6088 KB Output isn't correct
7 Incorrect 204 ms 7496 KB Output isn't correct
8 Correct 7 ms 6224 KB Output is correct
9 Correct 6 ms 6224 KB Output is correct
10 Correct 6 ms 6244 KB Output is correct
11 Correct 6 ms 6224 KB Output is correct
12 Incorrect 6 ms 6224 KB Output isn't correct
13 Correct 6 ms 6224 KB Output is correct
14 Correct 7 ms 6168 KB Output is correct
15 Correct 6 ms 6224 KB Output is correct
16 Correct 7 ms 6224 KB Output is correct
17 Correct 7 ms 6224 KB Output is correct
18 Correct 7 ms 6224 KB Output is correct
19 Correct 8 ms 6224 KB Output is correct
20 Correct 9 ms 6224 KB Output is correct
21 Correct 6 ms 6396 KB Output is correct
22 Correct 6 ms 6224 KB Output is correct
23 Correct 7 ms 6224 KB Output is correct
24 Correct 6 ms 6224 KB Output is correct
25 Correct 7 ms 6224 KB Output is correct
26 Correct 6 ms 6224 KB Output is correct
27 Correct 8 ms 6056 KB Output is correct
28 Correct 7 ms 6224 KB Output is correct
29 Correct 7 ms 6224 KB Output is correct
30 Correct 7 ms 6240 KB Output is correct
31 Correct 6 ms 6224 KB Output is correct
32 Correct 7 ms 6224 KB Output is correct
33 Correct 11 ms 6224 KB Output is correct
34 Correct 11 ms 6144 KB Output is correct
35 Correct 43 ms 6224 KB Output is correct
36 Correct 12 ms 6224 KB Output is correct
37 Correct 14 ms 6376 KB Output is correct
38 Correct 43 ms 6236 KB Output is correct
39 Correct 15 ms 6224 KB Output is correct
40 Correct 13 ms 6240 KB Output is correct
41 Correct 61 ms 6224 KB Output is correct
42 Correct 13 ms 6480 KB Output is correct
43 Correct 14 ms 6480 KB Output is correct
44 Correct 88 ms 6492 KB Output is correct
45 Correct 14 ms 6480 KB Output is correct
46 Correct 16 ms 6336 KB Output is correct
47 Correct 98 ms 6472 KB Output is correct
48 Correct 19 ms 6480 KB Output is correct
49 Correct 16 ms 6588 KB Output is correct
50 Correct 124 ms 6480 KB Output is correct
51 Correct 19 ms 6736 KB Output is correct
52 Correct 17 ms 6480 KB Output is correct
53 Correct 152 ms 6680 KB Output is correct
54 Correct 19 ms 6496 KB Output is correct
55 Correct 23 ms 6480 KB Output is correct
56 Correct 178 ms 6736 KB Output is correct
57 Correct 20 ms 6736 KB Output is correct
58 Correct 21 ms 6788 KB Output is correct
59 Correct 188 ms 6736 KB Output is correct
60 Correct 21 ms 6736 KB Output is correct
61 Correct 25 ms 6632 KB Output is correct
62 Correct 258 ms 6744 KB Output is correct
63 Correct 127 ms 6640 KB Output is correct
64 Correct 212 ms 6644 KB Output is correct
65 Correct 197 ms 6628 KB Output is correct
66 Correct 176 ms 6736 KB Output is correct
67 Correct 163 ms 6632 KB Output is correct
68 Correct 76 ms 6716 KB Output is correct
69 Correct 58 ms 6732 KB Output is correct
70 Correct 53 ms 6728 KB Output is correct
71 Correct 59 ms 6736 KB Output is correct
72 Correct 42 ms 6744 KB Output is correct
73 Correct 63 ms 8264 KB Output is correct
74 Correct 135 ms 8268 KB Output is correct
75 Correct 147 ms 8268 KB Output is correct
76 Correct 120 ms 8264 KB Output is correct
77 Correct 143 ms 8272 KB Output is correct
78 Correct 158 ms 8140 KB Output is correct
79 Correct 106 ms 8200 KB Output is correct
80 Correct 115 ms 8148 KB Output is correct
81 Correct 143 ms 8100 KB Output is correct
82 Correct 120 ms 8096 KB Output is correct
83 Correct 172 ms 8016 KB Output is correct
84 Correct 144 ms 7844 KB Output is correct
85 Correct 128 ms 8052 KB Output is correct
86 Correct 173 ms 7676 KB Output is correct
87 Correct 142 ms 7848 KB Output is correct
88 Correct 194 ms 7752 KB Output is correct
89 Correct 172 ms 7812 KB Output is correct
90 Correct 201 ms 7580 KB Output is correct
91 Correct 195 ms 7752 KB Output is correct
92 Correct 206 ms 7760 KB Output is correct