Pewarta Proxy

📋 Server Request & Proxy Logs

Loading active proxy settings...
Developed by Khairul Adha (adhexa.id)
Mengambil log server...

⚙️ Pengaturan Proxy Target

Skip to content

Commit 1c31660

Browse files
committed
.
1 parent bf96d95 commit 1c31660

4 files changed

Lines changed: 46 additions & 25 deletions

File tree

‎python/week20/BOJ11758.py‎

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
'''
2+
P1->P2 / P2->P3
3+
반시계방향: - - / - +
4+
시계방향:
5+
일직선: 기울기가 같다.
6+
'''

‎python/week20/BOJ14425.py‎

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
'''
2+
지금은 새벽 2시 30분.. 잘까말까 고민했당.. 그래두 스터디에서 내 몫을 다하쟝!
3+
서버에서도 제일 중요한 것중 하나인 CPU 사용률! 열씨미하장!
4+
'''
5+
6+
# 이건 트라이가 좋을 듯
7+
8+
def main():
9+
pass
10+
11+
if __name__ == "__main__":
12+
main()

‎python/week20/BOJ15486.py‎

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
# 나도 백준이와 같은 마음
2+
3+
# 예제가 많을 때는 예제를 많이 해본다. 귀납적인 거신가...?

‎python/week20/BOJ17085.py‎

Lines changed: 25 additions & 25 deletions
Original file line numberDiff line numberDiff line change
@@ -2,36 +2,36 @@
22

33
dr = [(-1, 0), (1, 0), (0, -1), (0, 1)]
44

5+
# 기능 하나 분리
6+
7+
8+
def range_check(y, x, r, N, M):
9+
for i in range(-1, 2, 2):
10+
ty = y + r*i
11+
tx = x + r*i
12+
if ty < 0 or ty >= N or tx < 0 or tx >= M:
13+
return False
14+
return True
15+
516

617
def solution(N, M, grid):
718
ans = 1
819
visited = [[0]*M for _ in range(N)]
9-
for i in range(1, N-1):
10-
for j in range(1, M-1):
11-
if grid[i][j] == '#':
12-
end_flag = False
13-
count = 0
14-
while 1:
15-
for x, y in dr:
16-
x *= count+1
17-
y *= count+1
18-
if grid[i+x][j+y] == '#' and visited[i+x][j+y] == 0:
19-
end_flag = True
20-
break
21-
if end_flag:
22-
if count:
23-
for cnt in range(count+1):
24-
for x, y in dr:
25-
x *= cnt+1
26-
y *= cnt+1
27-
visited[i+x][j+y] = 1
28-
break
20+
for i in range(1, N):
21+
for j in range(1, M):
22+
if grid[i][j] == '.':
23+
continue
24+
k = 0
25+
while 1:
26+
if range_check(i, j, k, N, M):
27+
if grid[i+k][j] == '#' and grid[i-k][j] == '#' and grid[i][j+k] == '#' and grid[i][j-k] == '#':
28+
ans *= (1+4*k)
29+
30+
for c in range(k):
31+
grid[i+c][j], grid[i][j+c], grid[i-c][j], grid[i][j-c] = '#'
2932
else:
30-
count += 1
31-
if count == i or count == j:
32-
break
33-
if count:
34-
ans *= 1+4*count
33+
break
34+
else: break
3535
return ans
3636

3737

0 commit comments

Comments
 (0)