oj.uz

답안 #124672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124672 2019-07-03T17:06:55 Z arthurconmy Mecho (IOI09_mecho) C++14
0 / 100
 321 ms 12184 KB 
// check ctrl+v :^)
/* Arthur Conmy IOI template - minimal! */
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
#include <deque>
#include <chrono>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int,int>;
#define ff first
#define ss second
#define pb push_back
#define REP(i,a,b) \
for(int i = int(a); i<=int(b); i++)

int grid[802][802]; // 0: tree / boundary
					// 1: grass 
					// 2: hive
					// 3: mecho's home

int bee_dis[802][802];
int INF = int(1e9);
pii start;
int n,s;
bool vis[802][802];

bool try_it(int t)
{
	vector<pii> BFS = {start};

	int cur_dis=0;

	while(!BFS.empty())
	{
		// cout << cur_dis << endl;

		if(cur_dis%s == 0 && cur_dis!=0) t++;

		vector<pii> new_BFS;

		for(auto P:BFS)
		{
			REP(x,-1,1)
			{
				REP(y,-1,1)
				{
					// cout << P.ff+x << " " << P.ff+y << endl;

					if(vis[P.ff+x][P.ss+y]) continue;
					if(abs(x)+abs(y)!=1) continue;
					if(bee_dis[P.ff+x][P.ss+y] <= t) continue; // do we need to check that the current square isn't now bad?
						
					if(grid[P.ff+x][P.ss+y] == 3) return true;

					if(grid[P.ff+x][P.ss+y] != 1) continue;

					new_BFS.pb({P.ff+x,P.ss+y});
					vis[P.ff+x][P.ss+y]=1;
				}
			}

			BFS=new_BFS;
		}

		cur_dis++;
	}

	return false;
}

