結果
| 問題 | No.158 奇妙なお使い |
| ユーザー |
|
| 提出日時 | 2017-08-09 21:03:26 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
CE
(最新)
OLE
(最初)
|
| 実行時間 | - |
| コード長 | 4,640 bytes |
| コンパイル時間 | 3,143 ms |
| コンパイル使用メモリ | 208,380 KB |
| 最終ジャッジ日時 | 2024-04-20 08:41:24 |
| 合計ジャッジ時間 | 3,615 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:63:9: warning: no return statement in function returning non-void [-Wreturn-type]
63 | }
| ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bitset:52,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:52,
from main.cpp:3:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h: In destructor 'std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::_Rb_tree_impl<std::less<std::pair<long long int, long long int> >, true>::~_Rb_tree_impl()':
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to 'always_inline' 'std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = std::_Rb_tree_node<std::pair<const std::pair<long long int, long long int>, long long int> >]': target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/map:62,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:152:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_tree.h:662:16: note: called from here
662 | struct _Rb_tree_impl
| ^~~~~~~~~~~~~
ソースコード
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}}
#define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}}
#define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
mt19937 mt(8901016);
inline int rand_int(int l, int h) {
return uniform_int_distribution<>(l, h)(mt);
}
#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
public:
template<typename T> void input_integer(T& var) {
var = 0;
T sign = 1;
int cc = getchar_unlocked();
for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
if (cc == '-') sign = -1;
for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
var = (var << 3) + (var << 1) + cc - '0';
var = var*sign;
}
inline int c() { return getchar_unlocked(); }
inline MaiScanner& operator>>(int& var) {
input_integer<int>(var);
return *this;
}
inline MaiScanner& operator>>(long long& var) {
input_integer<long long>(var);
return *this;
}
inline MaiScanner& operator>>(string& var) {
int cc = getchar_unlocked();
for (; !isvisiablechar(cc); cc = getchar_unlocked());
for (; isvisiablechar(cc); cc = getchar_unlocked())
var.push_back(cc);
}
template<typename IT> void in(IT begin, IT end) {
for (auto it = begin; it != end; ++it) *this >> *it;
}
};
}
MaiScanner scanner;
int n, len;
int result = -1;
ll a4, a3, a1;
ll db, b4, b3, b1;
ll dc, c4, c3, c1;
map<pair<ll,ll>,ll> dp;
// 1円玉の枚数は最大数だけ覚えておけば良い！
int main() {
scanner >> a4 >> a3 >> a1;
scanner >> db;
scanner >> b4 >> b3 >> b1;
scanner >> dc;
scanner >> c4 >> c3 >> c1;
dp[make_pair(a4, a3)] = a1;
int count = -1;
bool updated = true;
for (; updated; ++count) {
updated = false;
int next = (count + 1) % 2;
int curr = (count) % 2;
map<pair<ll, ll>, ll> dp_nxt;
for (auto p : dp) {
ll t1 = p.second;
ll t4 = p.first.first;
ll t3 = p.first.second;
function<bool(ll, ll, ll, ll, ll, ll, ll, ll, ll, ll)> dfs1 = [&](ll y, ll y4, ll y3, ll y1, ll x4, ll x3, ll x1, ll p4, ll p3, ll p1) {
xprintf("%lld %lld %lld %lld\n", y, x4, x3, x1);
if (y % 100 > x1) return false;
if ((y / 100) % 10 > x3) return 100 > x1 ? false : dfs1(y, y4, y3, y1, x4, x3 + 1, x1 - 100, p4, p3 - 1, p1 + 100);
if ((y / 1000) % 10 > x4) return 10 > x3 ? (1000 > x1 ? false : dfs1(y, y4, y3, y1, x4 + 1, x3, x1 - 1000, p4 - 1, p3, p1 + 1000)) : dfs1(y, y4, y3, y1, x4 + 1, x3 - 10, x1, p4 - 1, p3 + 10, p1);
xprintf("> %lld %lld %lld %lld\n", y, x4, x3, x1);
ll o1 = y % 100 + p1;
ll o3 = (y / 100)%10 + p3;
ll o4 = (y / 1000)%10 + p4;
auto key = make_pair(t4 - o4 + y4, t3 - o3 + y3);
dp_nxt[key] = max(dp_nxt[key], t1 - o1 + y1);
return true;
};
updated |= dfs1(db, b4, b3, b1, t4, t3, t1, 0, 0, 0);
updated |= dfs1(dc, c4, c3, c1, t4, t3, t1, 0, 0, 0);
}
dp.swap(dp_nxt);
}
cout << count << endl;
return 0;
}