oj.uz

답안 #1097089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097089 2024-10-06T03:36:44 Z InvMOD Mecho (IOI09_mecho) C++14
84 / 100
 137 ms 14356 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define gcd __gcd
#define sz(v) (int) v.size()
#define pb push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define compact(v) (v).erase(unique(all(v)), (v).end())
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define int long long

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template<typename T> bool ckmx(T& a, const T& b){if(a < b) return a = b, true; return false;}
template<typename T> bool ckmn(T& a, const T& b){if(a > b) return a = b, true; return false;}

const int N = 1e3+5;
const ll MOD = 1e9+7;
const ll INF = 1e18;

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};

int n, s, d[N][N], vis[N][N];
char a[N][N];

bool init(int x, int y){
    return (x >= 1 && x <= n) && (y >= 1 && y <= n) && a[x][y] != 'T';
}

bool good(int time){
    pi st, ed;
    FOR(i, 1, n){
        FOR(j, 1, n){
            if(a[i][j] == 'M'){
                st = make_pair(i,j);
                vis[i][j] = 0;
            }
            else{
                if(a[i][j] == 'D'){
                    ed = make_pair(i, j);
                }
                vis[i][j] = 1e9;
            }
        }
    }

    if(time > d[st.fi][st.se]) return false;

    queue<pair<int,int>> q;
    q.push(st);

    while(sz(q)){
        pi e = q.front(); q.pop();

        int x = e.fi, y = e.se;
        for(int i = 0; i < 4; i++){
            int xx = x + dx[i];
            int yy = y + dy[i];
            if(init(xx, yy) && vis[xx][yy] == 1e9 && a[xx][yy] != 'H'){
                int n_dist = (vis[x][y] + 1) / s;
                if(n_dist < d[xx][yy] - time){
                    vis[xx][yy] = vis[x][y] + 1;
                    q.push(make_pair(xx, yy));
                }
            }
        }
    }

    return vis[ed.fi][ed.se] != 1e9;
}

void solve()
{
    cin >> n >> s;
    FOR(i, 1, n){
        FOR(j, 1, n){
            cin >> a[i][j];
        }
    }

    queue<pair<int,int>> q;

    FOR(i, 1, n){
        FOR(j, 1, n){
            if(a[i][j] == 'H'){
                q.push(make_pair(i,j));
            }
            else d[i][j] = 1e9;
        }
    }

    while(sz(q)){
        pi e = q.front(); q.pop();

        int x = e.fi, y = e.se;
        for(int i = 0; i < 4; i++){
            int xx = x + dx[i];
            int yy = y + dy[i];
            if(init(xx, yy) && d[xx][yy] == 1e9 && a[xx][yy] != 'D'){
                d[xx][yy] = d[x][y] + 1;
                q.push(make_pair(xx, yy));
            }
        }
    }

    int l = -1, r = 1e9;
    while(l+1 < r){
        int m = l+r>>1;
        if(good(m)){
            l = m;
        }
        else r = m;
    }
    cout << l <<"\n";
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    #define name "InvMOD"
    if(fopen(name".INP", "r")){
        freopen(name".INP","r",stdin);
        freopen(name".OUT","w",stdout);
    }

    int t = 1; //cin >> t;
    while(t--) solve();
    return 0;
}

Compilation message

mecho.cpp: In function 'void solve()':
mecho.cpp:114:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  114 |         int m = l+r>>1;
      |                 ~^~
mecho.cpp: In function 'int main()':
mecho.cpp:131:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         freopen(name".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:132:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |         freopen(name".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
84.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 75 ms 13924 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Incorrect 0 ms 860 KB Output isn't correct
13 Incorrect 0 ms 860 KB Output isn't correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 12 ms 5440 KB Output is correct
34 Correct 8 ms 5464 KB Output is correct
35 Correct 25 ms 5468 KB Output is correct
36 Correct 9 ms 6744 KB Output is correct
37 Correct 8 ms 6492 KB Output is correct
38 Correct 24 ms 6576 KB Output is correct
39 Correct 12 ms 7516 KB Output is correct
40 Correct 17 ms 7620 KB Output is correct
41 Correct 32 ms 7516 KB Output is correct
42 Correct 14 ms 8796 KB Output is correct
43 Correct 13 ms 8796 KB Output is correct
44 Correct 38 ms 8796 KB Output is correct
45 Correct 16 ms 9564 KB Output is correct
46 Correct 15 ms 9560 KB Output is correct
47 Correct 56 ms 9564 KB Output is correct
48 Correct 20 ms 10328 KB Output is correct
49 Correct 18 ms 10504 KB Output is correct
50 Correct 55 ms 10328 KB Output is correct
51 Correct 22 ms 11096 KB Output is correct
52 Correct 21 ms 11124 KB Output is correct
53 Correct 67 ms 11100 KB Output is correct
54 Correct 26 ms 12120 KB Output is correct
55 Correct 29 ms 12124 KB Output is correct
56 Correct 77 ms 12168 KB Output is correct
57 Correct 26 ms 12888 KB Output is correct
58 Correct 24 ms 12892 KB Output is correct
59 Correct 97 ms 12892 KB Output is correct
60 Correct 30 ms 13656 KB Output is correct
61 Correct 37 ms 13660 KB Output is correct
62 Correct 96 ms 13656 KB Output is correct
63 Correct 94 ms 13660 KB Output is correct
64 Correct 137 ms 13832 KB Output is correct
65 Correct 133 ms 13832 KB Output is correct
66 Correct 97 ms 13660 KB Output is correct
67 Correct 88 ms 13696 KB Output is correct
68 Correct 51 ms 13652 KB Output is correct
69 Correct 50 ms 13648 KB Output is correct
70 Correct 40 ms 13652 KB Output is correct
71 Correct 42 ms 13656 KB Output is correct
72 Incorrect 39 ms 13652 KB Output isn't correct
73 Incorrect 40 ms 14160 KB Output isn't correct
74 Correct 58 ms 14356 KB Output is correct
75 Correct 62 ms 14260 KB Output is correct
76 Correct 59 ms 14172 KB Output is correct
77 Correct 65 ms 14160 KB Output is correct
78 Correct 63 ms 14108 KB Output is correct
79 Correct 56 ms 14180 KB Output is correct
80 Correct 59 ms 14168 KB Output is correct
81 Correct 66 ms 14172 KB Output is correct
82 Correct 58 ms 14168 KB Output is correct
83 Correct 72 ms 14168 KB Output is correct
84 Correct 66 ms 14248 KB Output is correct
85 Correct 67 ms 14168 KB Output is correct
86 Correct 81 ms 14248 KB Output is correct
87 Correct 71 ms 14160 KB Output is correct
88 Correct 76 ms 14172 KB Output is correct
89 Correct 72 ms 13908 KB Output is correct
90 Correct 81 ms 13916 KB Output is correct
91 Correct 81 ms 14148 KB Output is correct
92 Correct 77 ms 14116 KB Output is correct