oj.uz

답안 #491822

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491822 2021-12-04T15:58:25 Z Victor Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 637 ms 30200 KB 
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

int dr[] = {1, -1, 0, 0};
int dc[] = {0, 0, -1, 1};

bitset<4001> visited[4001], taken[4001];
string grid[4001];
int rows, cols, ans = 0;
char cur_animal;

bool valid(int row, int col) { return 0 <= row && row < rows && 0 <= col && col < cols; }

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    cin >> rows >> cols;

    rep(i, 0, rows) cin >> grid[i];

    cur_animal = grid[0][0];
    queue<ii> q;
    visited[0][0] = 1;
    q.emplace(0, 0);

    while (!q.empty()) {
        queue<ii> nxtq;

        while (!q.empty()) {
            int row, col;
            tie(row, col) = q.front();
            q.pop();

            rep(i, 0, 4) {
                int nr = row + dr[i], nc = col + dc[i];
                if (valid(nr, nc)) {
                    if (!visited[nr][nc] && grid[nr][nc] == cur_animal) {
                        q.emplace(nr, nc);
                        visited[nr][nc] = 1;
                    }
                    if (!visited[nr][nc] && grid[nr][nc] != cur_animal && grid[nr][nc] != '.') {
                        visited[nr][nc] = 1;
                        nxtq.emplace(nr, nc);
                    }
                }
            }
        }

        if (cur_animal == 'F')
            cur_animal = 'R';
        else
            cur_animal = 'F';

        q.swap(nxtq);
        ++ans;
    }

    cout << ans << endl;
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 972 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 5 ms 972 KB Output is correct
5 Correct 2 ms 684 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 9 ms 988 KB Output is correct
16 Correct 11 ms 972 KB Output is correct
17 Correct 6 ms 944 KB Output is correct
18 Correct 5 ms 972 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2252 KB Output is correct
2 Correct 32 ms 2700 KB Output is correct
3 Correct 177 ms 20044 KB Output is correct
4 Correct 35 ms 5292 KB Output is correct
5 Correct 283 ms 11640 KB Output is correct
6 Correct 635 ms 30200 KB Output is correct
7 Correct 2 ms 2380 KB Output is correct
8 Correct 2 ms 2252 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 3 ms 2380 KB Output is correct
12 Correct 2 ms 460 KB Output is correct
13 Correct 33 ms 2636 KB Output is correct
14 Correct 19 ms 1864 KB Output is correct
15 Correct 16 ms 1992 KB Output is correct
16 Correct 17 ms 1228 KB Output is correct
17 Correct 89 ms 5732 KB Output is correct
18 Correct 62 ms 5580 KB Output is correct
19 Correct 36 ms 5324 KB Output is correct
20 Correct 41 ms 4880 KB Output is correct
21 Correct 107 ms 12008 KB Output is correct
22 Correct 299 ms 11636 KB Output is correct
23 Correct 184 ms 10060 KB Output is correct
24 Correct 148 ms 11736 KB Output is correct
25 Correct 342 ms 20068 KB Output is correct
26 Correct 329 ms 15468 KB Output is correct
27 Correct 462 ms 21740 KB Output is correct
28 Correct 637 ms 30184 KB Output is correct
29 Correct 633 ms 28656 KB Output is correct
30 Correct 552 ms 27580 KB Output is correct
31 Correct 512 ms 13648 KB Output is correct
32 Correct 471 ms 20804 KB Output is correct