| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 865811 | efedmrlr | Mecho (IOI09_mecho) | C++17 | 603 ms | 6556 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,s;
vector<vector<int> > grid;
vector<array<int,2> > hives;
array<int,2> st, en;
vector<vector<int> > vis;
void find_adj(int x, int y, vector<array<int,2> > &ret) {
if(grid[x + 1][y] == 1 && vis[x + 1][y] != 1) {
ret.pb({x + 1, y});
}
if(grid[x - 1][y] == 1 && vis[x - 1][y] != 1) {
ret.pb({x - 1, y});
}
if(grid[x][y + 1] == 1 && vis[x][y + 1] != 1) {
ret.pb({x, y + 1});
}
if(grid[x][y - 1] == 1 && vis[x][y - 1] != 1) {
ret.pb({x, y - 1});
}
}
void bear_adj(int x, int y, vector<array<int,2> > &ret) {
if(grid[x + 1][y] && !vis[x + 1][y]) {
ret.pb({x + 1, y});
}
if(grid[x - 1][y] && !vis[x - 1][y]) {
ret.pb({x - 1, y});
}
if(grid[x][y + 1] && !vis[x][y + 1]) {
ret.pb({x, y + 1});
}
if(grid[x][y - 1] && !vis[x][y - 1]) {
ret.pb({x, y - 1});
}
}
bool bfs(int delay) {
queue<array<int,2> > hque, bque;
vis.assign(n+1, vector<int> (n+1, 0));
for(auto c : hives) {
hque.push(c);
vis[c[0]][c[1]] = 1;
}
bque.push(st);
hque.push({-1,-1});
bque.push({-1,-1});
int bdist = 0;
while(hque.size() > 1 && bdist < delay) {
auto bee = hque.front();
hque.pop();
if(bee[0] == -1) {
bdist++;
hque.push({-1,-1});
continue;
}
vector<array<int,2> > adj;
find_adj(bee[0], bee[1], adj);
for(auto c : adj) {
vis[c[0]][c[1]] = 1;
hque.push(c);
}
}
bdist = 0;
while(hque.size() > 1 && bque.size() > 1) {
auto cur = bque.front();
bque.pop();
if(cur[0] == -1) {
bdist++;
bque.push({-1,-1});
if(bdist == s) {
bdist = 0;
while(hque.size() > 1) {
auto bee = hque.front();
hque.pop();
if(bee[0] == -1) {
hque.push({-1,-1});
break;
}
vector<array<int,2> > adj;
find_adj(bee[0], bee[1], adj);
for(auto c : adj) {
vis[c[0]][c[1]] = 1;
hque.push(c);
}
}
}
continue;
}
if(cur == en) {
return 1;
}
if(vis[cur[0]][cur[1]] == 1) {
continue;
}
vector<array<int,2> > adj;
bear_adj(cur[0], cur[1], adj);
for(auto c : adj) {
vis[c[0]][c[1]] = 2;
bque.push(c);
}
}
return 0;
}
inline void solve() {
cin >> n >> s;
grid.resize(n+3, vector<int>(n+3, 0));
for(int i = 1; i<=n; i++) {
for(int j = 1; j<=n; j++) {
char tmp;
cin >> tmp;
if(tmp == 'T') {
}
else if(tmp == 'G') {
grid[i][j] = 1;
}
else if(tmp == 'M') {
grid[i][j] = 1;
st = {i,j};
}
else if(tmp == 'D') {
grid[i][j] = 3;
en = {i,j};
}
else {
grid[i][j] = 1;
hives.pb({i,j});
}
}
}
int l = 0, r = (n+5)*(n+5);
while(l < r) {
int m = (l + r) / 2;
bool tmp = bfs(m);
if(tmp) {
l = m + 1;
}
else {
r = m;
}
}
bool tmp = bfs(l);
if(tmp) {
cout<<l<<"\n";
}
else {
cout<<l-1<<"\n";
}
}
signed main() {
//fastio();
int test = 1;
//cin>>test;
while(test--) {
solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||