oj.uz

Submission #480597

# Submission time Handle Problem Language Result Execution time Memory
480597 2021-10-17T10:33:09 Z EntropyX Mecho (IOI09_mecho) C++17
48 / 100
 435 ms 6912 KB 
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define iiordered_set tree<pll, null_type,less<pll>, rb_tree_tag,tree_order_statistics_node_update>

using namespace std;

//Bit Functions
#define gcd __gcd
#define lsb __builtin_ffs
#define ldz __builtin_clz
#define tlz __builtin_ctz
#define stc __builtin_popcount
#define prtb(n) cout << bitset<20>(n) << "\n";

//Debugging
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define what_is(x) cerr << #x << " is " << x << endl;
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
    cerr << *it << " = " << a << endl;
    err(++it, args...);
}

//STL Declarations
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<long long int>
#define vvl vector<vl>
#define vb vector<bool>
#define pii pair<int,int>
#define fr first
#define sc second
#define u_s unordered_set
#define ump unordered_map
#define ins insert
#define p_q(x) priority_queue<x>

//STL Functions
#define mt make_tuple
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define muq make_unique
#define all(x) x.begin(),x.end()
#define rot(vec,k) rotate(vec.begin(), vec.begin() + k, vec.end());
#define bs(vec,key) binary_search(all(vec), key)
#define parti(vec,p) partition_point(all(vec), p) - vec.begin()
#define srt(cnt) sort(all(cnt))
#define lb(cnt,x) lower_bound(all(cnt),x)
#define ub(cnt,x) upper_bound(all(cnt),x)
#define mxm(cnt) *max_element(all(cnt))
#define mnm(cnt) *min_element(all(cnt))
#define mxmptr(cnt) max_element(all(cnt))
#define mnmptr(cnt) min_element(all(cnt))
#define rev(cnt) reverse(all(cnt))
#define accum(cnt) accumulate(all(cnt),0)
#define look(cnt) for(auto c:cnt) cout<<c<<" "; cout<<"\n";
#define pre(x,cont) find(all(cont),x)!=cont.end()
#define pb push_back

//Input Functions
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }
template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << t<<" "; return os << endl; }
template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << v.first << " " << v.second ; }

typedef long long int ll;
ll mod = 10000000007;

//Generalised Sum Function
int sum() { return 0; }
template<typename T, typename... Args>
T sum(T a, Args... args) { return a + sum(args...); }

vector<int> seive(int N){
    vector<bool> visited(N+1,false);
    vi pr;
    for(int i=2;i<=N;i++){
        if(!visited[i]){
            int j = i;
            pr.pb(j);
            while(j<=N){visited[j] = true;j+=i;}}}
    return pr;
}
ll ceil(ll a,ll b){
    if(b<0)a=-a,b=-b;
    if(a>=0)return (a+b-1)/b;
    return a/b;
}
long long bpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}
ll inverse(ll a,ll m=mod)
{
    return bpow(a,m-2,m);
}
vvl matmul(const vvl &a,const vvl &b,ll M=mod)
{
    int n=a.size(),m=a[0].size(),l=b[0].size();
    assert(m==b.size());
    vvl c(n,vl(l,0));
    rep(i,0,n)
        rep(j,0,l)
            rep(k,0,m)
            {
                c[i][j]=(c[i][j]+a[i][k]*b[k][j])%M;
            }
    return c;
}
vvl matpow(vvl a,ll p,ll M=mod)
{
    assert(a.size()==a[0].size());
    int n=a.size();
    vvl res(n,vl(n,0));
    rep(i,0,n)   res[i][i]=1;
    while(p>0)
    {
        if(p&1) res=matmul(res,a,M);
        a=matmul(a,a,M);
        p>>=1;
    }
    return res;
}

const ll COMBINATION_SIZE = 300005;
const ll MOD = 1e9+7;

