Submission #206317

#	Time	Username	Problem	Language	Result	Execution time	Memory
206317		wiwiho	Zoo (COCI19_zoo)	C++14	110 / 110	158 ms	22008 KiB

zoo

//#define NDEBUG

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define F first
#define S second
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tiii tuple<int, int, int>
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) ((a) / (b) + !!((a) % (b)))

//#define TEST

typedef long long ll;
typedef unsigned long long ull;

using namespace std;
using namespace __gnu_pbds;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

vector<string> a;
vector<vector<int>> id;
vector<pii> d = {mp(0, 1), mp(1, 0), mp(0, -1), mp(-1, 0)};

void dfs(int x, int y, int cnt){
    id[x][y] = cnt;
    for(pii i : d){
        int nx = x + i.F;
        int ny = y + i.S;
        if(a[nx][ny] == a[x][y] && id[nx][ny] == -1) dfs(nx, ny, cnt);
    }
}

int main(){
    StarBurstStream

    int r, c;
    cin >> r >> c;

    a.resize(r + 2);
    a[0] = a[r + 1] = string(c + 2, '*');
    for(int i = 1; i <= r; i++){
        cin >> a[i];
        a[i] = '*' + a[i] + '*';
    }

    id.resize(r + 2, vector<int>(c + 2, -1));
    int cnt = 1;
    for(int i = 1; i <= r; i++){
        for(int j = 1; j <= c; j++){
            if(a[i][j] != '*' && id[i][j] == -1) dfs(i, j, cnt++);
        }
//        printv(id[i], cerr);
    }

    vector<vector<int>> g(cnt);
    for(int i = 1; i <= r; i++){
        for(int j = 1; j <= c; j++){
            for(pii k : d){
                //cerr << i << " " << j << " " << i + k.F << " " << j + k.S << " " << id[i][j] << " " << id[i + k.F][i + k.S] << "\n";
                if(id[i][j] != -1 && id[i + k.F][j + k.S] != -1 && id[i + k.F][j + k.S] != id[i][j]) g[id[i][j]].eb(id[i + k.F][j + k.S]);
            }
        }
    }

    vector<int> dis(cnt, -1);
    queue<int> q;
    dis[id[r][c]] = 0;
    q.push(id[r][c]);
    while(!q.empty()){
        int now = q.front();
        q.pop();
        for(int i : g[now]){
            if(dis[i] != -1) continue;
            dis[i] = dis[now] + 1;
            q.push(i);
        }
    }

    cout << *max_element(iter(dis)) + 1 << "\n";

    return 0;
}

• Subtask 1: 45 / 45
• Subtask 2: 65 / 65