fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-05-20 23:36:43
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-05-20 23:49:31
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name "weather"
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = 365;
  54. int n;
  55. int dx[] = {0,-1,1,0,0,-2,2,0,0},
  56. 	dy[] = {0,0,0,-1,1,0,0,-2,2};
  57.  
  58. namespace hungeazy {
  59.  
  60. 	int ok[N][3][3][7][7][7][7],fes[N+1][4][4];
  61.  
  62. 	struct Node {
  63. 		int d,x,y,s0,s1,s2,s3;
  64. 	};
  65.  
  66. 	bool check(Node &cur)
  67. 	{
  68. 		if (fes[cur.d][cur.x][cur.y] or fes[cur.d][cur.x+1][cur.y] or
  69. 		fes[cur.d][cur.x+1][cur.y+1] or fes[cur.d][cur.x][cur.y+1]) return false;
  70. 		if (!cur.x and !cur.y) cur.s0 = 0;
  71. 		else if (!cur.x and cur.y == 2) cur.s1 = 0;
  72. 		else if (cur.x == 2 and !cur.y) cur.s2 = 0;
  73. 		else if (cur.x == 2 and cur.y == 2) cur.s3 = 0;
  74. 		if (cur.s0 > 6 or cur.s1 > 6 or cur.s2 > 6 or cur.s3 > 6) return false;
  75. 		return true;
  76. 	}
  77.  
  78. 	bool checkXY(int x, int y)
  79. 	{
  80. 		return (x >= 0 and x <= 2 and y >= 0 and y <= 2);
  81. 	}
  82.  
  83. 	bool BFS()
  84. 	{
  85. 		queue<Node> q;
  86. 		Node start = {0,1,1,1,1,1,1};
  87. 		if (!check(start)) return false;
  88. 		q.push(start);
  89. 		ok[0][1][1][1][1][1][1] = 1;
  90. 		while (!q.empty())
  91. 		{
  92. 			Node u = q.front(); 
  93. 			q.pop();
  94. 			if (u.d == n-1) return true;
  95. 			int x = u.x, y = u.y, d = u.d;
  96. 			FOR(s,0,8)
  97. 			{
  98. 				int newX = x+dx[s], newY = y+dy[s];
  99. 				if (!checkXY(newX,newY)) continue;
  100. 				Node v = {d+1,newX,newY,u.s0+1,u.s1+1,u.s2+1,u.s3+1};
  101. 				if (check(v) and !ok[v.d][v.x][v.y][v.s0][v.s1][v.s2][v.s3])
  102. 				{
  103. 					q.push(v);
  104. 					ok[v.d][v.x][v.y][v.s0][v.s1][v.s2][v.s3] = true;
  105. 				}
  106. 			}
  107. 		}
  108. 		return false;
  109. 	}
  110.  
  111. 	void solve(void)
  112. 	{		
  113. 		fill(ok,0LL);
  114. 		FOR(i,0,n-1)
  115. 			FOR(j,0,3)
  116. 				FOR(k,0,3) cin >> fes[i][j][k];
  117. 		if (BFS()) cout << 1 << endl;
  118. 		else cout << 0 << endl;
  119. 	}
  120.  
  121. }
  122.  
  123. bool M2;
  124. signed main()
  125. {
  126.     fast;
  127.     if (fopen(name".inp","r"))
  128.     {
  129.     	freopen(name".inp","r",stdin);
  130.     	freopen(name".out","w",stdout);
  131.     }
  132.     while (cin >> n) 
  133.     {
  134.     	if (!n) exit(0);
  135.     	hungeazy::solve();
  136.     }
  137.     time();
  138.     memory();
  139.     return 0;
  140. }
  141. // ██░ ██  █    ██  ███▄    █   ▄████
  142. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  143. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  144. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  145. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  146. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  147. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  148. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  149. // ░  ░  ░   ░              ░       ░
  150.  
Success #stdin #stdout #stderr 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:4.254ms.
60.2199 MB
https://ideone.com/SfBTj1
language:
C++14 (gcc 8.3)
created:
20 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!