oj.uz

Submission #491823

# Submission time Handle Problem Language Result Execution time Memory
491823 2021-12-04T15:59:36 Z Victor Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 892 ms 30236 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

# Verdict Execution time Memory Grader output
1 Correct 11 ms 988 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 6 ms 972 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 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 4 ms 716 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 9 ms 972 KB Output is correct
16 Correct 10 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2252 KB Output is correct
2 Correct 32 ms 2636 KB Output is correct
3 Correct 180 ms 20008 KB Output is correct
4 Correct 35 ms 5324 KB Output is correct
5 Correct 303 ms 11640 KB Output is correct
6 Correct 892 ms 30196 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 2 ms 2380 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 34 ms 2704 KB Output is correct
14 Correct 19 ms 1860 KB Output is correct
15 Correct 16 ms 1988 KB Output is correct
16 Correct 18 ms 1228 KB Output is correct
17 Correct 102 ms 5736 KB Output is correct
18 Correct 63 ms 5644 KB Output is correct
19 Correct 40 ms 5324 KB Output is correct
20 Correct 42 ms 4940 KB Output is correct
21 Correct 112 ms 11980 KB Output is correct
22 Correct 278 ms 11632 KB Output is correct
23 Correct 189 ms 10060 KB Output is correct
24 Correct 157 ms 11740 KB Output is correct
25 Correct 319 ms 20068 KB Output is correct
26 Correct 318 ms 15492 KB Output is correct
27 Correct 523 ms 21700 KB Output is correct
28 Correct 699 ms 30236 KB Output is correct
29 Correct 652 ms 28796 KB Output is correct
30 Correct 609 ms 27528 KB Output is correct
31 Correct 530 ms 13516 KB Output is correct
32 Correct 422 ms 20932 KB Output is correct