Submission

[PPPPPPPPPPPPPPPPPP]

Score: 100

User: Nagornz

Problemset: การจัดแนวข้อความ

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-25 18:32:15

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin()
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin()
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

vector<string> fullJustify(vector<string>& word, int width) {
    int n = word.size();
    vector <int> len(n);
    for (int i = 0; i < n; i++) {
        len[i] = word[i].length();
    }
    vector <vector <int>> num;
    vector <int> leng;
    int sum = 0;
    int idx = -1;
    for (int i = 0; i < n; i++) {
        vector<int> temp = {};
        if (!sum) idx++, num.emplace_back(temp);
        if (sum + len[i] > width) {
            leng.emplace_back(width - sum + 1);
            i--;
            sum = 0;
            continue;
        } 
        else {
            num[idx].emplace_back(i);
            sum += len[i];
        }
        if (sum + 1 > width) {
            sum = 0;
        } 
        else {
            sum++;
        }
    }
    leng.emplace_back(width - sum + 1);
    vector <string> ans(num.size());
    for (int i = 0; i < num.size(); i++) {
        vector <int> v = num[i];
        for (int j = 0; j < v.size(); j++) {
            if (j < v.size() - 1) ans[i] += word[v[j]] + ' ';
            else ans[i] += word[v[j]];
        }
    }
    for (int i = 0; i < ans.size(); i++) {
        if(ans[i].length() == width) continue;
        int x = width - ans[i].length();
        int y = num[i].size();
        y--;
        int add = (y > 0) ? x / y : 0;
        int rem = (y > 0) ? x % y : 0;
        if (i == ans.size() - 1) add = 0, rem = 0;
        int j = 0;
        while (j < ans[i].length() && rem > 0) {
            if (j == ans[i].length() - 1 && rem > 0){
                j = 0;
            }
            if (ans[i][j] == ' ') {
                ans[i].insert(j, 1, ' ');
                j += 3;
                rem--;
            } 
            else {
                j++;
            }
        }
        j = 0;
        while (j < ans[i].length() && add > 0) {
            if (ans[i][j] == ' ') {
                int spaces = min(add, width - (int)ans[i].length());
                ans[i].insert(j, spaces, ' ');
                j += spaces + 2;
            } 
            else {
                j++;
            }
        }
        if (ans[i].length() < width) {
            int spaces = width - ans[i].length();
            for(int k = 0; k < spaces; k++){
                ans[i] += ' ';
            }
        }
    }
    return ans;
}

int32_t main(){
    iShowSpeed;
    int n, m; cin >> n >> m;
    vector <string> s(n);
    for (auto &e : s) cin >> e;
    vector <string> ans = fullJustify(s, m);
    for (auto e : ans) cout << e << "\n";
}