oj.uz

답안 #1119722

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119722 2024-11-27T10:38:28 Z sktodow Mecho (IOI09_mecho) C++17
73 / 100
 242 ms 8368 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){
        memset(mec,-1,sizeof(mec));
        chc=mecho(mid*(x));
        // cout<<mid<<" "<<chc<<endl;
        if(chc){l=mid+1;achc=1;}
        else{r=mid-1;}
        
        // 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;}
    if(!achc){cout<<-1;}
    else{cout<<l-1;}
    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 6 ms 6000 KB Output isn't correct
3 Correct 5 ms 6224 KB Output is correct
4 Incorrect 7 ms 6224 KB Output isn't correct
5 Correct 6 ms 6180 KB Output is correct
6 Incorrect 7 ms 6224 KB Output isn't correct
7 Incorrect 143 ms 7272 KB Output isn't correct
8 Correct 6 ms 6224 KB Output is correct
9 Correct 6 ms 6224 KB Output is correct
10 Correct 6 ms 6388 KB Output is correct
11 Correct 5 ms 6224 KB Output is correct
12 Incorrect 7 ms 6236 KB Output isn't correct
13 Incorrect 7 ms 6224 KB Output isn't correct
14 Correct 6 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 6396 KB Output is correct
18 Correct 6 ms 6224 KB Output is correct
19 Correct 5 ms 6108 KB Output is correct
20 Correct 7 ms 6388 KB Output is correct
21 Correct 6 ms 6224 KB Output is correct
22 Correct 7 ms 6224 KB Output is correct
23 Correct 6 ms 6224 KB Output is correct
24 Correct 6 ms 6204 KB Output is correct
25 Correct 6 ms 6224 KB Output is correct
26 Correct 6 ms 6224 KB Output is correct
27 Correct 6 ms 6224 KB Output is correct
28 Correct 6 ms 6008 KB Output is correct
29 Correct 6 ms 6224 KB Output is correct
30 Correct 7 ms 6224 KB Output is correct
31 Correct 6 ms 6084 KB Output is correct
32 Correct 6 ms 6012 KB Output is correct
33 Correct 9 ms 6224 KB Output is correct
34 Correct 9 ms 6224 KB Output is correct
35 Correct 40 ms 6224 KB Output is correct
36 Correct 10 ms 6224 KB Output is correct
37 Correct 11 ms 6224 KB Output is correct
38 Correct 44 ms 6288 KB Output is correct
39 Correct 10 ms 6224 KB Output is correct
40 Correct 11 ms 6204 KB Output is correct
41 Correct 55 ms 6224 KB Output is correct
42 Correct 13 ms 6480 KB Output is correct
43 Correct 12 ms 6260 KB Output is correct
44 Correct 75 ms 6256 KB Output is correct
45 Correct 12 ms 6480 KB Output is correct
46 Correct 15 ms 6300 KB Output is correct
47 Correct 95 ms 6480 KB Output is correct
48 Correct 17 ms 6480 KB Output is correct
49 Correct 17 ms 6360 KB Output is correct
50 Correct 100 ms 6480 KB Output is correct
51 Correct 19 ms 6480 KB Output is correct
52 Correct 21 ms 6424 KB Output is correct
53 Correct 146 ms 6480 KB Output is correct
54 Correct 22 ms 6480 KB Output is correct
55 Correct 18 ms 6480 KB Output is correct
56 Correct 144 ms 6504 KB Output is correct
57 Correct 22 ms 6736 KB Output is correct
58 Correct 24 ms 6628 KB Output is correct
59 Correct 199 ms 6736 KB Output is correct
60 Correct 22 ms 6640 KB Output is correct
61 Correct 23 ms 6632 KB Output is correct
62 Correct 222 ms 6656 KB Output is correct
63 Correct 126 ms 6736 KB Output is correct
64 Correct 242 ms 6632 KB Output is correct
65 Correct 194 ms 6628 KB Output is correct
66 Correct 151 ms 6736 KB Output is correct
67 Correct 158 ms 6632 KB Output is correct
68 Correct 60 ms 6708 KB Output is correct
69 Correct 59 ms 6720 KB Output is correct
70 Correct 49 ms 6720 KB Output is correct
71 Correct 51 ms 6724 KB Output is correct
72 Incorrect 45 ms 6716 KB Output isn't correct
73 Incorrect 93 ms 8268 KB Output isn't correct
74 Correct 106 ms 8368 KB Output is correct
75 Correct 130 ms 8272 KB Output is correct
76 Correct 108 ms 8264 KB Output is correct
77 Correct 129 ms 8264 KB Output is correct
78 Correct 141 ms 8140 KB Output is correct
79 Correct 97 ms 8140 KB Output is correct
80 Correct 107 ms 8140 KB Output is correct
81 Correct 117 ms 8100 KB Output is correct
82 Correct 127 ms 8264 KB Output is correct
83 Correct 168 ms 8072 KB Output is correct
84 Correct 129 ms 8056 KB Output is correct
85 Correct 142 ms 8068 KB Output is correct
86 Correct 157 ms 7868 KB Output is correct
87 Correct 155 ms 8008 KB Output is correct
88 Correct 174 ms 7752 KB Output is correct
89 Correct 157 ms 7568 KB Output is correct
90 Correct 172 ms 7756 KB Output is correct
91 Correct 160 ms 7760 KB Output is correct
92 Correct 158 ms 7592 KB Output is correct