提出 #57410883
ソースコード 拡げる
#include <bits/stdc++.h>
#include <atcoder/modint>
namespace {
using ModInt [[maybe_unused]] = atcoder::modint998244353;
using Num [[maybe_unused]] = long long int;
using Vec [[maybe_unused]] = std::vector<Num>;
using Set [[maybe_unused]] = std::set<Num>;
using Mset [[maybe_unused]] = std::multiset<Num>;
using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;
template<typename T>
using Q [[maybe_unused]] = std::queue<T>;
template<typename T>
using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
const std::vector<std::pair<Num, Num>> dyxs {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
std::map<char, std::pair<Num, Num>> directions {{'D', {1, 0}}, {'U', {-1, 0}}, {'R', {0, 1}}, {'L', {0, -1}}};
template<typename T>
void print_oneline(const std::vector<T>& vec, std::ostream& os) {
const auto size = vec.size();
for(size_t i{0}; i<size; ++i) {
os << vec.at(i) << (((i+1) == size) ? '\n' : ' ');
}
}
template<typename T>
void print_each(const std::vector<T>& vec, std::ostream& os) {
const auto size = vec.size();
for(size_t i{0}; i<size; ++i) {
os << vec.at(i) << '\n';
}
}
}
void solve(std::istream& is, std::ostream& os) {
Num n {0};
std::string s;
is >> n >> s;
Vec ns(n+1);
for(auto&& x : ns) {
is >> x;
}
Num div = 1000000000LL;
for(Num i{0}; i<n; ++i) {
Num l = ns.at(i);
Num r = ns.at(i+1);
if (l > r) {
std::swap(l, r);
}
const auto d = r - l;
div = std::min(div, d);
}
div = std::max(1LL, div);
std::vector<Vec> ans(div);
for(auto&& vs : ans) {
vs.resize(n+1);
}
for(Num i{0}; i<=n; ++i) {
const auto d = ns.at(i) / div;
const auto r = ns.at(i) % div;
for(Num j{0}; j<div; ++j) {
const auto b = d + (j < r);
ans.at(j).at(i) = b;
}
}
os << ans.size() << "\n";
for(const auto& vs : ans) {
print_oneline(vs, os);
}
}
int main(void) {
solve(std::cin, std::cout);
return 0;
}
提出情報
| 提出日時 |
|
| 問題 |
A - >< again |
| ユーザ |
zettsut |
| 言語 |
C++ 20 (gcc 12.2) |
| 得点 |
400 |
| コード長 |
2275 Byte |
| 結果 |
AC |
| 実行時間 |
46 ms |
| メモリ |
11432 KiB |
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
400 / 400 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
sample01.txt |
| All |
in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, sample01.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| in01.txt |
AC |
8 ms |
4696 KiB |
| in02.txt |
AC |
6 ms |
4276 KiB |
| in03.txt |
AC |
1 ms |
3540 KiB |
| in04.txt |
AC |
1 ms |
3460 KiB |
| in05.txt |
AC |
1 ms |
3376 KiB |
| in06.txt |
AC |
1 ms |
3548 KiB |
| in07.txt |
AC |
8 ms |
4820 KiB |
| in08.txt |
AC |
2 ms |
3448 KiB |
| in09.txt |
AC |
1 ms |
3408 KiB |
| in10.txt |
AC |
2 ms |
3608 KiB |
| in11.txt |
AC |
2 ms |
3620 KiB |
| in12.txt |
AC |
1 ms |
3504 KiB |
| in13.txt |
AC |
46 ms |
11432 KiB |
| in14.txt |
AC |
20 ms |
6656 KiB |
| in15.txt |
AC |
23 ms |
7492 KiB |
| in16.txt |
AC |
1 ms |
3424 KiB |
| in17.txt |
AC |
2 ms |
3784 KiB |
| in18.txt |
AC |
2 ms |
3664 KiB |
| in19.txt |
AC |
1 ms |
3536 KiB |
| in20.txt |
AC |
1 ms |
3436 KiB |
| in21.txt |
AC |
1 ms |
3424 KiB |
| in22.txt |
AC |
1 ms |
3356 KiB |
| sample01.txt |
AC |
1 ms |
3352 KiB |