oj.uz

답안 #124670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124670 2019-07-03T17:04:07 Z arthurconmy Mecho (IOI09_mecho) C++14
9 / 100
 335 ms 13516 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(3) << 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(l==n*n) cout << -1 << endl;
	else cout << l << endl;
}

Subtask #1
9.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 3448 KB Output isn't correct
2 Incorrect 6 ms 3448 KB Output isn't correct
3 Incorrect 6 ms 3448 KB Output isn't correct
4 Incorrect 6 ms 3448 KB Output isn't correct
5 Correct 7 ms 3576 KB Output is correct
6 Correct 7 ms 3448 KB Output is correct
7 Incorrect 79 ms 6424 KB Output isn't correct
8 Incorrect 7 ms 3448 KB Output isn't correct
9 Incorrect 7 ms 3452 KB Output isn't correct
10 Incorrect 7 ms 3448 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 Correct 9 ms 3704 KB Output is correct
14 Incorrect 9 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 3532 KB Output isn't correct
18 Incorrect 8 ms 3504 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 8 ms 3576 KB Output isn't correct
23 Incorrect 9 ms 3704 KB Output isn't correct
24 Incorrect 9 ms 3704 KB Output isn't correct
25 Incorrect 10 ms 3704 KB Output isn't correct
26 Incorrect 9 ms 3576 KB Output isn't correct
27 Incorrect 9 ms 3704 KB Output isn't correct
28 Incorrect 11 ms 3676 KB Output isn't correct
29 Incorrect 11 ms 3704 KB Output isn't correct
30 Incorrect 10 ms 3704 KB Output isn't correct
31 Incorrect 10 ms 3704 KB Output isn't correct
32 Incorrect 11 ms 3704 KB Output isn't correct
33 Incorrect 23 ms 4600 KB Output isn't correct
34 Incorrect 58 ms 4644 KB Output isn't correct
35 Incorrect 39 ms 4600 KB Output isn't correct
36 Incorrect 27 ms 4728 KB Output isn't correct
37 Incorrect 78 ms 4856 KB Output isn't correct
38 Incorrect 54 ms 4732 KB Output isn't correct
39 Incorrect 32 ms 4856 KB Output isn't correct
40 Incorrect 94 ms 4808 KB Output isn't correct
41 Incorrect 60 ms 5112 KB Output isn't correct
42 Incorrect 36 ms 5112 KB Output isn't correct
43 Incorrect 115 ms 5112 KB Output isn't correct
44 Incorrect 79 ms 4984 KB Output isn't correct
45 Incorrect 42 ms 5268 KB Output isn't correct
46 Incorrect 147 ms 5240 KB Output isn't correct
47 Incorrect 103 ms 5240 KB Output isn't correct
48 Incorrect 51 ms 5368 KB Output isn't correct
49 Incorrect 166 ms 5368 KB Output isn't correct
50 Incorrect 93 ms 5420 KB Output isn't correct
51 Incorrect 55 ms 5496 KB Output isn't correct
52 Incorrect 194 ms 5560 KB Output isn't correct
53 Incorrect 125 ms 5576 KB Output isn't correct
54 Incorrect 60 ms 5592 KB Output isn't correct
55 Incorrect 226 ms 5624 KB Output isn't correct
56 Incorrect 137 ms 5752 KB Output isn't correct
57 Incorrect 68 ms 5844 KB Output isn't correct
58 Incorrect 271 ms 5880 KB Output isn't correct
59 Incorrect 165 ms 5880 KB Output isn't correct
60 Incorrect 80 ms 5908 KB Output isn't correct
61 Incorrect 335 ms 6108 KB Output isn't correct
62 Incorrect 211 ms 6008 KB Output isn't correct
63 Correct 84 ms 5948 KB Output is correct
64 Incorrect 81 ms 6008 KB Output isn't correct
65 Incorrect 81 ms 6008 KB Output isn't correct
66 Incorrect 81 ms 6008 KB Output isn't correct
67 Incorrect 81 ms 6012 KB Output isn't correct
68 Correct 83 ms 6036 KB Output is correct
69 Incorrect 148 ms 6136 KB Output isn't correct
70 Incorrect 82 ms 6064 KB Output isn't correct
71 Incorrect 83 ms 6136 KB Output isn't correct
72 Incorrect 83 ms 6264 KB Output isn't correct
73 Incorrect 83 ms 7088 KB Output isn't correct
74 Incorrect 79 ms 7196 KB Output isn't correct
75 Incorrect 79 ms 7192 KB Output isn't correct
76 Incorrect 79 ms 7068 KB Output isn't correct
77 Incorrect 81 ms 7112 KB Output isn't correct
78 Incorrect 80 ms 6740 KB Output isn't correct
79 Incorrect 81 ms 6744 KB Output isn't correct
80 Incorrect 81 ms 6844 KB Output isn't correct
81 Incorrect 80 ms 6740 KB Output isn't correct
82 Incorrect 81 ms 6736 KB Output isn't correct
83 Runtime error 83 ms 13256 KB Execution killed with signal 11 (could be triggered by violating memory limits)
84 Runtime error 84 ms 13260 KB Execution killed with signal 11 (could be triggered by violating memory limits)
85 Runtime error 88 ms 13388 KB Execution killed with signal 11 (could be triggered by violating memory limits)
86 Runtime error 83 ms 13384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
87 Runtime error 84 ms 13516 KB Execution killed with signal 11 (could be triggered by violating memory limits)
88 Correct 80 ms 6776 KB Output is correct
89 Incorrect 79 ms 6696 KB Output isn't correct
90 Incorrect 78 ms 6648 KB Output isn't correct
91 Incorrect 78 ms 6648 KB Output isn't correct
92 Incorrect 79 ms 6776 KB Output isn't correct