結果
| 問題 | No.873 バイナリ、ヤバいなり！ｗ |
| コンテスト | |
| ユーザー |
 firiexp
|
| 提出日時 | 2019-08-30 22:17:10 |
| 言語 | C++14 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 2,209 bytes |
| 記録 | |
| コンパイル時間 | 495 ms |
| コンパイル使用メモリ | 98,984 KB |
| 最終ジャッジ日時 | 2026-05-10 05:41:11 |
| 合計ジャッジ時間 | 1,180 ms |
|
ジャッジサーバーID （参考情報） |
judge1_1 / judge2_0 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:14:13: error: 'uint32_t' does not name a type
14 | using u32 = uint32_t;
| ^~~~~~~~
main.cpp:11:1: note: 'uint32_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
10 | #include <cmath>
+++ |+#include <cstdint>
11 |
main.cpp:17:39: error: '::numeric_limits' has not been declared
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ^~~~~~~~~~~~~~
main.cpp:17:55: error: expected primary-expression before '>' token
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ^
main.cpp:17:61: error: no matching function for call to 'max()'
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ~~~~~^~
main.cpp:17:61: note: there are 4 candidates
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/string:53,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/locale_classes.h:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ios_base.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ios:46,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ostream.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ostream:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/iostream:43,
from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_algobase.h:258:5: note: candidate 1: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
258 | max(const _Tp& __a, const _Tp& __b)
| ^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.
ソースコード
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }
template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }
template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "{";
for (int i = 0; i < v.size(); ++i) {
if(i) os << ", ";
os << v[i];
}
return os << "}";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "{" << p.first << ", " << p.second << "}";
}
int main() {
int n;
cin >> n;
auto dp = make_v(n+1, INF<int>);
dp[0] = 0;
vector<int> sq(n+1);
sq[0] = 0;
for (int i = 1; i <= n; ++i) {
sq[i] = sq[i-1];
while((sq[i]+1)*(sq[i]+1) <= i) sq[i]++;
}
for (int i = 1; i <= n; ++i) {
for (int j = sq[i]; j >= 1; --j) {
chmin(dp[i], dp[i-j*j]+j);
}
}
int cur = n;
vector<int> v;
while(cur){
for (int i = sq[cur]; i >= 1; --i) {
if(dp[cur-i*i] == dp[cur]-i) {
v.emplace_back(i);
cur -= i*i;
break;
}
}
}
auto f = [&](vector<int> &x){
string s;
int cur = 0;
for (auto &&i : x) {
for (int j = 0; j < i; ++j) {
s += char('0'+cur);
cur ^= 1;
}
cur ^= 1;
}
return s;
};
sort(v.begin(),v.end());
string ans = f(v);
do {
ans = min(ans, f(v));
}while(next_permutation(v.begin(),v.end()));
cout << ans << "\n";
return 0;
}