oj.uz

답안 #124687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124687 2019-07-03T17:21:22 Z arthurconmy Mecho (IOI09_mecho) C++14
58 / 100
 1000 ms 7196 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)
		{
			if(bee_dis[P.ff][P.ss]<=t) continue;

			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

	REP(i,0,n*n)
	{
		REP(i,0,801)
		{
			REP(j,0,801)
			{
				vis[i][j]=0;
			}
		}

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

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

		if(!try_it(i))
		{
			cout << i-1 << endl;
			return 0;
		}
	}

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

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:168:6: warning: unused variable 'l' [-Wunused-variable]
  int l=0;
      ^
mecho.cpp:169:6: warning: unused variable 'r' [-Wunused-variable]
  int r=n*n; // bin search parameters
      ^

Subtask #1
58.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3448 KB Output is correct
2 Correct 5 ms 3448 KB Output is correct
3 Correct 6 ms 3448 KB Output is correct
4 Correct 6 ms 3448 KB Output is correct
5 Correct 5 ms 3448 KB Output is correct
6 Correct 5 ms 3576 KB Output is correct
7 Correct 445 ms 6560 KB Output is correct
8 Correct 5 ms 3448 KB Output is correct
9 Correct 8 ms 3576 KB Output is correct
10 Correct 7 ms 3576 KB Output is correct
11 Correct 7 ms 3580 KB Output is correct
12 Correct 79 ms 3740 KB Output is correct
13 Correct 5 ms 3576 KB Output is correct
14 Correct 5 ms 3704 KB Output is correct
15 Correct 59 ms 3576 KB Output is correct
16 Correct 30 ms 3576 KB Output is correct
17 Correct 96 ms 3580 KB Output is correct
18 Correct 46 ms 3576 KB Output is correct
19 Correct 133 ms 3576 KB Output is correct
20 Correct 64 ms 3704 KB Output is correct
21 Correct 239 ms 3676 KB Output is correct
22 Correct 121 ms 3576 KB Output is correct
23 Correct 376 ms 3676 KB Output is correct
24 Correct 185 ms 3704 KB Output is correct
25 Correct 544 ms 3704 KB Output is correct
26 Correct 280 ms 3704 KB Output is correct
27 Correct 651 ms 3704 KB Output is correct
28 Correct 331 ms 3704 KB Output is correct
29 Correct 744 ms 3832 KB Output is correct
30 Correct 378 ms 3832 KB Output is correct
31 Correct 870 ms 3832 KB Output is correct
32 Correct 435 ms 3832 KB Output is correct
33 Execution timed out 1074 ms 4600 KB Time limit exceeded
34 Execution timed out 1079 ms 4600 KB Time limit exceeded
35 Correct 35 ms 4604 KB Output is correct
36 Execution timed out 1079 ms 4728 KB Time limit exceeded
37 Execution timed out 1074 ms 4728 KB Time limit exceeded
38 Correct 44 ms 4728 KB Output is correct
39 Execution timed out 1086 ms 4856 KB Time limit exceeded
40 Execution timed out 1073 ms 4856 KB Time limit exceeded
41 Correct 52 ms 4856 KB Output is correct
42 Execution timed out 1079 ms 4984 KB Time limit exceeded
43 Execution timed out 1080 ms 4984 KB Time limit exceeded
44 Correct 63 ms 4984 KB Output is correct
45 Execution timed out 1075 ms 5240 KB Time limit exceeded
46 Execution timed out 1074 ms 5240 KB Time limit exceeded
47 Correct 78 ms 5240 KB Output is correct
48 Execution timed out 1071 ms 5368 KB Time limit exceeded
49 Execution timed out 1072 ms 5368 KB Time limit exceeded
50 Correct 89 ms 5420 KB Output is correct
51 Execution timed out 1083 ms 5496 KB Time limit exceeded
52 Execution timed out 1081 ms 5496 KB Time limit exceeded
53 Correct 111 ms 5464 KB Output is correct
54 Execution timed out 1076 ms 5624 KB Time limit exceeded
55 Execution timed out 1062 ms 5752 KB Time limit exceeded
56 Correct 129 ms 5752 KB Output is correct
57 Execution timed out 1073 ms 5752 KB Time limit exceeded
58 Execution timed out 1078 ms 5752 KB Time limit exceeded
59 Correct 158 ms 6016 KB Output is correct
60 Execution timed out 1076 ms 6008 KB Time limit exceeded
61 Execution timed out 1077 ms 6084 KB Time limit exceeded
62 Correct 178 ms 6092 KB Output is correct
63 Correct 117 ms 5956 KB Output is correct
64 Execution timed out 1076 ms 6008 KB Time limit exceeded
65 Execution timed out 1063 ms 6012 KB Time limit exceeded
66 Execution timed out 1085 ms 6008 KB Time limit exceeded
67 Correct 96 ms 6012 KB Output is correct
68 Correct 94 ms 6136 KB Output is correct
69 Correct 347 ms 6264 KB Output is correct
70 Correct 174 ms 6136 KB Output is correct
71 Correct 133 ms 6148 KB Output is correct
72 Correct 633 ms 6200 KB Output is correct
73 Correct 94 ms 7072 KB Output is correct
74 Execution timed out 1071 ms 7088 KB Time limit exceeded
75 Execution timed out 1061 ms 7196 KB Time limit exceeded
76 Correct 586 ms 7068 KB Output is correct
77 Execution timed out 1088 ms 7196 KB Time limit exceeded
78 Correct 80 ms 6872 KB Output is correct
79 Execution timed out 1083 ms 6740 KB Time limit exceeded
80 Correct 870 ms 6744 KB Output is correct
81 Correct 491 ms 6872 KB Output is correct
82 Execution timed out 1086 ms 6744 KB Time limit exceeded
83 Correct 92 ms 6736 KB Output is correct
84 Execution timed out 1080 ms 6756 KB Time limit exceeded
85 Correct 571 ms 6732 KB Output is correct
86 Correct 346 ms 6732 KB Output is correct
87 Correct 849 ms 6732 KB Output is correct
88 Correct 98 ms 6772 KB Output is correct
89 Correct 802 ms 6776 KB Output is correct
90 Correct 395 ms 6872 KB Output is correct
91 Correct 557 ms 6876 KB Output is correct
92 Correct 234 ms 6776 KB Output is correct