728x90
๋ฐ์ํ
https://school.programmers.co.kr/learn/courses/30/lessons/340198#
ํ๋ก๊ทธ๋๋จธ์ค
SW๊ฐ๋ฐ์๋ฅผ ์ํ ํ๊ฐ, ๊ต์ก์ Total Solution์ ์ ๊ณตํ๋ ๊ฐ๋ฐ์ ์ฑ์ฅ์ ์ํ ๋ฒ ์ด์ค์บ ํ
programmers.co.kr
ํ๋ก๊ทธ๋๋จธ์ค ๋ ๋ฒจ 1. pcce ๊ธฐ์ถ
๋ฒ์๊ฐ ์ถฉ๋ถํ ์์์, ๋ฐ๋ณต๋ฌธ์ ์ฌ๋ฌ ๊ฐ ์ค์ฒฉํ์ฌ ํด๊ฒฐํ ์ ์์๋ค!
๋์ ํ์ด
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int solution(vector<int> mats, vector<vector<string>> park) {
int answer = -1;
sort(mats.begin(), mats.end(), greater<int>());
for(int i=0; i<park.size(); ++i){
for(int j=0; j<park[0].size(); ++j){
if(park[i][j] != "-1") continue;
for(int k: mats){
bool can = true;
for(int a=i; a<i+k; ++a){
for(int b=j; b<j+k; ++b){
if(a<0 || b<0 || a>=park.size() || b>=park[0].size()) {
can = false; break;
}
if(park[a][b] != "-1"){
can = false; break;
}
}
if(!can) break;
}
if(can) answer = max(answer, k);
}
}
}
return answer;
}
728x90
๋ฐ์ํ
'๐ ์๊ณ ๋ฆฌ์ฆ > Programmers' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[C++/PGS] Lv.1 : ์ ์ฐ๊ทผ๋ฌด์ (0) | 2025.06.13 |
---|---|
[C++/PGS] Lv.2 : ์ง๊ฒ์ฐจ์ ํฌ๋ ์ธ (0) | 2025.06.12 |
[C++/PGS] Lv.3 : ์๋ฌผ์ ์ ์ด์ (2020 KAKAO) (0) | 2025.06.05 |
[C++/PGS] Lv.1 : ํ๋ฐฐ ์์ ๊บผ๋ด๊ธฐ (0) | 2025.06.04 |
[C++/PGS] Lv.2 : ์ซ์ ๋ณํํ๊ธฐ (0) | 2025.05.31 |