struct Combination {
    long long fac[COMBINATION_SIZE], inv[COMBINATION_SIZE];
    bool built = 0;
    void build(){
        assert(MOD >= COMBINATION_SIZE);
        fac[0] = 1;
        for(int i = 1; i < COMBINATION_SIZE; i++) {
            fac[i] = fac[i - 1] * i % MOD;
        }
        inv[COMBINATION_SIZE - 1] = inverse(fac[COMBINATION_SIZE - 1], MOD);
        for(int i = COMBINATION_SIZE - 2; i >= 0; i--) {
            inv[i] = inv[i + 1] * (i + 1) % MOD;
        }
    }
    long long C(int x, int y){
        if(y < 0 || y > x) {
            return 0;
        }
        if(!built) {
            built = 1;
            build();
        }
        return fac[x] * inv[y] % MOD * inv[x-y] % MOD;
    }
} comb;

void setIO(string s) { // the argument is the filename without the extension
    freopen((s+".in").c_str(),"r",stdin);
    freopen((s+".out").c_str(),"w",stdout);
}

int main(){ _
    int n,s;cin >> n >> s;
    vector<string> vec(n);
    rep(i,0,n)
        cin >> vec[i];
    auto valid = [&](int x,int y){
        if(x<0 || y<0 || x>=n || y>=n)
            return false;
        return true;
    };
    vector<pii> dirs = {{+1,0},{-1,0},{0,+1},{0,-1}};
    pii start;pii end;
    queue<pii> q;
    vector<vi> d(n,vi(n,-1));
    rep(i,0,n){
        rep(j,0,n){
            if(vec[i][j] == 'H'){
                q.push({i,j});
                d[i][j] = 0;
            }
            else if(vec[i][j] == 'M'){
                start = {i,j};
            }
            else if(vec[i][j] == 'D'){
                end = {i,j};
            }
        }
    }
    // The bee action is finished!
    while(!q.empty()){
        auto p = q.front();q.pop();
        int x = p.fr;int y = p.sc;
        int dd = d[x][y];
        for(auto c:dirs){
            int X = x+c.fr;
            int Y = y+c.sc;
            if(valid(X,Y) && (d[X][Y] == -1) && vec[X][Y]!='T' && vec[X][Y]!='D'){
                q.push({X,Y});
                d[X][Y] = dd+1;
            }
        }
    }
    auto check = [&](int start_time){
        queue<pii> q2;
        vector<vi> d2(n,vi(n,-1));
        q2.push(start);
        d2[start.fr][start.sc] = start_time;
        while(!q2.empty()){
            auto p = q2.front();
            q2.pop();
            int x = p.fr;
            int y = p.sc;
            int dd = d2[x][y];
            int chk = dd + 1;
            for(auto c:dirs){
                int X = x + c.fr;
                int Y = y + c.sc;
                if(valid(X,Y) && d2[X][Y] == -1 && vec[X][Y] != 'T' && (chk/s < d[X][Y] || d[X][Y] == -1)){
                    d2[X][Y] = chk;
                    q2.push({X,Y});
                }
            }
        }
        return d2[end.fr][end.sc]!=-1;
    };
    if(!check(0)){
        cout << "-1\n";
    }
    else{
        int r = n*n+1;
        int l = 0;
        while(r-l>1){
            int mid = (l+r)/2;
            if(check(mid)){
                l = mid;
            }
            else{
                r = mid;
            }
        }
        l = (l/s);
        cout << l << "\n";
    }
    return 0;
}

Compilation message

In file included from /usr/include/c++/10/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp:45,
                 from /usr/include/c++/10/ext/pb_ds/detail/container_base_dispatch.hpp:90,
                 from /usr/include/c++/10/ext/pb_ds/assoc_container.hpp:48,
                 from mecho.cpp:4:
mecho.cpp: In function 'std::vector<std::vector<long long int> > matmul(const std::vector<std::vector<long long int> >&, const std::vector<std::vector<long long int> >&, ll)':
mecho.cpp:111:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |     assert(m==b.size());
      |            ~^~~~~~~~~~
