제출 #1120479

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120479		AtabayRajabli	Palindrome-Free Numbers (BOI13_numbers)	C++17	1.25 / 100	1114 ms	34140 KiB

numbers

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;

const int sz = 4e3 + 5;
int n, m, used[sz][sz];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
string s[sz];

bool ok(int i, int j)
{
    return 0 <= i && i < n && 0 <= j && j < m && !used[i][j] && s[i][j] != '.';
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n >> m;
    for(int i = 0; i < n; i++) cin >> s[i];

    queue<array<int, 2>> q[2];
    bool cur = 0;
    int ans = 0;
    q[cur].push({0, 0});
    used[0][0] = 1;
    while(!q[cur].empty())
    {
        ans++;
        while(!q[cur].empty())
        {
            array<int, 2> xy = q[cur].front();
            q[cur].pop();
            for(int i = 0; i < 4; i++)
            {
                int nx = dx[i] + xy[0], ny = dy[i] + xy[1];
                if(ok(nx, ny))
                {
                    assert(0 <= nx && nx < n);
                    assert(0 <= ny && ny < m);
                    assert(used[nx][ny] == 0);
                    assert(s[nx][ny] != '.');
                    if(s[nx][ny] == s[xy[0]][xy[1]]) q[cur].push({nx, ny});
                    else q[cur ^ 1].push({nx, ny});
                    used[nx][ny] = 1;
                }
            }
        }
        cur ^= 1;
    }
    cout << ans;
}  

• Subtask 1: 1.25 / 25
• Subtask 2: 0 / 75