oj.uz

Submission #558329

# Submission time Handle Problem Language Result Execution time Memory
558329 2022-05-07T06:07:31 Z Cookie Mecho (IOI09_mecho) C++14
84 / 100
 175 ms 6920 KB 
#include <bits/stdc++.h>
using namespace std;
#define LIFESUCKS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ld long double
#define ar array
#include<cstdio>
#define vt vector
#include<fstream>
ifstream fin("piggyback.in");
ofstream fout("piggyback.out");
#include<fstream>
#define pb push_back
#define all(c) (c).begin(), (c).end()

#define fi first
#define se second
#define vt vector
using namespace std;
int n, s, sti, stj, eni, enj;
bool vis[801][801];
int dis[801][801];
int dis2[801][801];
char a[801][801];
bool bee = true;
const int x[4] = {1, -1, 0, 0};
const int y[4] = {0, 0, 1, -1};
bool check(int mid){
    memset(vis, false, sizeof(vis));
    memset(dis2, false, sizeof(dis2));
    queue<pair<int, int>>q;
    q.push({sti, stj});
    vis[sti][stj] = true;
    dis2[sti][stj] = 0;
    while(!q.empty()){
        auto now = q.front(); q.pop();
        //cout << "mm";
        for(int i = 0; i < 4; i++){
            int cri = now.fi + x[i];
            int crj = now.se + y[i];
            if(cri < 0 || crj < 0 || cri >= n || crj >= n)continue;
            if(!vis[cri][crj] &&(a[cri][crj] == 'G' || a[cri][crj] == 'D')){
               // cout << "lol";
                if(dis[cri][crj] > floor((double)(dis2[now.fi][now.se] + 1) / (double)s) + mid){
                    vis[cri][crj] = true;
                    dis2[cri][crj] = dis2[now.fi][now.se] + 1;
                    if(a[cri][crj] == 'D')return(true);
                    q.push({cri, crj});
                }
            }
        }
    }
    //cout << "\n";
    return(false);
}
void bfs(){
    memset(vis, false, sizeof(vis));
    
    queue<pair<int, int>>q;
    
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(a[i][j] == 'H'){
                q.push({i, j});
                vis[i][j] = true;
                dis[i][j] = 0;
            }
        }
    }
    while(!q.empty()){
        
        auto now = q.front(); q.pop();
        for(int i = 0; i < 4; i++){
            int cri = now.fi + x[i];
            int crj = now.se + y[i];
            if(cri < 0 || crj < 0 || cri >= n || crj >= n)continue;
            if(!vis[cri][crj] && (a[cri][crj] == 'G' || a[cri][crj] == 'M')){
                vis[cri][crj] = true;
                dis[cri][crj] = dis[now.fi][now.se] + 1;
                q.push({cri, crj});
            }
        }
    }
    
}
int main(){
    LIFESUCKS;
   cin >> n >> s;
   
   for(int i = 0; i < n; i++){
       for(int j = 0; j < n; j++){
           dis[i][j] = 1e9;
           cin >> a[i][j];
           if(a[i][j] == 'M'){
               sti = i, stj = j;
           }if(a[i][j] == 'D'){
               eni = i; enj = j;
           }
       }
   }
   //cout << sti << ' ' << stj << " ";
   bfs();
   
   int l = 0;
   int r = dis[sti][stj] + 1;
   int ans = -1;
   while(l <= r){
       int mid = l + (r - l) / 2;
       if(check(mid)){
           ans = mid; l = mid + 1;
       }else{
           r = mid - 1;
       }
   }
   cout << ans;
    return 0;
}

