8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent da08fbe commit 2891705Copy full SHA for 2891705
0x0D/solutions/14500.cpp
@@ -1,6 +1,6 @@
1
// Authored by : BaaaaaaaaaaarkingDog
2
// Co-authored by : -
3
-// http://boj.kr/693d1ccff5ef479e848979c746b404b1
+// http://boj.kr/c472fdbf8dbb4b91ada365258587bc06
4
#include <bits/stdc++.h>
5
using namespace std;
6
@@ -13,7 +13,7 @@ int board[502][502];
13
vector<vector<pair<int,int>>> tetro;
14
15
// a, b가 상하좌우로 인접한 칸인지 확인하는 함수
16
-bool isadj(pair<int, int> a, pair<int, int> b){
+bool isadj(pair<int, int>& a, pair<int, int>& b){
17
if(a.X == b.X) return abs(a.Y - b.Y) == 1;
18
if(a.Y == b.Y) return abs(a.X - b.X) == 1;
19
return false;
0 commit comments