답안 #124676

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
124676	2019-07-03T17:10:01 Z	arthurconmy	Mecho (IOI09_mecho)	C++14	6 / 100	1000 ms	13516 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;
		}
	}

	REP(i,0,801)
	{
		REP(j,0,801)
		{
			vis[i][j]=0;
		}
	}
	vis[start.ff][start.ss]=1;

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

Subtask #1

6.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1069 ms	3448 KB	Time limit exceeded
2	Incorrect	6 ms	3448 KB	Output isn't correct
3	Execution timed out	1081 ms	3448 KB	Time limit exceeded
4	Execution timed out	1079 ms	3448 KB	Time limit exceeded
5	Correct	6 ms	3448 KB	Output is correct
6	Execution timed out	1076 ms	3448 KB	Time limit exceeded
7	Incorrect	77 ms	6432 KB	Output isn't correct
8	Correct	7 ms	3448 KB	Output is correct
9	Incorrect	7 ms	3576 KB	Output isn't correct
10	Incorrect	7 ms	3448 KB	Output isn't correct
11	Incorrect	7 ms	3576 KB	Output isn't correct
12	Execution timed out	1074 ms	3704 KB	Time limit exceeded
13	Incorrect	10 ms	3576 KB	Output isn't correct
14	Correct	10 ms	3676 KB	Output is correct
15	Incorrect	9 ms	3576 KB	Output isn't correct
16	Incorrect	8 ms	3576 KB	Output isn't correct
17	Incorrect	9 ms	3576 KB	Output isn't correct
18	Incorrect	8 ms	3584 KB	Output isn't correct
19	Execution timed out	1067 ms	3576 KB	Time limit exceeded
20	Incorrect	8 ms	3548 KB	Output isn't correct
21	Incorrect	8 ms	3548 KB	Output isn't correct
22	Incorrect	8 ms	3576 KB	Output isn't correct
23	Incorrect	9 ms	3676 KB	Output isn't correct
24	Incorrect	9 ms	3704 KB	Output isn't correct
25	Execution timed out	1057 ms	3624 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	10 ms	3704 KB	Output isn't correct
29	Execution timed out	1073 ms	3644 KB	Time limit exceeded
30	Incorrect	10 ms	3704 KB	Output isn't correct
31	Execution timed out	1069 ms	3704 KB	Time limit exceeded
32	Incorrect	10 ms	3704 KB	Output isn't correct
33	Incorrect	23 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	1067 ms	4728 KB	Time limit exceeded
37	Incorrect	71 ms	4764 KB	Output isn't correct
38	Incorrect	46 ms	4728 KB	Output isn't correct
39	Incorrect	32 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	1078 ms	5112 KB	Time limit exceeded
43	Incorrect	111 ms	4984 KB	Output isn't correct
44	Incorrect	68 ms	5112 KB	Output isn't correct
45	Incorrect	41 ms	5244 KB	Output isn't correct
46	Incorrect	132 ms	5240 KB	Output isn't correct
47	Incorrect	82 ms	5240 KB	Output isn't correct
48	Execution timed out	1088 ms	5372 KB	Time limit exceeded
49	Incorrect	157 ms	5540 KB	Output isn't correct
50	Incorrect	97 ms	5452 KB	Output isn't correct
51	Incorrect	53 ms	5496 KB	Output isn't correct
52	Incorrect	199 ms	5496 KB	Output isn't correct
53	Incorrect	126 ms	5496 KB	Output isn't correct
54	Execution timed out	1070 ms	5600 KB	Time limit exceeded
55	Incorrect	224 ms	5624 KB	Output isn't correct
56	Incorrect	125 ms	5752 KB	Output isn't correct
57	Execution timed out	1075 ms	5852 KB	Time limit exceeded
58	Incorrect	257 ms	6012 KB	Output isn't correct
59	Incorrect	142 ms	5912 KB	Output isn't correct
60	Execution timed out	1085 ms	5980 KB	Time limit exceeded
61	Incorrect	282 ms	6008 KB	Output isn't correct
62	Incorrect	206 ms	6060 KB	Output isn't correct
63	Incorrect	82 ms	5916 KB	Output isn't correct
64	Incorrect	81 ms	6136 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	Correct	81 ms	6008 KB	Output is correct
68	Incorrect	82 ms	6136 KB	Output isn't correct
69	Incorrect	83 ms	6264 KB	Output isn't correct
70	Incorrect	82 ms	6136 KB	Output isn't correct
71	Incorrect	82 ms	6108 KB	Output isn't correct
72	Incorrect	82 ms	6136 KB	Output isn't correct
73	Incorrect	80 ms	7064 KB	Output isn't correct
74	Incorrect	81 ms	7064 KB	Output isn't correct
75	Incorrect	80 ms	7060 KB	Output isn't correct
76	Incorrect	80 ms	7324 KB	Output isn't correct
77	Incorrect	79 ms	7188 KB	Output isn't correct
78	Correct	80 ms	6872 KB	Output is correct
79	Incorrect	80 ms	6860 KB	Output isn't correct
80	Incorrect	82 ms	6836 KB	Output isn't correct
81	Incorrect	80 ms	6840 KB	Output isn't correct
82	Incorrect	79 ms	6744 KB	Output isn't correct
83	Runtime error	85 ms	13428 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
84	Runtime error	85 ms	13388 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
85	Runtime error	86 ms	13428 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
86	Runtime error	86 ms	13260 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
87	Runtime error	92 ms	13516 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
88	Incorrect	79 ms	6720 KB	Output isn't correct
89	Incorrect	79 ms	6780 KB	Output isn't correct
90	Incorrect	77 ms	6668 KB	Output isn't correct
91	Incorrect	78 ms	6648 KB	Output isn't correct
92	Incorrect	85 ms	6748 KB	Output isn't correct