Subtask #1
84.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3384 KB Output is correct
7 Correct 98 ms 6708 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Incorrect 2 ms 3668 KB Output isn't correct
13 Incorrect 2 ms 3668 KB Output isn't correct
14 Correct 2 ms 3668 KB Output is correct
15 Correct 3 ms 3540 KB Output is correct
16 Correct 3 ms 3540 KB Output is correct
17 Correct 3 ms 3540 KB Output is correct
18 Correct 3 ms 3540 KB Output is correct
19 Correct 3 ms 3540 KB Output is correct
20 Correct 4 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 3 ms 3540 KB Output is correct
23 Correct 2 ms 3668 KB Output is correct
24 Correct 3 ms 3668 KB Output is correct
25 Correct 4 ms 3668 KB Output is correct
26 Correct 2 ms 3668 KB Output is correct
27 Correct 3 ms 3668 KB Output is correct
28 Correct 2 ms 3668 KB Output is correct
29 Correct 3 ms 3668 KB Output is correct
30 Correct 3 ms 3668 KB Output is correct
31 Correct 3 ms 3668 KB Output is correct
32 Correct 3 ms 3668 KB Output is correct
33 Correct 7 ms 4820 KB Output is correct
34 Correct 7 ms 4820 KB Output is correct
35 Correct 21 ms 4844 KB Output is correct
36 Correct 7 ms 4948 KB Output is correct
37 Correct 7 ms 4948 KB Output is correct
38 Correct 31 ms 4976 KB Output is correct
39 Correct 10 ms 5204 KB Output is correct
40 Correct 10 ms 5240 KB Output is correct
41 Correct 40 ms 5228 KB Output is correct
42 Correct 10 ms 5400 KB Output is correct
43 Correct 11 ms 5332 KB Output is correct
44 Correct 49 ms 5436 KB Output is correct
45 Correct 11 ms 5512 KB Output is correct
46 Correct 13 ms 5552 KB Output is correct
47 Correct 52 ms 5564 KB Output is correct
48 Correct 13 ms 5716 KB Output is correct
49 Correct 14 ms 5812 KB Output is correct
50 Correct 71 ms 5716 KB Output is correct
51 Correct 14 ms 5972 KB Output is correct
52 Correct 16 ms 5972 KB Output is correct
53 Correct 79 ms 5972 KB Output is correct
54 Correct 16 ms 6144 KB Output is correct
55 Correct 16 ms 6148 KB Output is correct
56 Correct 100 ms 6204 KB Output is correct
57 Correct 19 ms 6336 KB Output is correct
58 Correct 19 ms 6356 KB Output is correct
59 Correct 114 ms 6400 KB Output is correct
60 Correct 19 ms 6612 KB Output is correct
61 Correct 19 ms 6484 KB Output is correct
62 Correct 125 ms 6612 KB Output is correct
63 Correct 139 ms 6596 KB Output is correct
64 Correct 175 ms 6592 KB Output is correct
65 Correct 170 ms 6612 KB Output is correct
66 Correct 127 ms 6660 KB Output is correct
67 Correct 155 ms 6592 KB Output is correct
68 Correct 46 ms 6620 KB Output is correct
69 Correct 41 ms 6552 KB Output is correct
70 Correct 38 ms 6624 KB Output is correct
71 Correct 36 ms 6552 KB Output is correct
72 Incorrect 32 ms 6604 KB Output isn't correct
73 Incorrect 46 ms 6872 KB Output isn't correct
74 Correct 78 ms 6888 KB Output is correct
75 Correct 58 ms 6840 KB Output is correct
76 Correct 60 ms 6868 KB Output is correct
77 Correct 62 ms 6808 KB Output is correct
78 Correct 71 ms 6748 KB Output is correct
79 Correct 60 ms 6788 KB Output is correct
80 Correct 77 ms 6920 KB Output is correct
81 Correct 67 ms 6732 KB Output is correct
82 Correct 61 ms 6792 KB Output is correct
83 Correct 77 ms 6696 KB Output is correct
84 Correct 81 ms 6732 KB Output is correct
85 Correct 92 ms 6816 KB Output is correct
86 Correct 79 ms 6800 KB Output is correct
87 Correct 70 ms 6804 KB Output is correct
88 Correct 81 ms 6756 KB Output is correct
89 Correct 78 ms 6660 KB Output is correct
90 Correct 88 ms 6688 KB Output is correct
91 Correct 107 ms 6752 KB Output is correct
92 Correct 114 ms 6752 KB Output is correct