oj.uz

답안 #989865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989865 2024-05-28T22:16:36 Z Ralph_J Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 498 ms 225288 KB 
// #pragma GCC optimize("Ofast, unroll-loops, no-stack-protector, fast-math, O3, omit-frame-pointer, inline, avx, avx2, fma")
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size()) // size of a container
#define F(i, n) for (int i = 0; i < (int)(n); i++) 
#define ALL(a, x) memset(a, x, sizeof(a)) // set elements of array to some value
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define REMAX(a, b) (a) = max((a), (b)) // set a to the maximum of a and b
#define REMIN(a, b) (a) = min((a), (b));
#define FOREACH(i, t) for (typeof(t.begin()) i = t.begin(); i != t.end(); i++) // traverse an STL data structure
#define all(c) (c).begin(), (c).end() // handy for function like "sort()"
#define contain(c, x) ((c).find(x) != (c).end())
#define present(c, x) (count(all(c), x)>0)
typedef long long ll; // data types used often, but you don't want to type them time by time
typedef unsigned long long ull;
const long double PI = 3.1415926535897932384626;
const int mod = 1000000007;
#define dbg(var) cerr << #var << " = " << (var) << endl; // for debug
#define pb push_back // for vectors
#define SORT(p) sort(all(p))
#define REVERSE(p) reverse(all(p))
#define onecount __builtin_popcount // count number of 1's in a number
#define highbit(x) (63 - __builtin_clzll(x)) // get the index of the highest bit set
#define lowbit(x) __builtin_ctzll(x) // get the index of the lowest bit set
#define bitcount(x) (__builtin_popcount(x) + __builtin_popcount(x >> 32)) // count number of 1's in a number in O(1) time
#define mid(l, r) ((l) + (((r) - (l)) >> 1))
typedef int elem_t;
template <typename T, typename TT>
ostream &operator<<(ostream &s, pair<T, TT> t) { return s << "(" << t.first << "," << t.second << ")"; }
template <typename T>
ostream &operator<<(ostream &s, vector<T> t){ F(i, SZ(t)) s << t[i] << " ";return s;}
template <typename T>
istream &operator>>(istream &in, vector<T>&e){for(auto&x : e) cin >> x; return in;}
template <typename T, typename TT>
istream &operator>>(istream &in, vector<pair<T, TT>>&e){for(auto&x : e) cin >> x.first >> x.second; return in;} 
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll largest_multiple_smaller_than_x(ll a, ll k){ return (k / a) * a;}
ll smallest_multiple_greater_than_x(ll a, ll k){ return ((k + a - 1) / a) * a;}
vector<ll>sieve(ll num){vector<ll>prime;vector<bool>isPrime(num + 1, true);isPrime[0] = isPrime[1] = false;for(int i = 2; i <= num; i++){if(isPrime[i]){prime.push_back(i);for(int j = i * 2; j <= num; j += i) isPrime[j] = false;}}return prime;}
#define int long long
vector<int>primeFactors(int num){vector<int>prime;for(int i = 2; i * i <= num; i++){while(num % i == 0){prime.push_back(i);num /= i;}}{if(num > 1) prime.push_back(num);}return prime;}
bool is_prime(ll num){if(num < 2) return false;for(ll i = 2; i * i <= num; i++){if(num % i == 0) return false;}return true;}
vector<int>binary(ll num){vector<int>binary;while(num){binary.push_back(num % 2); num >>= 1;} reverse(all(binary)); return binary;}
int decimal(vector<ll>binary){ int num = 0; for(int i = 0; i < binary.size(); i++){num += binary[i] * (1 << i);}return num;}
ll factorial(ll num, ll mod = 1e9+7){ ll fact = 1; for(ll i = 1; i <= num; i++) fact = (fact * i) % mod; return fact;}
vector<int> divisors(int n){ vector<int> div; for(int i = 1; i * i <= n; i++){ if(n % i == 0){ div.push_back(i); if(i * i != n) div.push_back(n / i); } } return div; }
ll power(ll x, ll y, ll mod = 1e18+7){ll res = 1; x %= mod; while(y > 0){if(y & 1) res = (res * x) % mod; y >>= 1; x = (x * x) % mod;} return res;}
ll mod_inverse(ll num, ll mod = 1e9+7){ return power(num, mod - 2, mod);}
ll NchooseK(ll n, ll k, ll mod = 1e9+7){ll res = 1; k = min(k, n - k); for(ll i = 0; i < k; i++){ res = (res * (n - i)) % mod; res = (res * mod_inverse(i + 1, mod)) % mod;} return res;}

