Submission #124674

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
124674	2019-07-03T17:09:04 Z	arthurconmy	Mecho (IOI09_mecho)	C++14	6 / 100	1000 ms	13388 KB

mecho

// 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

	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))
		{
			l=mid;
		}

		else
		{
			r=mid-1;
		}
	}

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

Subtask #1

6.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1065 ms	3448 KB	Time limit exceeded
2	Incorrect	6 ms	3448 KB	Output isn't correct
3	Execution timed out	1067 ms	3448 KB	Time limit exceeded
4	Execution timed out	1081 ms	3448 KB	Time limit exceeded
5	Correct	7 ms	3448 KB	Output is correct
6	Execution timed out	1070 ms	3448 KB	Time limit exceeded
7	Incorrect	79 ms	6432 KB	Output isn't correct
8	Correct	7 ms	3448 KB	Output is correct
9	Incorrect	7 ms	3448 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	Execution timed out	1077 ms	3704 KB	Time limit exceeded
13	Incorrect	8 ms	3576 KB	Output isn't correct
14	Correct	9 ms	3704 KB	Output is correct
15	Incorrect	7 ms	3576 KB	Output isn't correct
16	Incorrect	7 ms	3576 KB	Output isn't correct
17	Incorrect	8 ms	3576 KB	Output isn't correct
18	Incorrect	7 ms	3576 KB	Output isn't correct
19	Execution timed out	1080 ms	3576 KB	Time limit exceeded
20	Incorrect	8 ms	3576 KB	Output isn't correct
21	Incorrect	8 ms	3576 KB	Output isn't correct
22	Incorrect	8 ms	3576 KB	Output isn't correct
23	Incorrect	8 ms	3580 KB	Output isn't correct
24	Incorrect	8 ms	3576 KB	Output isn't correct
25	Execution timed out	1069 ms	3708 KB	Time limit exceeded
26	Incorrect	9 ms	3704 KB	Output isn't correct
27	Incorrect	9 ms	3704 KB	Output isn't correct
28	Incorrect	9 ms	3704 KB	Output isn't correct
29	Execution timed out	1076 ms	3704 KB	Time limit exceeded
30	Incorrect	10 ms	3704 KB	Output isn't correct
31	Execution timed out	1071 ms	3704 KB	Time limit exceeded
32	Incorrect	10 ms	3832 KB	Output isn't correct
33	Incorrect	24 ms	4600 KB	Output isn't correct
34	Incorrect	56 ms	4600 KB	Output isn't correct
35	Incorrect	35 ms	4600 KB	Output isn't correct
36	Execution timed out	1088 ms	4728 KB	Time limit exceeded
37	Incorrect	68 ms	4856 KB	Output isn't correct
38	Incorrect	44 ms	4728 KB	Output isn't correct
39	Incorrect	31 ms	4856 KB	Output isn't correct
40	Incorrect	93 ms	4856 KB	Output isn't correct
41	Incorrect	65 ms	4856 KB	Output isn't correct
42	Execution timed out	1072 ms	5112 KB	Time limit exceeded
43	Incorrect	108 ms	4984 KB	Output isn't correct
44	Incorrect	70 ms	5112 KB	Output isn't correct
45	Incorrect	44 ms	5116 KB	Output isn't correct
46	Incorrect	134 ms	5240 KB	Output isn't correct
47	Incorrect	75 ms	5240 KB	Output isn't correct
48	Execution timed out	1076 ms	5344 KB	Time limit exceeded
49	Incorrect	154 ms	5496 KB	Output isn't correct
50	Incorrect	88 ms	5368 KB	Output isn't correct
51	Incorrect	80 ms	5496 KB	Output isn't correct
52	Incorrect	189 ms	5500 KB	Output isn't correct
53	Incorrect	117 ms	5624 KB	Output isn't correct
54	Execution timed out	1079 ms	5624 KB	Time limit exceeded
55	Incorrect	218 ms	5624 KB	Output isn't correct
56	Incorrect	119 ms	5740 KB	Output isn't correct
57	Execution timed out	1080 ms	5752 KB	Time limit exceeded
58	Incorrect	247 ms	5752 KB	Output isn't correct
59	Incorrect	149 ms	6008 KB	Output isn't correct
60	Execution timed out	1057 ms	5944 KB	Time limit exceeded
61	Incorrect	283 ms	6136 KB	Output isn't correct
62	Incorrect	186 ms	6008 KB	Output isn't correct
63	Incorrect	81 ms	6008 KB	Output isn't correct
64	Incorrect	81 ms	6008 KB	Output isn't correct
65	Incorrect	83 ms	6008 KB	Output isn't correct
66	Incorrect	88 ms	6008 KB	Output isn't correct
67	Correct	91 ms	6008 KB	Output is correct
68	Incorrect	90 ms	6136 KB	Output isn't correct
69	Incorrect	85 ms	6136 KB	Output isn't correct
70	Incorrect	83 ms	6136 KB	Output isn't correct
71	Incorrect	92 ms	6136 KB	Output isn't correct
72	Incorrect	83 ms	6136 KB	Output isn't correct
73	Incorrect	81 ms	7200 KB	Output isn't correct
74	Incorrect	79 ms	7168 KB	Output isn't correct
75	Incorrect	80 ms	7064 KB	Output isn't correct
76	Incorrect	80 ms	7320 KB	Output isn't correct
77	Incorrect	80 ms	7068 KB	Output isn't correct
78	Correct	78 ms	6840 KB	Output is correct
79	Incorrect	84 ms	6728 KB	Output isn't correct
80	Incorrect	83 ms	6820 KB	Output isn't correct
81	Incorrect	83 ms	6844 KB	Output isn't correct
82	Incorrect	80 ms	6868 KB	Output isn't correct
83	Runtime error	82 ms	13252 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
84	Runtime error	85 ms	13380 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
85	Runtime error	85 ms	13388 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
86	Runtime error	87 ms	13308 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
87	Runtime error	84 ms	13388 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
88	Incorrect	79 ms	6776 KB	Output isn't correct
89	Incorrect	78 ms	6776 KB	Output isn't correct
90	Incorrect	77 ms	6776 KB	Output isn't correct
91	Incorrect	78 ms	6776 KB	Output isn't correct
92	Incorrect	78 ms	6776 KB	Output isn't correct