提出 #56528705


ソースコード 拡げる

/*
--------------              |   /
      |                     |  /
      |                     | /
      |             *       |/          |    |         ------            *
      |                     |           |    |        /      \
      |             |       |\          |    |       |       |\          |
   \  |             |       | \         |    |       |       | \         |
    \ |             |       |  \        |    |        \     /   \        |
     V              |       |   \        \__/|         -----     \       |
*/
#ifdef EMT
#include "Header/stdc++.h"
#else
#include <bits/stdc++.h>
#endif
using namespace std;

#ifdef EMT
#define debug(x) cerr << "\e[1;31m" << #x << " = " << (x) << "\e[0m\n"
#define print(x) emilia_mata_tenshi(#x, begin(x), end(x))
template<typename T, typename T2> ostream& operator<<(ostream &os, const pair<T, T2> &obj) {
    return os << '{' << obj.first << ',' << obj.second << '}';
}
template<class TupType, size_t... I> void lamy_kawaii(ostream& os, const TupType& _tup, index_sequence<I...>) {
    // source: https://stackoverflow.com/a/41171552
    os << '{';
    (..., (cerr << (I == 0? "" : ",") << get<I>(_tup)));
    os << '}';
}
template<class... T> ostream& operator<<(ostream &os, const tuple<T...>& _tup) {
    lamy_kawaii(os, _tup, make_index_sequence<sizeof...(T)>());
    return os;
}
template<typename T> void emilia_mata_tenshi(const char *s, T l, T r) {
    cerr << "\e[1;33m" << s << " = [";
    while (l != r) {
        cerr << *l;
        cerr << (++l == r ? ']' : ',');
    }
    cerr << "\e[0m\n";
}
#else
#define debug(x) 48763
#define print(x) 48763
#endif

template<typename T, typename T2> istream& operator>>(istream &is, pair<T, T2> &obj) {
    is >> obj.first >> obj.second;
    return is;
}
template<typename T> istream& operator>>(istream &is, vector<T> &obj) {
    for (auto &x : obj)
        is >> x;
    return is;
}

#define YN(x) ((x) ? "YES" : "NO")
#define Yn(x) ((x) ? "Yes" : "No")
#define yn(x) ((x) ? "yes" : "no")
#define emilia_my_wife ios::sync_with_stdio(0); cin.tie(NULL);
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using uint = uint32_t;
template<typename T>
using base_type = remove_cv_t<remove_reference_t<T>>;
const double EPS  = 1e-8;
const int INF     = 0x3F3F3F3F;
const ll LINF     = 4611686018427387903;
const int MOD     = 1e9+7;
static int Lamy_is_cute = []() {
    emilia_my_wife
    return 48763;
}();
/*--------------------------------------------------------------------------------------*/

signed main() {
    int n;
    cin >> n;
    vector<string> arr(n);
    cin >> arr;

    size_t m = 0;
    for (const string &s : arr)
        m = max(m, s.size());

    vector<string> ans(m, string(n, '*'));
    for (int i = 0; i < n; i++)
        for (size_t j = 0; j < arr[i].size(); j++)
            ans[j][n - i - 1] = arr[i][j];
    for (auto &s : ans)
        while (s.back() == '*')
            s.pop_back();
    for (const auto &s : ans)
        cout << s << '\n';
}

提出情報

提出日時
問題 B - Vertical Writing
ユーザ JiKuai
言語 C++ 20 (gcc 12.2)
得点 200
コード長 3105 Byte
結果 AC
実行時間 1 ms
メモリ 3620 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 200 / 200
結果
AC × 2
AC × 21
セット名 テストケース
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, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 02_handmade_01.txt, 02_handmade_02.txt, 02_handmade_03.txt, 02_handmade_04.txt
ケース名 結果 実行時間 メモリ
00_sample_01.txt AC 1 ms 3448 KiB
00_sample_02.txt AC 1 ms 3512 KiB
01_random_01.txt AC 1 ms 3484 KiB
01_random_02.txt AC 1 ms 3460 KiB
01_random_03.txt AC 1 ms 3340 KiB
01_random_04.txt AC 1 ms 3420 KiB
01_random_05.txt AC 1 ms 3432 KiB
01_random_06.txt AC 1 ms 3400 KiB
01_random_07.txt AC 1 ms 3480 KiB
01_random_08.txt AC 1 ms 3412 KiB
01_random_09.txt AC 1 ms 3436 KiB
01_random_10.txt AC 1 ms 3476 KiB
01_random_11.txt AC 1 ms 3368 KiB
01_random_12.txt AC 1 ms 3488 KiB
01_random_13.txt AC 1 ms 3492 KiB
01_random_14.txt AC 1 ms 3392 KiB
01_random_15.txt AC 1 ms 3620 KiB
02_handmade_01.txt AC 1 ms 3464 KiB
02_handmade_02.txt AC 1 ms 3596 KiB
02_handmade_03.txt AC 1 ms 3452 KiB
02_handmade_04.txt AC 1 ms 3448 KiB