結果
問題 | No.1156 Nada Picnic 2 |
ユーザー | FF256grhy |
提出日時 | 2020-08-12 02:31:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,081 bytes |
コンパイル時間 | 1,906 ms |
コンパイル使用メモリ | 195,868 KB |
最終ジャッジ日時 | 2024-11-14 22:54:48 |
合計ジャッジ時間 | 2,354 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'void out(A&&) [with A = std::vector<int>&]': main.cpp:107:7: required from here main.cpp:59:76: error: no match for 'operator<<' (operand types are 'std::basic_ostream<char>' and 'std::vector<int>') 59 | template<typename A > void out(A && a ) { (* OS) << a ; out( ); } | ~~~~~~~^~~~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54, from main.cpp:1: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:108:7: note: candidate: 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(__ostream_type& (*)(__ostream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __ostream_type = std::basic_ostream<char>]' 108 | operator<<(__ostream_type& (*__pf)(__ostream_type&)) | ^~~~~~~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:108:36: note: no known conversion for argument 1 from 'std::vector<int>' to 'std::basic_ostream<char>::__ostream_type& (*)(std::basic_ostream<char>::__ostream_type&)' {aka 'std::basic_ostream<char>& (*)(std::basic_ostream<char>&)'} 108 | operator<<(__ostream_type& (*__pf)(__ostream_type&)) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:117:7: note: candidate: 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ost
ソースコード
#include <bits/stdc++.h> using namespace std; using LL = long long int; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc(i, n) incID(i, 0, n) #define dec(i, n) decID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec1(i, n) decII(i, 1, n) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define MT make_tuple #define FI first #define SE second #define FR front() #define BA back() #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() auto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); }; auto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); }; auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); }; auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); }; #define SI(v) static_cast<int>(v.size()) #define RF(e, v) for(auto & e: v) #define until(e) while(! (e)) #define if_not(e) if(! (e)) #define ef else if #define UR assert(false) // 以下、入出力関係のテンプレ案のテスト auto * IS = & cin; // input elements (as a tuple) template<typename U, int I> void in_(U & t) { } template<typename U, int I, typename A, typename ... B> void in_(U & t) { (* IS) >> get<I>(t); in_<U, I + 1, B ...>(t); } template<typename ... T> auto in() { tuple<T ...> t; in_<tuple<T ...>, 0, T ...>(t); return t; } // input a array template<typename T, int N> auto ain() { array<T, N> a; inc(i, N) { (* IS) >> a[i]; } return a; } // input a (multi-dimensional) vector template<typename T> T vin() { return * istream_iterator<T>(* IS); } template<typename T, typename N, typename ... M> auto vin(N n, M ... m) { vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v; } // input multi-column (as a tuple of vector) template<typename U, int I> void colin_(U & t) { } template<typename U, int I, typename A, typename ... B> void colin_(U & t) { get<I>(t).emplace_back(* istream_iterator<A>(* IS)); colin_<U, I + 1, B ...>(t); } template<typename ... T> auto colin(int n) { tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t; } auto * OS = & cout; string SP = " ", LN = "\n"; // output elements void out() { (* OS) << LN << flush; } template<typename A > void out(A && a ) { (* OS) << a ; out( ); } template<typename A, typename ... B> void out(A && a, B && ... b) { (* OS) << a << SP; out(b ...); } // output a (multi-dimensional) vector template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) { inc(i, v.size()) { os << (i == 0 ? "" : SP) << v[i]; } return os << flush; } template<typename T> void vout_(T && v) { (* OS) << v; } template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) { for(auto && w: v) { vout_(w, b ...); (* OS) << a; } } template<typename T, typename ... A> void vout(T && v, A ... a) { vout_(v, a ...); out(); } // ---- ---- int main() { auto [n] = in<int>(); vector<int> v = { 0, 1751, 10947, 841341 }; out(v[n]); return 0; vector<int> p(10); inc(i, 10) { p[i] = i; } auto toi = [&](vector<int> && v) { int ans = 0; RF(e, v) { ans = 10 * ans + p[e]; } return ans; }; do { /* if(p[0] != 0 && p[3] != 0 && p[7] != 0 && toi({ 0, 0, 1, 2 }) + toi({ 3, 4, 5, 6 }) == toi({ 7, 8, 1, 2, 9 }) ) { out(p); out(toi({ 0, 0, 1, 2 })); out(toi({ 3, 4, 5, 6 })); out(toi({ 7, 8, 1, 2, 9 })); } */ if(p[0] != 0 && p[6] != 0 && p[1] != 0 && toi({ 0, 1, 2, 3, 4, 5 }) + toi({ 6, 3, 5, 7, 8 }) == toi({ 1, 3, 9, 4, 3, 9 }) ) { out(p); out(toi({ 0, 1, 2, 3, 4, 5 })); out(toi({ 6, 3, 5, 7, 8 })); out(toi({ 1, 3, 9, 4, 3, 9 })); } } while(next_permutation(ALL(p))); }