oj.uz

Submission #558328

# Submission time Handle Problem Language Result Execution time Memory
558328 2022-05-07T06:06:59 Z Cookie Mecho (IOI09_mecho) C++14
84 / 100
 239 ms 6924 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];
   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 3496 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 3416 KB Output is correct
7 Correct 90 ms 6712 KB Output is correct
8 Correct 3 ms 3532 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3448 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 2 ms 3472 KB Output is correct
16 Correct 2 ms 3540 KB Output is correct
17 Correct 3 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 2 ms 3540 KB Output is correct
21 Correct 4 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 3 ms 3668 KB Output is correct
26 Correct 3 ms 3668 KB Output is correct
27 Correct 3 ms 3668 KB Output is correct
28 Correct 4 ms 3668 KB Output is correct
29 Correct 3 ms 3748 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 3760 KB Output is correct
33 Correct 6 ms 4844 KB Output is correct
34 Correct 6 ms 4840 KB Output is correct
35 Correct 20 ms 4820 KB Output is correct
36 Correct 7 ms 4948 KB Output is correct
37 Correct 7 ms 5020 KB Output is correct
38 Correct 27 ms 5040 KB Output is correct
39 Correct 8 ms 5204 KB Output is correct
40 Correct 13 ms 5236 KB Output is correct
41 Correct 56 ms 5204 KB Output is correct
42 Correct 11 ms 5364 KB Output is correct
43 Correct 10 ms 5332 KB Output is correct
44 Correct 56 ms 5372 KB Output is correct
45 Correct 11 ms 5632 KB Output is correct
46 Correct 12 ms 5556 KB Output is correct
47 Correct 70 ms 5568 KB Output is correct
48 Correct 15 ms 5748 KB Output is correct
49 Correct 14 ms 5744 KB Output is correct
50 Correct 72 ms 5716 KB Output is correct
51 Correct 14 ms 5912 KB Output is correct
52 Correct 15 ms 6012 KB Output is correct
53 Correct 88 ms 5952 KB Output is correct
54 Correct 16 ms 6148 KB Output is correct
55 Correct 17 ms 6156 KB Output is correct
56 Correct 107 ms 6100 KB Output is correct
57 Correct 18 ms 6356 KB Output is correct
58 Correct 19 ms 6336 KB Output is correct
59 Correct 104 ms 6408 KB Output is correct
60 Correct 19 ms 6536 KB Output is correct
61 Correct 21 ms 6548 KB Output is correct
62 Correct 142 ms 6608 KB Output is correct
63 Correct 110 ms 6656 KB Output is correct
64 Correct 197 ms 6588 KB Output is correct
65 Correct 239 ms 6592 KB Output is correct
66 Correct 123 ms 6612 KB Output is correct
67 Correct 119 ms 6596 KB Output is correct
68 Correct 67 ms 6544 KB Output is correct
69 Correct 47 ms 6604 KB Output is correct
70 Correct 39 ms 6612 KB Output is correct
71 Correct 33 ms 6552 KB Output is correct
72 Incorrect 32 ms 6548 KB Output isn't correct
73 Incorrect 44 ms 6860 KB Output isn't correct
74 Correct 66 ms 6812 KB Output is correct
75 Correct 65 ms 6796 KB Output is correct
76 Correct 73 ms 6860 KB Output is correct
77 Correct 65 ms 6924 KB Output is correct
78 Correct 78 ms 6724 KB Output is correct
79 Correct 59 ms 6736 KB Output is correct
80 Correct 86 ms 6844 KB Output is correct
81 Correct 65 ms 6732 KB Output is correct
82 Correct 60 ms 6832 KB Output is correct
83 Correct 80 ms 6744 KB Output is correct
84 Correct 69 ms 6752 KB Output is correct
85 Correct 99 ms 6732 KB Output is correct
86 Correct 89 ms 6744 KB Output is correct
87 Correct 77 ms 6812 KB Output is correct
88 Correct 102 ms 6756 KB Output is correct
89 Correct 91 ms 6748 KB Output is correct
90 Correct 124 ms 6676 KB Output is correct
91 Correct 84 ms 6688 KB Output is correct
92 Correct 96 ms 6744 KB Output is correct