mecho.cpp: In function 'void setIO(std::string)':
mecho.cpp:166:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  166 |     freopen((s+".in").c_str(),"r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:167:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  167 |     freopen((s+".out").c_str(),"w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
48.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 145 ms 6872 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Incorrect 1 ms 332 KB Output isn't correct
13 Incorrect 1 ms 332 KB Output isn't correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Incorrect 1 ms 332 KB Output isn't correct
17 Correct 1 ms 316 KB Output is correct
18 Incorrect 1 ms 332 KB Output isn't correct
19 Correct 1 ms 332 KB Output is correct
20 Incorrect 1 ms 332 KB Output isn't correct
21 Correct 1 ms 332 KB Output is correct
22 Incorrect 1 ms 332 KB Output isn't correct
23 Correct 1 ms 344 KB Output is correct
24 Incorrect 1 ms 332 KB Output isn't correct
25 Correct 1 ms 332 KB Output is correct
26 Incorrect 2 ms 332 KB Output isn't correct
27 Correct 1 ms 332 KB Output is correct
28 Incorrect 2 ms 332 KB Output isn't correct
29 Correct 1 ms 332 KB Output is correct
30 Incorrect 2 ms 332 KB Output isn't correct
31 Correct 1 ms 332 KB Output is correct
32 Incorrect 2 ms 332 KB Output isn't correct
33 Correct 8 ms 1560 KB Output is correct
34 Incorrect 32 ms 1564 KB Output isn't correct
35 Correct 45 ms 1544 KB Output is correct
36 Correct 12 ms 2152 KB Output is correct
37 Incorrect 44 ms 1868 KB Output isn't correct
38 Correct 67 ms 1964 KB Output is correct
39 Correct 12 ms 2360 KB Output is correct
40 Incorrect 57 ms 2364 KB Output isn't correct
41 Correct 84 ms 2372 KB Output is correct
42 Correct 15 ms 2836 KB Output is correct
43 Incorrect 69 ms 2848 KB Output isn't correct
44 Correct 132 ms 2836 KB Output is correct
45 Correct 24 ms 3388 KB Output is correct
46 Incorrect 97 ms 3352 KB Output isn't correct
47 Correct 122 ms 3356 KB Output is correct
48 Correct 22 ms 3988 KB Output is correct
49 Incorrect 144 ms 3944 KB Output isn't correct
50 Correct 162 ms 4204 KB Output is correct
51 Correct 29 ms 4572 KB Output is correct
52 Incorrect 132 ms 4556 KB Output isn't correct
53 Correct 195 ms 4556 KB Output is correct
54 Correct 31 ms 5292 KB Output is correct
55 Incorrect 143 ms 5232 KB Output isn't correct
56 Correct 201 ms 5356 KB Output is correct
57 Correct 45 ms 5964 KB Output is correct
58 Incorrect 183 ms 5936 KB Output isn't correct
59 Correct 226 ms 5936 KB Output is correct
60 Correct 44 ms 6760 KB Output is correct
61 Incorrect 205 ms 6712 KB Output isn't correct
62 Correct 270 ms 6824 KB Output is correct
63 Correct 153 ms 6716 KB Output is correct
64 Incorrect 435 ms 6716 KB Output isn't correct
65 Correct 221 ms 6712 KB Output is correct
66 Correct 189 ms 6792 KB Output is correct
67 Correct 39 ms 6608 KB Output is correct
68 Correct 99 ms 6796 KB Output is correct
69 Correct 92 ms 6724 KB Output is correct
70 Correct 79 ms 6820 KB Output is correct
71 Correct 72 ms 6812 KB Output is correct
72 Incorrect 67 ms 6764 KB Output isn't correct
73 Incorrect 71 ms 6912 KB Output isn't correct
74 Correct 116 ms 6748 KB Output is correct
75 Correct 108 ms 6740 KB Output is correct
76 Correct 96 ms 6796 KB Output is correct
77 Correct 102 ms 6732 KB Output is correct
78 Correct 32 ms 6828 KB Output is correct
79 Correct 117 ms 6752 KB Output is correct
80 Correct 96 ms 6760 KB Output is correct
81 Correct 114 ms 6776 KB Output is correct
82 Correct 101 ms 6792 KB Output is correct
83 Correct 129 ms 6744 KB Output is correct
84 Correct 152 ms 6732 KB Output is correct
85 Correct 111 ms 6740 KB Output is correct
86 Correct 130 ms 6752 KB Output is correct
87 Correct 124 ms 6736 KB Output is correct
88 Correct 144 ms 6736 KB Output is correct
89 Correct 190 ms 6732 KB Output is correct
90 Correct 162 ms 6832 KB Output is correct
91 Correct 162 ms 6740 KB Output is correct
92 Correct 152 ms 6728 KB Output is correct