KOREATECH 1125: 좌우로 밀착 I

Link : judge.koreatech.ac.kr/problem.php?id=1125

---

C++

#include <iostream>
#include <vector>
#include <stack>
using namespace std;
 
int main()
{
    int testcase = 0;
    cin >> testcase;
 
    while (testcase--) {
        int x, y, n;
        cin >> y >> x;
        vector<vector<int>> v(y, vector<int>(0));
        for (int i = 0; i < y; i++) {
            int stack = 0;
            for (int j = 0; j < x; j++) {
                cin >> n;
                if (n == 0)
                    stack++;
                else
                    v[i].push_back(n);
            }
            for (int zero = 0; zero < stack; zero++)
                v[i].push_back(0);
        }
 
        for (int i = 0; i < x; i++) {
            vector<int> s;
            int space = 0;
            for (int j = 0; j < y; j++) {
                if (v[j][i] != 0)
                    s.push_back(v[j][i]);
                else
                    space++;
 
            }
            for (int arr = 0; arr < s.size(); arr++) {
                v[arr][i] = s[arr];
            }
            for (int arr = s.size(); arr < space + s.size(); arr++)
                v[arr][i] = 0;
        }
        for (int i = 0; i < y; i++) {
            for (int j = 0; j < x; j++) {
                cout << v[i][j];
                if (j != x)
                    cout << " ";
            }
            cout << "\n";
        }
    }
    return 0;
}

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com