oj.uz

답안 #623756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623756 2022-08-06T13:04:33 Z IWTIM Zoo (COCI19_zoo) C++14
110 / 110
 107 ms 19984 KB 
# include <bits/stdc++.h>
using namespace std;
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
//const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define f first
#define s second
#define pii pair <int, int>
#define pb push_back
const int N = 3005;
int t,n, m, comp, dx[] = {0,0,1,-1}, dy[] = {1,-1,0,0};
int fix[N][N],dist[N][N];
char a[N][N];
int check(int i, int j) {
	if (min(i, j) <= 0 || i > n || j > m) return 0;
	return 1;
}
void dfs(int i, int j) {
	if (fix[i][j]) return ;
	fix[i][j] = comp;
	for (int id = 0; id < 4; id++) {
		int nxti = i + dx[id];
		int nxtj = j + dy[id];
		if (check(nxti, nxtj) && a[nxti][nxtj] == a[i][j]) dfs(nxti,nxtj);
	}
}
int get(int i, int j) {
	return (i - 1) * m + j;
}
pii back(int x) {
	if (x % m == 0) return {x / m, m};
	else return {x/m + 1, x % m};
}
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for (int i = 1; i <= n; i++) {
    	for (int j = 1; j <= m; j++) {
    		cin>>a[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j] != '*' && !fix[i][j]) {
				comp++;
				dfs(i,j);
			}
		}
	}
	deque <int> dq;
	dq.pb(1);
	dist[1][1] = 1;
	while (dq.size()) {
		int x = dq.front();
		int i = back(x).f;
		int j = back(x).s;
		dq.pop_front();
		for (int id = 0; id < 4; id++) {
			int nxti = i + dx[id]; int nxtj = j + dy[id];
			if (check(nxti, nxtj) && a[nxti][nxtj] != '*') {
				if (fix[nxti][nxtj] == fix[i][j] && !dist[nxti][nxtj]) dist[nxti][nxtj] = dist[i][j], dq.push_front(get(nxti,nxtj));
				if (fix[nxti][nxtj] != fix[i][j] && !dist[nxti][nxtj]) dist[nxti][nxtj] = dist[i][j] + 1, dq.pb(get(nxti, nxtj));
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			ans = max(ans, dist[i][j]);
		}
	}
	cout<<ans<<"\n";
}

Compilation message

zoo.cpp:129:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  129 | main() {
      | ^~~~

Subtask #1
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 1 ms 1368 KB Output is correct
10 Correct 2 ms 1500 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 2 ms 1236 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 2 ms 1236 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 1 ms 1368 KB Output is correct
10 Correct 2 ms 1500 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 2 ms 1236 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 2 ms 1236 KB Output is correct
16 Correct 27 ms 13832 KB Output is correct
17 Correct 28 ms 13776 KB Output is correct
18 Correct 30 ms 14124 KB Output is correct
19 Correct 34 ms 14460 KB Output is correct
20 Correct 30 ms 13860 KB Output is correct
21 Correct 89 ms 19032 KB Output is correct
22 Correct 86 ms 18964 KB Output is correct
23 Correct 99 ms 19236 KB Output is correct
24 Correct 107 ms 19984 KB Output is correct
25 Correct 105 ms 19824 KB Output is correct
26 Correct 103 ms 19288 KB Output is correct
27 Correct 90 ms 19104 KB Output is correct
28 Correct 92 ms 19092 KB Output is correct
29 Correct 92 ms 19888 KB Output is correct
30 Correct 95 ms 19580 KB Output is correct