전체 글67 Softeer - GBC https://softeer.ai/practice/info.do?eventIdx=1&psProblemId=584&sw_prbl_sbms_sn=14465 #include #include #include #include #include using namespace std; int max(int a, int b) { return a > b ? a : b; } int main() { int N, M; cin >> N >> M; // length & speed vector speed(N); vector test(M); for (int i = 0; i > speed[i].first >> speed[i].second; if (i) speed[i].first += speed[i - 1]... 2021. 8. 20. Softeer - 차세대 지능형 교통시스템 #include #include #include #include #include using namespace std; int N, T; char dir[] = { 'R', 'T', 'L', 'B' }; struct its { its(int p, char d, int time) { pos = p; dir = d; t = time; } int pos; char dir; int t; }; int dirIndex(char d) { for (int i = 0; i > T; vector sig(N * N, vector(4)); for (int i = 0; i < N * N; ++i) { for (int j = 0.. 2021. 8. 20. Softeer - 로봇이 지나간 경로 https://softeer.ai/practice/info.do?eventIdx=1&psProblemId=577&sw_prbl_sbms_sn=14437 #include #include #include #include using namespace std; int H, W; int dx[] = { 1, 0, -1, 0 }; int dy[] = { 0, 1, 0, -1 }; char dir[] = { '>', 'v', ' 2021. 8. 19. Subsets II - medium https://leetcode.com/explore/challenge/card/august-leetcoding-challenge-2021/613/week-1-august-1st-august-7th/3837/ //mine class Solution { public: vector subsetsWithDup(vector &nums) { sort(nums.begin(), nums.end(), greater()); f(nums, 0); return vector(set_.begin(), set_.end()); } void f(vector& nums, int cur) { if (nums.size() == cur) { set_.insert(vector()); return; } f(nums, cur + 1); vecto.. 2021. 8. 4. 이전 1 ··· 11 12 13 14 15 16 17 다음