oj.uz

Submission #666109

# Submission time Handle Problem Language Result Execution time Memory
666109 2022-11-27T15:43:26 Z bane Mecho (IOI09_mecho) C++14
100 / 100
 185 ms 6608 KB 
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T inverse(T a, T m) {
  T u = 0, v = 1;
  while (a != 0) {
    T t = m / a;
    m -= t * a; swap(a, m);
    u -= t * v; swap(u, v);
  }
  assert(m == 1);
  return u;
}
 
template <typename T>
class Modular {
 public:
  using Type = typename decay<decltype(T::value)>::type;
 
  constexpr Modular() : value() {}
  template <typename U>
  Modular(const U& x) {
    value = normalize(x);
  }
 
  template <typename U>
  static Type normalize(const U& x) {
    Type v;
    if (-mod() <= x && x < mod()) v = static_cast<Type>(x);
    else v = static_cast<Type>(x % mod());
    if (v < 0) v += mod();
    return v;
  }
 
  const Type& operator()() const { return value; }
  template <typename U>
  explicit operator U() const { return static_cast<U>(value); }
  constexpr static Type mod() { return T::value; }
 
  Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }
  Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }
  template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }
  template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }
  Modular& operator++() { return *this += 1; }
  Modular& operator--() { return *this -= 1; }
  Modular operator++(int) { Modular result(*this); *this += 1; return result; }
  Modular operator--(int) { Modular result(*this); *this -= 1; return result; }
  Modular operator-() const { return Modular(-value); }
 
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {
#ifdef _WIN32
    uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
    uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;
    asm(
      "divl %4; \n\t"
      : "=a" (d), "=d" (m)
      : "d" (xh), "a" (xl), "r" (mod())
    );
    value = m;
#else
    value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));
#endif
    return *this;
  }
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type& operator*=(const Modular& rhs) {
    int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod());
    value = normalize(value * rhs.value - q * mod());
    return *this;
  }
  template <typename U = T>
  typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {
    value = normalize(value * rhs.value);
    return *this;
  }
 
  Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }
 
  template <typename U>
  friend const Modular<U>& abs(const Modular<U>& v) { return v; }
 
  template <typename U>
  friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);
 
  template <typename U>
  friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);
 
  template <typename U>
  friend std::istream& operator>>(std::istream& stream, Modular<U>& number);
 
 private:
  Type value;
};
 
template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }
template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }
template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }
 
template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }
template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
 
template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }
 
template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
 
template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
 
template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
 
template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
 
template<typename T, typename U>
Modular<T> power(const Modular<T>& a, const U& b) {
  assert(b >= 0);
  Modular<T> x = a, res = 1;
  U p = b;
  while (p > 0) {
    if (p & 1) res *= x;
    x *= x;
    p >>= 1;
  }
  return res;
}
 
template <typename T>
bool IsZero(const Modular<T>& number) {
  return number() == 0;
}
 
template <typename T>
string to_string(const Modular<T>& number) {
  return to_string(number());
}
 
template <typename T>
std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) {
  return stream << number();
}
 
template <typename T>
std::istream& operator>>(std::istream& stream, Modular<T>& number) {
  typename common_type<typename Modular<T>::Type, int64_t>::type x;
  stream >> x;
  number.value = Modular<T>::normalize(x);
  return stream;
}
using ll = long long;
 
using vi = vector<int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define ite(x,n) for (int i = x; i<n; i++);
using pii = pair<int,int>;
#define fr first
#define sc second
#define mp make_pair
 
