oj.uz

답안 #726991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
726991 2023-04-19T18:55:29 Z TB_ Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 1592 ms 89316 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<(int)n;i++)
#define Fo(i, k, n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define sp(x, y) fixed<<setprecision(y)<<x
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define clr(x) memset(x, 0, sizeof(x))
#define tr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define trr(it, x) for(auto it = x.rbegin(); it != x.rend(); it+)
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;



int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit); // remove if to endof file

    int n, m, x, y, type;
    char val;
    cin >> n >> m;
    vvi grid(n, vi(m, 0));
    fo(i, n){
        fo(j, m){
            cin >> val;
            if(val == 'F') grid[i][j] = 1;
            else if(val == 'R') grid[i][j] = 2;
        }
    }
    queue<tuple<int, int, int>> q;
    queue<tuple<int, int, int>> q2;
    q.push({0, 0, grid[0][0]});

    vpii dirs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
    int ans = 0;

    while(!q.empty()){
        ans++;
        tie(x, y, type) = q.front();
        int base = type;
        while(!q.empty()){
            tie(x, y, type) = q.front();
            q.pop();
            type = grid[x][y];
            if(!type) continue;
            if(type != base){
                q2.push({x, y, type});
                continue;
            }
            grid[x][y] = 0;
            fo(i, 4) {
                if(x+dirs[i].F<0 || x+dirs[i].F>=n || y+dirs[i].S<0 || y+dirs[i].S>=m) continue;
                type = grid[x+dirs[i].F][y+dirs[i].S];
                if(!type) continue;
                q.push({x+dirs[i].F, y+dirs[i].S, type});
            }
        }
        swap(q, q2);
    }
    cout << ans;

    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 1620 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 13 ms 1408 KB Output is correct
5 Correct 3 ms 740 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 5 ms 588 KB Output is correct
12 Correct 9 ms 860 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 19 ms 1608 KB Output is correct
16 Correct 23 ms 1456 KB Output is correct
17 Correct 12 ms 1268 KB Output is correct
18 Correct 12 ms 1236 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 76 ms 6472 KB Output is correct
3 Correct 448 ms 63092 KB Output is correct
4 Correct 99 ms 15064 KB Output is correct
5 Correct 276 ms 35668 KB Output is correct
6 Correct 1592 ms 89288 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 692 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 76 ms 6576 KB Output is correct
14 Correct 44 ms 3896 KB Output is correct
15 Correct 27 ms 4180 KB Output is correct
16 Correct 37 ms 2772 KB Output is correct
17 Correct 195 ms 16316 KB Output is correct
18 Correct 126 ms 16040 KB Output is correct
19 Correct 118 ms 15072 KB Output is correct
20 Correct 99 ms 13840 KB Output is correct
21 Correct 269 ms 36820 KB Output is correct
22 Correct 273 ms 35668 KB Output is correct
23 Correct 375 ms 30704 KB Output is correct
24 Correct 238 ms 35924 KB Output is correct
25 Correct 555 ms 63096 KB Output is correct
26 Correct 717 ms 48476 KB Output is correct
27 Correct 998 ms 67704 KB Output is correct
28 Correct 1570 ms 89316 KB Output is correct
29 Correct 1572 ms 83412 KB Output is correct
30 Correct 1306 ms 81356 KB Output is correct
31 Correct 1260 ms 41784 KB Output is correct
32 Correct 843 ms 66168 KB Output is correct