oj.uz

답안 #138391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
138391 2019-07-29T20:43:12 Z silxikys Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 1774 ms 239292 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
const int maxn = 4005;
int H, W;
char grid[maxn][maxn];
bool seen[maxn][maxn];
 
int dx[] = {0,1,0,-1};
int dy[] = {1,0,-1,0};
 
bool valid(int x, int y) {
    return 0 <= x && x < H && 0 <= y && y < W;
}

pair<int,int> qq[maxn*maxn], nxtt[maxn*maxn];

struct Queue
{
    pair<int,int> *q;
    int l = 0, r = 0;
    void push(pair<int,int> p) {
        q[r++] = p;  
    }
    void pop() {
        l++;
    }
    pair<int,int> front() {
        return q[l];
    }
    void clear() {
        l = 0;
        r = 0;
    }
    bool empty() {
        return l == r;
    }
};
 
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> H >> W;
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            cin >> grid[i][j];
        }
    }
    if (H == 1 && W == 1) {
        cout << 1 << '\n';
        return 0;
    }
    Queue q, nxt;
    q.q = qq;
    nxt.q = nxtt;
    nxt.push({0,-1});
    char curr = grid[0][0];
    int ans = 0;
    int counter = 0;
    while (true) {
        int added = 0;
        //cout << "level " << ans << '\n';
        //cout << nxt.size() << '\n';
        while (!nxt.empty()) {
            q.push(nxt.front());
            nxt.pop();
        }
        nxt.clear();
        while (!q.empty()) {
            counter++;
            auto p = q.front(); q.pop();
            //cout << p.first << ' ' << p.second << '\n';
            for (int k = 0; k < 4; k++) {
                int nx = p.first + dx[k];
                int ny = p.second + dy[k];
                if (!valid(nx,ny)) continue;
                if (seen[nx][ny]) continue;
                if (grid[nx][ny] != curr) continue;
                seen[nx][ny] = true;
                q.push({nx,ny});
                nxt.push({nx,ny});
                added++;
            }
        }
        q.clear();
        curr = curr == 'R' ? 'F' : 'R';
        if (added == 0) break;
        ans++;
    }
    cout << ans << '\n';
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 4472 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 760 KB Output is correct
4 Correct 16 ms 5752 KB Output is correct
5 Correct 7 ms 2680 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 7 ms 2296 KB Output is correct
11 Correct 6 ms 2424 KB Output is correct
12 Correct 11 ms 2808 KB Output is correct
13 Correct 7 ms 2680 KB Output is correct
14 Correct 7 ms 2680 KB Output is correct
15 Correct 23 ms 4452 KB Output is correct
16 Correct 25 ms 4472 KB Output is correct
17 Correct 20 ms 4216 KB Output is correct
18 Correct 16 ms 5752 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 30328 KB Output is correct
2 Correct 96 ms 10360 KB Output is correct
3 Correct 554 ms 32012 KB Output is correct
4 Correct 137 ms 15352 KB Output is correct
5 Correct 293 ms 23936 KB Output is correct
6 Correct 1774 ms 180144 KB Output is correct
7 Correct 40 ms 31736 KB Output is correct
8 Correct 36 ms 30328 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 37 ms 31224 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 95 ms 10232 KB Output is correct
14 Correct 58 ms 7544 KB Output is correct
15 Correct 39 ms 8184 KB Output is correct
16 Correct 49 ms 3576 KB Output is correct
17 Correct 271 ms 16348 KB Output is correct
18 Correct 159 ms 16120 KB Output is correct
19 Correct 146 ms 15172 KB Output is correct
20 Correct 130 ms 14340 KB Output is correct
21 Correct 346 ms 24952 KB Output is correct
22 Correct 299 ms 23928 KB Output is correct
23 Correct 532 ms 20216 KB Output is correct
24 Correct 289 ms 24824 KB Output is correct
25 Correct 548 ms 31992 KB Output is correct
26 Correct 1059 ms 219576 KB Output is correct
27 Correct 1312 ms 239292 KB Output is correct
28 Correct 1654 ms 180072 KB Output is correct
29 Correct 1560 ms 165464 KB Output is correct
30 Correct 1399 ms 212632 KB Output is correct
31 Correct 1148 ms 27896 KB Output is correct
32 Correct 1228 ms 230468 KB Output is correct