int n, m;
string a[100000]; 
int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};

bool inside(int i, int j){
    return (i >= 0 && j >= 0 && i < n && j < m && a[i][j] != '.');
}

void solve(){
    cin >> n >> m;
    for(int i = 0; i < n; i++) cin >> a[i];

    deque<pair<int,int>> Q;
    Q.push_back({0, 0});
    vector<vector<int>> dist(n, vector<int>(m, 0));
    dist[0][0] = 1;
    int res = 1;
    while(Q.size()){
        int i = Q.front().first, j = Q.front().second;
        res = max(res, dist[i][j]);
        Q.pop_front();
        for(int x = 0; x < 4; x++){
            int i2 = i + dx[x], j2 = j + dy[x];
            if(inside(i2, j2) && dist[i2][j2] == 0){
                if(a[i][j] == a[i2][j2]){
                    dist[i2][j2] = dist[i][j];
                    Q.push_front({i2, j2});
                }
                else{
                    dist[i2][j2] = dist[i][j] + 1;
                    Q.push_back({i2, j2});
                }
            }
        }
    }
    cout << res << '\n';
}

int32_t main()
{
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

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

Compilation message

tracks.cpp: In function 'long long int decimal(std::vector<long long int>)':
tracks.cpp:46:62: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 | int decimal(vector<ll>binary){ int num = 0; for(int i = 0; i < binary.size(); i++){num += binary[i] * (1 << i);}return num;}
      |                                                            ~~^~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5980 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 5 ms 5468 KB Output is correct
5 Correct 3 ms 4428 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3600 KB Output is correct
10 Correct 2 ms 4188 KB Output is correct
11 Correct 2 ms 3932 KB Output is correct
12 Correct 3 ms 4440 KB Output is correct
13 Correct 2 ms 4188 KB Output is correct
14 Correct 2 ms 4264 KB Output is correct
15 Correct 7 ms 5980 KB Output is correct
16 Correct 8 ms 6088 KB Output is correct
17 Correct 6 ms 5980 KB Output is correct
18 Correct 7 ms 5464 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3932 KB Output is correct
2 Correct 30 ms 18968 KB Output is correct
3 Correct 166 ms 162104 KB Output is correct
4 Correct 56 ms 40600 KB Output is correct
5 Correct 143 ms 92432 KB Output is correct
6 Correct 498 ms 189492 KB Output is correct
7 Correct 2 ms 3928 KB Output is correct
8 Correct 3 ms 3932 KB Output is correct
9 Correct 2 ms 4188 KB Output is correct
10 Correct 1 ms 3932 KB Output is correct
11 Correct 2 ms 4112 KB Output is correct
12 Correct 1 ms 3676 KB Output is correct
13 Correct 28 ms 19036 KB Output is correct
14 Correct 16 ms 12380 KB Output is correct
15 Correct 12 ms 13404 KB Output is correct
16 Correct 15 ms 9820 KB Output is correct
17 Correct 85 ms 43604 KB Output is correct
18 Correct 49 ms 43092 KB Output is correct
19 Correct 53 ms 40536 KB Output is correct
20 Correct 39 ms 37584 KB Output is correct
21 Correct 111 ms 95668 KB Output is correct
22 Correct 131 ms 92496 KB Output is correct
23 Correct 158 ms 80176 KB Output is correct
24 Correct 105 ms 93480 KB Output is correct
25 Correct 220 ms 162324 KB Output is correct
26 Correct 237 ms 225288 KB Output is correct
27 Correct 334 ms 215508 KB Output is correct
28 Correct 448 ms 189428 KB Output is correct
29 Correct 469 ms 186100 KB Output is correct
30 Correct 396 ms 194680 KB Output is correct
31 Correct 353 ms 105876 KB Output is correct
32 Correct 286 ms 192852 KB Output is correct