oj.uz

Submission #906636

# Submission time Handle Problem Language Result Execution time Memory
906636 2024-01-14T15:24:35 Z tosivanmak Mecho (IOI09_mecho) C++17
70 / 100
 706 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll int
 
ll dx[4]={0,0,1,-1};
ll dy[4]={1,-1,0,0};
vector<pair<short,short> >pos;
struct Graph{
 bool vis[802][802];
 ll dist[802][802];
    vector<pair<short,short> >adj[802][802];
 queue<pair<short,short> >q;
    void init(ll n){
        for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++){
                    dist[i][j]=1e9;
                }
            }
    }
    void add_edge(ll r, ll c, ll r2, ll c2){
        adj[r][c].push_back({r2,c2});
    }
 void bfs(){
   for(auto& u: pos){
      vis[u.first][u.second]=1;
       dist[u.first][u.second]=0;
       q.push({u.first,u.second});
   }
   while(!q.empty()){
       pair<ll,ll>cur=q.front();
       q.pop();
       for(auto& u: adj[cur.first][cur.second]){
           if(!vis[u.first][u.second]){
               vis[u.first][u.second]=1;
               dist[u.first][u.second]=dist[cur.first][cur.second]+1;
               q.push(u);
           }
       }
   }
}
}gp2;
struct Graph2{
 bool vis[802][802];
    vector<pair<short,short> >adj[802][802];
 queue<pair<short,short> >q;
    ll bees[802][802];
    ll dist[802][802];
    void add_edge(ll r, ll c, ll r2, ll c2){
        adj[r][c].push_back({r2,c2});
    }
 void bfs(ll r, ll c, ll para, ll divi){
     vis[r][c]=1;
     dist[r][c]=0;
     q.push({r,c});
   while(!q.empty()){
       pair<ll,ll>cur=q.front();
       q.pop();
       for(auto& u: adj[cur.first][cur.second]){
           // cout<<bees[u.first][u.second]<<'\n';
           // cout<<dist[cur.first][cur.second]+1<<" "<<(ll)(divi+1)*(ll)bees[u.first][u.second]-(ll)1<<'\n';
           long long lol=divi;
           lol*=((long long)bees[u.first][u.second]-(long long)para);
           lol--;
           long long lol2=dist[cur.first][cur.second];
           lol2++;
           // cout<<lol<<'\n';
           // if(lol<0){
           //     cout<<divi+1<<" "<<bees[u.first][u.second]<<'\n';
           // }
           if(!vis[u.first][u.second]&&(lol2<=lol)){
               // cout<<u.first<<" "<<u.second<<'\n';
               vis[u.first][u.second]=1;
               dist[u.first][u.second]=dist[cur.first][cur.second]+1;
               q.push(u);
           }
       }
   }
 }
    void clear(ll n){
        for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++){
                    // cout<<bees[i][j]<<" ";
                    vis[i][j]=0;
                    dist[i][j]=1e9;
                }
            // cout<<'\n';
            }
        }
    bool ck(ll r, ll c, ll n, ll par, ll finr, ll finc, ll divi){
        clear(n);
        bfs(r,c,par,divi);
        if(vis[finr][finc]){
            return 1;
        }
        return 0;
    }
}gp3;
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n,s;
    cin>>n>>s;
    char arr[n+2][n+2];
