oj.uz

답안 #558327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
558327 2022-05-07T06:05:13 Z Cookie Mecho (IOI09_mecho) C++14
62 / 100
 205 ms 6988 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 = 64000;
   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
62.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3456 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 3 ms 3412 KB Output is correct
4 Correct 3 ms 3412 KB Output is correct
5 Correct 3 ms 3412 KB Output is correct
6 Correct 3 ms 3412 KB Output is correct
7 Correct 94 ms 6712 KB Output is correct
8 Correct 3 ms 3412 KB Output is correct
9 Correct 3 ms 3412 KB Output is correct
10 Correct 3 ms 3412 KB Output is correct
11 Correct 3 ms 3412 KB Output is correct
12 Incorrect 3 ms 3668 KB Output isn't correct
13 Incorrect 3 ms 3668 KB Output isn't correct
14 Correct 3 ms 3668 KB Output is correct
15 Correct 3 ms 3540 KB Output is correct
16 Correct 3 ms 3552 KB Output is correct
17 Correct 3 ms 3540 KB Output is correct
18 Correct 4 ms 3540 KB Output is correct
19 Correct 4 ms 3540 KB Output is correct
20 Correct 3 ms 3540 KB Output is correct
21 Correct 3 ms 3540 KB Output is correct
22 Correct 4 ms 3540 KB Output is correct
23 Correct 3 ms 3540 KB Output is correct
24 Correct 3 ms 3540 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 5 ms 3668 KB Output is correct
30 Correct 4 ms 3744 KB Output is correct
31 Correct 4 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 4848 KB Output is correct
35 Correct 26 ms 4844 KB Output is correct
36 Incorrect 8 ms 4948 KB Output isn't correct
37 Correct 8 ms 4948 KB Output is correct
38 Correct 40 ms 4948 KB Output is correct
39 Incorrect 8 ms 5164 KB Output isn't correct
40 Correct 9 ms 5120 KB Output is correct
41 Correct 40 ms 5176 KB Output is correct
42 Incorrect 10 ms 5332 KB Output isn't correct
43 Correct 10 ms 5364 KB Output is correct
44 Correct 49 ms 5332 KB Output is correct
45 Incorrect 12 ms 5588 KB Output isn't correct
46 Incorrect 13 ms 5588 KB Output isn't correct
47 Correct 66 ms 5548 KB Output is correct
48 Incorrect 15 ms 5820 KB Output isn't correct
49 Incorrect 13 ms 5748 KB Output isn't correct
50 Correct 79 ms 5716 KB Output is correct
51 Incorrect 17 ms 5948 KB Output isn't correct
52 Incorrect 16 ms 5984 KB Output isn't correct
53 Correct 105 ms 6008 KB Output is correct
54 Incorrect 16 ms 6100 KB Output isn't correct
55 Incorrect 18 ms 6100 KB Output isn't correct
56 Correct 99 ms 6212 KB Output is correct
57 Incorrect 17 ms 6340 KB Output isn't correct
58 Incorrect 19 ms 6396 KB Output isn't correct
59 Correct 118 ms 6404 KB Output is correct
60 Incorrect 21 ms 6536 KB Output isn't correct
61 Incorrect 20 ms 6520 KB Output isn't correct
62 Correct 162 ms 6600 KB Output is correct
63 Correct 103 ms 6544 KB Output is correct
64 Correct 205 ms 6604 KB Output is correct
65 Correct 166 ms 6592 KB Output is correct
66 Correct 131 ms 6588 KB Output is correct
67 Correct 127 ms 6592 KB Output is correct
68 Correct 64 ms 6548 KB Output is correct
69 Correct 42 ms 6580 KB Output is correct
70 Correct 44 ms 6548 KB Output is correct
71 Correct 36 ms 6564 KB Output is correct
72 Incorrect 33 ms 6564 KB Output isn't correct
73 Incorrect 32 ms 6768 KB Output isn't correct
74 Correct 73 ms 6804 KB Output is correct
75 Correct 78 ms 6988 KB Output is correct
76 Correct 66 ms 6872 KB Output is correct
77 Correct 59 ms 6872 KB Output is correct
78 Correct 68 ms 6812 KB Output is correct
79 Correct 56 ms 6844 KB Output is correct
80 Correct 68 ms 6808 KB Output is correct
81 Correct 81 ms 6840 KB Output is correct
82 Correct 65 ms 6784 KB Output is correct
83 Correct 80 ms 6720 KB Output is correct
84 Correct 72 ms 6812 KB Output is correct
85 Correct 77 ms 6732 KB Output is correct
86 Correct 95 ms 6744 KB Output is correct
87 Correct 88 ms 6808 KB Output is correct
88 Correct 82 ms 6748 KB Output is correct
89 Correct 81 ms 6760 KB Output is correct
90 Correct 120 ms 6684 KB Output is correct
91 Correct 106 ms 6712 KB Output is correct
92 Correct 107 ms 6740 KB Output is correct