int main()
{
	#ifdef ARTHUR_LOCAL
		ifstream cin("input.txt");
	#endif

	REP(i,0,801)
	{
		REP(j,0,801)
		{
			bee_dis[i][j]=INF;
		}
	}

	cin>>n>>s;

	vector<pii> bees;

	REP(i,1,n)
	{
		string row;
		cin>>row;

		REP(j,1,n)
		{
			if(row[j-1]=='G') grid[i][j]=1;
			if(row[j-1]=='H')
			{
				grid[i][j]=2;
				bees.pb({i,j});
				bee_dis[i][j]=0;
			}
			if(row[j-1]=='M')
			{
				grid[i][j]=1; // Mecho's start is grassy
				start={i,j};
			}
			if(row[j-1]=='D')
			{
				grid[i][j]=3;
			}
		}
	}

	// precompute bee_dis

	while(!bees.empty())
	{
		vector<pii> new_bees;

		for(auto b:bees)
		{
			REP(x,-1,1)
			{
				REP(y,-1,1)
				{
					if(abs(x)+abs(y)!=1) continue;
					if(bee_dis[b.ff+x][b.ss+y] != INF) continue;
					if(grid[b.ff+x][b.ss+y] != 1) continue;

					bee_dis[b.ff+x][b.ss+y]=1+bee_dis[b.ff][b.ss];
					new_bees.pb({b.ff+x,b.ss+y});
				}
			}
		}

		bees=new_bees;
	}

	// REP(i,1,n)
	// {
	// 	REP(j,1,n)
	// 	{
	// 		if(bee_dis[i][j]==INF)
	// 		{
	// 			cout << "-1 ";
	// 			continue;
	// 		}

	// 		cout << bee_dis[i][j] << " ";
	// 		if(bee_dis[i][j]<10) cout << " "; 
	// 	}
	// 	cout << endl;
	// }

	vis[start.ff][start.ss]=1;
	int l=0;
	int r=n*n; // bin search parameters

	cout << try_it(0) << endl;

	while(l<r)
	{
		REP(i,0,801)
		{
			REP(j,0,801)
			{
				vis[i][j]=0;
			}
		}

		// cout << l << " " << r << endl;

		vis[start.ff][start.ss]=1;

		int mid=(l+r)/2;

		if(try_it(mid))
		{
			if(l==mid) r=mid;
			l=mid;
		}

		else
		{
			if(r==mid) l=mid;
			r=mid;
		}
	}

	if(!try_it(0)) cout << -1 << endl;
	else cout << l << endl;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 3448 KB Output isn't correct
2 Incorrect 6 ms 3576 KB Output isn't correct
3 Incorrect 6 ms 3448 KB Output isn't correct
4 Incorrect 7 ms 3448 KB Output isn't correct
5 Incorrect 7 ms 3448 KB Output isn't correct
6 Incorrect 7 ms 3576 KB Output isn't correct
7 Incorrect 78 ms 6424 KB Output isn't correct
8 Incorrect 7 ms 3576 KB Output isn't correct
9 Incorrect 9 ms 3448 KB Output isn't correct
10 Incorrect 8 ms 3576 KB Output isn't correct
11 Incorrect 7 ms 3448 KB Output isn't correct
12 Incorrect 9 ms 3704 KB Output isn't correct
13 Incorrect 9 ms 3704 KB Output isn't correct
14 Incorrect 11 ms 3704 KB Output isn't correct
15 Incorrect 8 ms 3576 KB Output isn't correct
16 Incorrect 8 ms 3576 KB Output isn't correct
17 Incorrect 8 ms 3576 KB Output isn't correct
18 Incorrect 8 ms 3576 KB Output isn't correct
19 Incorrect 8 ms 3576 KB Output isn't correct
20 Incorrect 8 ms 3576 KB Output isn't correct
21 Incorrect 9 ms 3576 KB Output isn't correct
22 Incorrect 9 ms 3576 KB Output isn't correct
23 Incorrect 10 ms 3576 KB Output isn't correct
24 Incorrect 10 ms 3676 KB Output isn't correct
25 Incorrect 10 ms 3576 KB Output isn't correct
26 Incorrect 11 ms 3704 KB Output isn't correct
27 Incorrect 11 ms 3704 KB Output isn't correct
28 Incorrect 11 ms 3704 KB Output isn't correct
29 Incorrect 10 ms 3704 KB Output isn't correct
30 Incorrect 11 ms 3704 KB Output isn't correct
31 Incorrect 10 ms 3704 KB Output isn't correct
32 Incorrect 12 ms 3704 KB Output isn't correct
33 Incorrect 25 ms 4600 KB Output isn't correct
34 Incorrect 62 ms 4520 KB Output isn't correct
35 Incorrect 39 ms 4600 KB Output isn't correct
36 Incorrect 29 ms 4728 KB Output isn't correct
37 Incorrect 78 ms 4700 KB Output isn't correct
38 Incorrect 52 ms 4728 KB Output isn't correct
39 Incorrect 32 ms 4828 KB Output isn't correct
40 Incorrect 99 ms 4984 KB Output isn't correct
41 Incorrect 65 ms 4956 KB Output isn't correct
42 Incorrect 36 ms 4984 KB Output isn't correct
43 Incorrect 117 ms 5084 KB Output isn't correct
44 Incorrect 77 ms 5240 KB Output isn't correct
45 Incorrect 42 ms 5240 KB Output isn't correct
46 Incorrect 157 ms 5240 KB Output isn't correct
47 Incorrect 96 ms 5240 KB Output isn't correct
48 Incorrect 48 ms 5340 KB Output isn't correct
49 Incorrect 177 ms 5444 KB Output isn't correct
50 Incorrect 103 ms 5368 KB Output isn't correct
51 Incorrect 54 ms 5496 KB Output isn't correct
52 Incorrect 207 ms 5496 KB Output isn't correct
53 Incorrect 140 ms 5496 KB Output isn't correct
54 Incorrect 63 ms 5640 KB Output isn't correct
55 Incorrect 233 ms 5624 KB Output isn't correct
56 Incorrect 150 ms 5752 KB Output isn't correct
57 Incorrect 67 ms 5880 KB Output isn't correct
58 Incorrect 283 ms 5856 KB Output isn't correct
59 Runtime error 88 ms 11640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
60 Incorrect 83 ms 6012 KB Output isn't correct
61 Incorrect 321 ms 6008 KB Output isn't correct
62 Incorrect 267 ms 5980 KB Output isn't correct
63 Incorrect 90 ms 6008 KB Output isn't correct
64 Incorrect 81 ms 6008 KB Output isn't correct
65 Incorrect 88 ms 5980 KB Output isn't correct
66 Incorrect 82 ms 5920 KB Output isn't correct
67 Incorrect 88 ms 6068 KB Output isn't correct
68 Incorrect 83 ms 6136 KB Output isn't correct
69 Incorrect 90 ms 6052 KB Output isn't correct
70 Incorrect 95 ms 6136 KB Output isn't correct
71 Incorrect 85 ms 6136 KB Output isn't correct
72 Incorrect 85 ms 6044 KB Output isn't correct
73 Incorrect 82 ms 7076 KB Output isn't correct
74 Incorrect 99 ms 7196 KB Output isn't correct
75 Incorrect 82 ms 7196 KB Output isn't correct
76 Incorrect 82 ms 7324 KB Output isn't correct
77 Incorrect 83 ms 7168 KB Output isn't correct
78 Incorrect 81 ms 6720 KB Output isn't correct
79 Incorrect 83 ms 7000 KB Output isn't correct
80 Incorrect 87 ms 6872 KB Output isn't correct
81 Incorrect 85 ms 6744 KB Output isn't correct
82 Incorrect 83 ms 6744 KB Output isn't correct
83 Runtime error 84 ms 12116 KB Execution killed with signal 11 (could be triggered by violating memory limits)
84 Runtime error 88 ms 12116 KB Execution killed with signal 11 (could be triggered by violating memory limits)
85 Runtime error 81 ms 12108 KB Execution killed with signal 11 (could be triggered by violating memory limits)
86 Runtime error 82 ms 12104 KB Execution killed with signal 11 (could be triggered by violating memory limits)
87 Runtime error 79 ms 12184 KB Execution killed with signal 11 (could be triggered by violating memory limits)
88 Incorrect 80 ms 6644 KB Output isn't correct
89 Incorrect 85 ms 6756 KB Output isn't correct
90 Incorrect 78 ms 6776 KB Output isn't correct
91 Incorrect 79 ms 6648 KB Output isn't correct
92 Incorrect 81 ms 6744 KB Output isn't correct