gp2.init(n);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>arr[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=0;k<4;k++){
                if(arr[i][j]=='M'||arr[i][j]=='G'||arr[i][j]=='D'){
                 if(arr[i+dx[k]][j+dy[k]]=='M'||arr[i+dx[k]][j+dy[k]]=='G'||arr[i+dx[k]][j+dy[k]]=='D'){
                     gp3.add_edge(i,j,i+dx[k],j+dy[k]);
                 }
                }
                if(arr[i][j]=='M'||arr[i][j]=='G'||arr[i][j]=='H'){
                 if(arr[i+dx[k]][j+dy[k]]=='M'||arr[i+dx[k]][j+dy[k]]=='G'||arr[i+dx[k]][j+dy[k]]=='H'){
                    gp2.add_edge(i,j,i+dx[k],j+dy[k]);
                 }
                }
            }
            if(arr[i][j]=='H'){
                pos.push_back({i,j});
            }
        }
    }
    gp2.bfs();
    pos.clear();
    ll startr,startc,endr,endc;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(arr[i][j]=='M'){
                startr=i,startc=j;
            }
            if(arr[i][j]=='D'){
                endr=i,endc=j;
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            gp3.bees[i][j]=gp2.dist[i][j];
            }
        }
    pos.clear();
    
    ll l=0,r=gp2.dist[startr][startc]-1;
    while(l<=r){
        if(l==r){
            break;
        }
        else if(l==r-1){
            if(gp3.ck(startr,startc,n,r,endr,endc,s)){
                l=r;
            }
            else{
                r=l;
            }
            break;
        }
        else{
            ll mid=(l+r)>>1;
            if(gp3.ck(startr,startc,n,mid,endr,endc,s)){
                l=mid;
            }
            else{
                r=mid;
            }
        }
    }
    // cout<<'\n';
    // cout<<l<<'\n';
    if(!gp3.ck(startr,startc,n,l,endr,endc,s)){
        cout<<"-1\n";
    }
    else{
        cout<<l<<'\n';
    }
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:176:15: warning: 'startr' may be used uninitialized in this function [-Wmaybe-uninitialized]
  176 |     if(!gp3.ck(startr,startc,n,l,endr,endc,s)){
      |         ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:176:15: warning: 'endr' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:176:15: warning: 'endc' may be used uninitialized in this function [-Wmaybe-uninitialized]
mecho.cpp:176:15: warning: 'startc' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
70.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 37212 KB Output is correct
2 Correct 10 ms 37208 KB Output is correct
3 Correct 12 ms 37212 KB Output is correct
4 Correct 11 ms 37204 KB Output is correct
5 Correct 11 ms 37212 KB Output is correct
6 Correct 12 ms 37212 KB Output is correct
7 Runtime error 93 ms 65536 KB Execution killed with signal 9
8 Correct 11 ms 37212 KB Output is correct
9 Correct 10 ms 37212 KB Output is correct
10 Correct 13 ms 37208 KB Output is correct
11 Correct 11 ms 37208 KB Output is correct
12 Correct 11 ms 37212 KB Output is correct
13 Correct 12 ms 37212 KB Output is correct
14 Correct 12 ms 37468 KB Output is correct
15 Correct 11 ms 37212 KB Output is correct
16 Correct 12 ms 37212 KB Output is correct
17 Correct 11 ms 37212 KB Output is correct
18 Correct 12 ms 37292 KB Output is correct
19 Correct 13 ms 37212 KB Output is correct
20 Correct 11 ms 37212 KB Output is correct
21 Correct 11 ms 37212 KB Output is correct
22 Correct 11 ms 37332 KB Output is correct
23 Correct 11 ms 37208 KB Output is correct
24 Correct 12 ms 37212 KB Output is correct
25 Correct 11 ms 37248 KB Output is correct
26 Correct 12 ms 37208 KB Output is correct
27 Correct 12 ms 37208 KB Output is correct
28 Correct 13 ms 37212 KB Output is correct
29 Correct 12 ms 37468 KB Output is correct
30 Correct 13 ms 37468 KB Output is correct
31 Correct 11 ms 37452 KB Output is correct
32 Correct 12 ms 37468 KB Output is correct
33 Correct 26 ms 43424 KB Output is correct
34 Correct 24 ms 43356 KB Output is correct
35 Correct 111 ms 45304 KB Output is correct
36 Correct 29 ms 44880 KB Output is correct
37 Correct 34 ms 44512 KB Output is correct
38 Correct 91 ms 46928 KB Output is correct
39 Correct 34 ms 45968 KB Output is correct
40 Correct 39 ms 45912 KB Output is correct
41 Correct 180 ms 49132 KB Output is correct
42 Correct 37 ms 47440 KB Output is correct
43 Correct 37 ms 47440 KB Output is correct
44 Correct 304 ms 51564 KB Output is correct
45 Correct 44 ms 49076 KB Output is correct
46 Correct 44 ms 49036 KB Output is correct
47 Correct 377 ms 53916 KB Output is correct
48 Correct 52 ms 51028 KB Output is correct
49 Correct 51 ms 51080 KB Output is correct
50 Correct 468 ms 56912 KB Output is correct
51 Correct 55 ms 53040 KB Output is correct
52 Correct 57 ms 53072 KB Output is correct
53 Correct 600 ms 60084 KB Output is correct
54 Correct 62 ms 55120 KB Output is correct
55 Correct 63 ms 55264 KB Output is correct
56 Correct 706 ms 63380 KB Output is correct
57 Correct 71 ms 57428 KB Output is correct
58 Correct 70 ms 57424 KB Output is correct
59 Runtime error 150 ms 65536 KB Execution killed with signal 9
60 Correct 76 ms 59992 KB Output is correct
61 Correct 78 ms 60124 KB Output is correct
62 Runtime error 89 ms 65536 KB Execution killed with signal 9
63 Correct 388 ms 64520 KB Output is correct
64 Correct 577 ms 64596 KB Output is correct
65 Correct 548 ms 64592 KB Output is correct
66 Correct 439 ms 64848 KB Output is correct
67 Correct 395 ms 64612 KB Output is correct
68 Correct 154 ms 64628 KB Output is correct
69 Correct 145 ms 64572 KB Output is correct
70 Correct 139 ms 64592 KB Output is correct
71 Correct 147 ms 64636 KB Output is correct
72 Correct 143 ms 64512 KB Output is correct
73 Runtime error 92 ms 65536 KB Execution killed with signal 9
74 Runtime error 94 ms 65536 KB Execution killed with signal 9
75 Runtime error 114 ms 65536 KB Execution killed with signal 9
76 Runtime error 95 ms 65536 KB Execution killed with signal 9
77 Runtime error 117 ms 65536 KB Execution killed with signal 9
78 Runtime error 108 ms 65536 KB Execution killed with signal 9
79 Runtime error 96 ms 65536 KB Execution killed with signal 9
80 Runtime error 93 ms 65536 KB Execution killed with signal 9
81 Runtime error 113 ms 65536 KB Execution killed with signal 9
82 Runtime error 115 ms 65536 KB Execution killed with signal 9
83 Runtime error 91 ms 65536 KB Execution killed with signal 9
84 Runtime error 96 ms 65536 KB Execution killed with signal 9
85 Runtime error 128 ms 65536 KB Execution killed with signal 9
86 Runtime error 94 ms 65536 KB Execution killed with signal 9
87 Runtime error 91 ms 65536 KB Execution killed with signal 9
88 Runtime error 95 ms 65536 KB Execution killed with signal 9
89 Runtime error 102 ms 65536 KB Execution killed with signal 9
90 Runtime error 92 ms 65536 KB Execution killed with signal 9
91 Runtime error 92 ms 65536 KB Execution killed with signal 9
92 Runtime error 123 ms 65536 KB Execution killed with signal 9