oj.uz

답안 #1119714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119714 2024-11-27T10:20:44 Z sktodow Mecho (IOI09_mecho) C++17
73 / 100
 242 ms 8488 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=n*n;
    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;
        // for(int i=1;i<=n;i++){
        //     for(int j=1;j<=n;j++){cout<<mec[i][j]<<" ";}
        //     cout<<endl;
        // }
        // cout<<endl;
    }
    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
73.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6224 KB Output is correct
2 Incorrect 7 ms 6224 KB Output isn't correct
3 Correct 5 ms 6224 KB Output is correct
4 Incorrect 7 ms 6028 KB Output isn't correct
5 Correct 6 ms 6236 KB Output is correct
6 Incorrect 6 ms 6316 KB Output isn't correct
7 Incorrect 171 ms 7496 KB Output isn't correct
8 Correct 7 ms 6032 KB Output is correct
9 Correct 7 ms 6224 KB Output is correct
10 Correct 6 ms 6396 KB Output is correct
11 Correct 7 ms 6224 KB Output is correct
12 Incorrect 7 ms 6224 KB Output isn't correct
13 Incorrect 7 ms 6224 KB Output isn't correct
14 Correct 7 ms 6224 KB Output is correct
15 Correct 6 ms 6224 KB Output is correct
16 Correct 6 ms 6224 KB Output is correct
17 Correct 6 ms 6224 KB Output is correct
18 Correct 7 ms 6224 KB Output is correct
19 Correct 6 ms 6224 KB Output is correct
20 Correct 6 ms 6224 KB Output is correct
21 Correct 7 ms 6224 KB Output is correct
22 Correct 6 ms 6224 KB Output is correct
23 Correct 6 ms 6012 KB Output is correct
24 Correct 6 ms 6224 KB Output is correct
25 Correct 6 ms 6224 KB Output is correct
26 Correct 6 ms 6224 KB Output is correct
27 Correct 7 ms 6224 KB Output is correct
28 Correct 7 ms 6224 KB Output is correct
29 Correct 6 ms 6064 KB Output is correct
30 Correct 6 ms 6224 KB Output is correct
31 Correct 7 ms 6224 KB Output is correct
32 Correct 6 ms 6224 KB Output is correct
33 Correct 10 ms 6224 KB Output is correct
34 Correct 10 ms 6120 KB Output is correct
35 Correct 35 ms 6124 KB Output is correct
36 Correct 12 ms 6224 KB Output is correct
37 Correct 13 ms 6224 KB Output is correct
38 Correct 53 ms 6224 KB Output is correct
39 Correct 13 ms 6224 KB Output is correct
40 Correct 13 ms 6236 KB Output is correct
41 Correct 60 ms 6224 KB Output is correct
42 Correct 16 ms 6480 KB Output is correct
43 Correct 18 ms 6480 KB Output is correct
44 Correct 75 ms 6308 KB Output is correct
45 Correct 13 ms 6652 KB Output is correct
46 Correct 15 ms 6376 KB Output is correct
47 Correct 84 ms 6568 KB Output is correct
48 Correct 21 ms 6480 KB Output is correct
49 Correct 15 ms 6652 KB Output is correct
50 Correct 119 ms 6612 KB Output is correct
51 Correct 18 ms 6480 KB Output is correct
52 Correct 16 ms 6420 KB Output is correct
53 Correct 145 ms 6660 KB Output is correct
54 Correct 18 ms 6648 KB Output is correct
55 Correct 19 ms 6736 KB Output is correct
56 Correct 159 ms 6740 KB Output is correct
57 Correct 25 ms 6736 KB Output is correct
58 Correct 26 ms 6736 KB Output is correct
59 Correct 242 ms 6728 KB Output is correct
60 Correct 24 ms 6632 KB Output is correct
61 Correct 21 ms 6632 KB Output is correct
62 Correct 234 ms 6668 KB Output is correct
63 Correct 133 ms 6736 KB Output is correct
64 Correct 214 ms 6632 KB Output is correct
65 Correct 176 ms 6620 KB Output is correct
66 Correct 152 ms 6636 KB Output is correct
67 Correct 156 ms 6612 KB Output is correct
68 Correct 70 ms 6736 KB Output is correct
69 Correct 53 ms 6728 KB Output is correct
70 Correct 63 ms 6728 KB Output is correct
71 Correct 53 ms 6728 KB Output is correct
72 Incorrect 39 ms 6736 KB Output isn't correct
73 Incorrect 71 ms 8488 KB Output isn't correct
74 Correct 106 ms 8260 KB Output is correct
75 Correct 127 ms 8364 KB Output is correct
76 Correct 134 ms 8268 KB Output is correct
77 Correct 128 ms 8264 KB Output is correct
78 Correct 169 ms 8140 KB Output is correct
79 Correct 83 ms 8140 KB Output is correct
80 Correct 125 ms 8140 KB Output is correct
81 Correct 141 ms 8268 KB Output is correct
82 Correct 113 ms 8264 KB Output is correct
83 Correct 172 ms 8008 KB Output is correct
84 Correct 151 ms 8012 KB Output is correct
85 Correct 156 ms 8008 KB Output is correct
86 Correct 157 ms 7748 KB Output is correct
87 Correct 136 ms 8064 KB Output is correct
88 Correct 168 ms 7764 KB Output is correct
89 Correct 185 ms 7792 KB Output is correct
90 Correct 188 ms 7796 KB Output is correct
91 Correct 158 ms 7576 KB Output is correct
92 Correct 155 ms 7580 KB Output is correct