void setIO(string name = "") {
    cin.tie(0)->sync_with_stdio(0); // see /general/fast-io
    if (sz(name)) {
        freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
 
int inf = (int)1e6 + 1;
int MOD = 1e9 + 7;
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int MAX_VAL = 50;
int main(){
    setIO("");
    int n, s;
    cin >> n >> s;
    char grid[n + 1][n + 1];
    pii mecho, destination;
    queue<pii>q;
 
    int bees[n + 1][n + 1], dist[n + 1][n + 1];
    for (int i = 1; i<=n; i++){
        for (int j = 1; j<=n; j++){
            cin >> grid[i][j];
            bees[i][j] = -1;
            dist[i][j] = -1;
            if (grid[i][j] == 'M'){
                mecho = mp(i,j);
                dist[i][j]=0;
            }else if (grid[i][j] == 'D'){
                destination = mp(i,j);
            }else if (grid[i][j] == 'H'){
                //hive
                bees[i][j]=0;
                q.push(mp(i,j));
            }
        }
    }
    while(!q.empty()){
        pii node = q.front();
        q.pop();
        //cout<<node.fr<<" "<<node.sc<<" "<<bees[node.fr][node.sc]<<endl;
        for(int i = 0; i<4; i++){
            pii nxt = {node.fr + dx[i], node.sc + dy[i]};
            if (nxt.fr <= n && nxt.fr >= 1 && nxt.sc <= n && nxt.sc >= 1 && (grid[nxt.fr][nxt.sc] =='G' ||grid[nxt.fr][nxt.sc] =='M')  && bees[nxt.fr][nxt.sc] == -1){
                bees[nxt.fr][nxt.sc] = 1 + bees[node.fr][node.sc];
                q.push(nxt);
            }
        }
    }
    int ans = -1;
    int l = 0;
    int r = n*n;
    while(l<=r){
		int mid = (l + r)/2;
		//mid minuti sme jadele
		if (bees[mecho.fr][mecho.sc] <= mid){
			r = mid - 1;
			continue;
		}
		queue<pair<int,pii>>qq;
		memset(dist, -1, sizeof(dist));
		dist[mecho.fr][mecho.sc] = mid;
		qq.push(mp(0, mecho));
		while(!qq.empty()){
			int streak = qq.front().fr;
			pii node = qq.front().sc;
			//cout<<node.fr<<" "<<node.sc<<" "<<dist[node.fr][node.sc]<<endl;
			qq.pop();
			for (int i = 0; i<4; i++){
				pii nxt = {node.fr + dx[i], node.sc + dy[i]};
				if (nxt.fr <= n && nxt.fr >= 1 && nxt.sc <= n && nxt.sc >= 1 && grid[nxt.fr][nxt.sc] !='T' && grid[nxt.fr][nxt.sc] !='H' && dist[nxt.fr][nxt.sc] == -1){
					int new_dist = dist[node.fr][node.sc] + (streak + 1 == s);
					if (new_dist < bees[nxt.fr][nxt.sc] || bees[nxt.fr][nxt.sc] == -1){
						dist[nxt.fr][nxt.sc] = new_dist;
						int ns = streak + 1;
						if (ns == s)ns = 0;
						qq.push(mp(ns, nxt));
					}
				}
			}
		}
		
		if (dist[destination.fr][destination.sc] > -1){
			ans = mid;
			l = mid + 1;
		}else{
			r = mid - 1;
		}
			
	}
	cout<<ans;
    return 0;
}

Compilation message

mecho.cpp: In function 'void setIO(std::string)':
mecho.cpp:172:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  172 |         freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:173:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  173 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 85 ms 6464 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 316 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 352 KB Output is correct
32 Correct 1 ms 324 KB Output is correct
33 Correct 6 ms 1484 KB Output is correct
34 Correct 5 ms 1480 KB Output is correct
35 Correct 21 ms 1492 KB Output is correct
36 Correct 6 ms 1876 KB Output is correct
37 Correct 7 ms 1896 KB Output is correct
38 Correct 28 ms 2012 KB Output is correct
39 Correct 7 ms 2260 KB Output is correct
40 Correct 9 ms 2216 KB Output is correct
41 Correct 38 ms 2260 KB Output is correct
42 Correct 8 ms 2772 KB Output is correct
43 Correct 9 ms 2780 KB Output is correct
44 Correct 49 ms 2776 KB Output is correct
45 Correct 10 ms 3156 KB Output is correct
46 Correct 11 ms 3152 KB Output is correct
47 Correct 58 ms 3240 KB Output is correct
48 Correct 12 ms 3668 KB Output is correct
49 Correct 14 ms 3680 KB Output is correct
50 Correct 64 ms 3744 KB Output is correct
51 Correct 14 ms 4308 KB Output is correct
52 Correct 16 ms 4288 KB Output is correct
53 Correct 82 ms 4300 KB Output is correct
54 Correct 17 ms 4896 KB Output is correct
55 Correct 18 ms 4884 KB Output is correct
56 Correct 97 ms 4888 KB Output is correct
57 Correct 19 ms 5588 KB Output is correct
58 Correct 23 ms 5476 KB Output is correct
59 Correct 107 ms 5460 KB Output is correct
60 Correct 20 ms 6224 KB Output is correct
61 Correct 26 ms 6220 KB Output is correct
62 Correct 126 ms 6212 KB Output is correct
63 Correct 102 ms 6200 KB Output is correct
64 Correct 185 ms 6208 KB Output is correct
65 Correct 142 ms 6100 KB Output is correct
66 Correct 119 ms 6208 KB Output is correct
67 Correct 110 ms 6100 KB Output is correct
68 Correct 47 ms 6236 KB Output is correct
69 Correct 46 ms 6228 KB Output is correct
70 Correct 37 ms 6204 KB Output is correct
71 Correct 41 ms 6228 KB Output is correct
72 Correct 28 ms 6148 KB Output is correct
73 Correct 32 ms 6484 KB Output is correct
74 Correct 56 ms 6484 KB Output is correct
75 Correct 68 ms 6480 KB Output is correct
76 Correct 60 ms 6488 KB Output is correct
77 Correct 59 ms 6608 KB Output is correct
78 Correct 73 ms 6344 KB Output is correct
79 Correct 49 ms 6480 KB Output is correct
80 Correct 60 ms 6452 KB Output is correct
81 Correct 68 ms 6444 KB Output is correct
82 Correct 58 ms 6432 KB Output is correct
83 Correct 79 ms 6348 KB Output is correct
84 Correct 67 ms 6384 KB Output is correct
85 Correct 76 ms 6416 KB Output is correct
86 Correct 75 ms 6420 KB Output is correct
87 Correct 74 ms 6452 KB Output is correct
88 Correct 80 ms 6364 KB Output is correct
89 Correct 78 ms 6368 KB Output is correct
90 Correct 80 ms 6336 KB Output is correct
91 Correct 81 ms 6356 KB Output is correct
92 Correct 89 ms 6452 KB Output is correct