Submission #73306311


Source Code Expand

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <cctype>
#include <chrono>
#include <numeric>
#include <cmath>
#include <climits>
#include <string>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int> >;
using vs = vector<string>;
using vvc = vector<vector<char> >;
using pii = pair<int, int>;
using vpii = vector<pii>;
#define el '\n'
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define lrep(i, n) for(ll i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define lrep2(i, s, n) for(ll i = (long long)(s); i < (long long)(n); i++)
#define rrep(i, n) for(int i =(int)(n); i > 0; i--)
#define lrrep(i, n) for(ll i =(long long)(n); i > 0; i--)
#define rrep2(i, b, n) for(int i =(int)(n); i > (int)(b); i--)
#define erep(i, n) for(int i = 0; i <= (int)(n); i++)
#define lerep(i, n) for(ll i = 0; i <= (long long)(n); i++)
#define erep2(i, s, n) for(int i = (int)(s); i <= (int)(n); i++)
#define lerep2(i, s, n) for(ll i = (ll)(s); i <= (ll)(n); i++)
#define vin(array, size) rep(i, (int)(size))cin >> array[i]
#define vvin(array, size1, size2) rep(i, (int)(size1)) rep(j, (int)(size2)) cin >> array[i][j]
#define vout(array, size) rep(i, (int)(size))cout << array[i] << el
#define vvout(array, size1, size2) rep(i, (int)(size1)) rep(j, (int)(size2)) cout << array[i][j] << " \n"[j == size2-1]
#define pb emplace_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define spa << " " <<
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); } }init; // printf()を使うときは消す.
const int inf = INT_MAX;
const ll INF = LLONG_MAX;

int main() {
    int n, m=0;
    cin >> n;
    vs s(n);
    rep(i, n) {
        cin >> s[i];
        if(m < s[i].size()) m = s[i].size();
    }

    rep(i, n) {
        if(s[i].size() < m) {
            int len = s[i].size();
            rep(k, (m-len)/2) s[i].insert(0, ".");
            rep(k, (m-len)/2) s[i] = s[i] + '.';
        }
        cout << s[i] << el;
    }
    return 0;
}

Submission Info

Submission Time
Task B - Center Alignment
User yurin442
Language C++23 (GCC 15.2.0)
Score 200
Code Size 2242 Byte
Status AC
Exec Time 10 ms
Memory 6536 KiB

Compile Error

./Main.cpp: In function 'int main()':
./Main.cpp:53:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         if(m < s[i].size()) m = s[i].size();
      |            ~~^~~~~~~~~~~~~
./Main.cpp:57:24: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |         if(s[i].size() < m) {
      |            ~~~~~~~~~~~~^~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt
All 00_sample_01.txt, 00_sample_02.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 02_min_01.txt, 03_max_01.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 10 ms 6532 KiB
00_sample_02.txt AC 2 ms 6536 KiB
01_random_01.txt AC 2 ms 6384 KiB
01_random_02.txt AC 3 ms 6448 KiB
01_random_03.txt AC 3 ms 6436 KiB
01_random_04.txt AC 2 ms 6436 KiB
01_random_05.txt AC 2 ms 6392 KiB
01_random_06.txt AC 3 ms 6384 KiB
02_min_01.txt AC 2 ms 6536 KiB
03_max_01.txt AC 3 ms 6388 KiB