oj.uz

답안 #217145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217145 2020-03-29T06:37:07 Z NONAME Emacs (COCI20_emacs) C++17
50 / 50
 7 ms 384 KB 
#include <bits/stdc++.h>
#include <time.h>
//#include <random>
//#ifndef _LOCAL
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#endif
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 3 * 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;

//mt19937 rnd(0);

queue <pii> q;
int n, m, rs, x, y;
bool mk[100][100];

void put(int x, int y) {
    q.push({x, y});
    mk[x][y] = 1;
}

void get(int &x, int &y) {
    x = q.front().ft;
    y = q.front().sd;

    q.pop();
}

void putall(int x, int y) {
    int steps[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

    for (int i = 0; i < 4; i++) {
        int cx = x + steps[i][0];
        int cy = y + steps[i][1];

        if (cx >= 0 && cx < n && cy >= 0 && cy < m && !mk[cx][cy])
            put(cx, cy);
    }
}

bool found(int &x, int &y) {
    for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
        if (!mk[i][j]) {
            x = i;
            y = j;
            return 1;
        }

    return 0;
}

void solve() {
    rs = 0;

    cin >> n >> m;
    for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
        char c; cin >> c;
        mk[i][j] = 0;
        if (c == '.')
            mk[i][j] = 1;
    }

    while (found(x, y)) {
        rs++;

        put(x, y);
        while (!q.empty()) {
            get(x, y);
            putall(x, y);
        }
    }

    cout << rs;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef _LOCAL
        in("input.txt");

        int t = 1;
        cin >> t;
        for (int i = 1; i <= t; i++) {
            cout << "Test #" << i << elf;

            clock_t start_time = clock();

            solve();

            cerr.precision(4); cerr << fixed;
            cerr << elf;
            cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;

            cout << elf;
        }
    #else
        int t = 1;
//        cin >> t;

        while (t--) {
            solve();
            cout << el;
        }
    #endif
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct