結果
問題 | No.2119 一般化百五減算 |
ユーザー | FF256grhy |
提出日時 | 2022-11-04 21:49:48 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 6,251 bytes |
コンパイル時間 | 1,647 ms |
コンパイル使用メモリ | 197,508 KB |
最終ジャッジ日時 | 2024-04-27 04:16:54 |
合計ジャッジ時間 | 2,059 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'void in(A& ...) [with A = {std::vector<std::array<int, 2>, std::allocator<std::array<int, 2> > >}]': main.cpp:72:94: required from 'auto read_v(N ...) [with A = std::array<int, 2>; N = {int}]' main.cpp:90:32: required from here main.cpp:49:63: error: no match for 'operator>>' (operand types are 'std::basic_istream<char>' and 'std::vector<std::array<int, 2>, std::allocator<std::array<int, 2> > >') 49 | template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); } | ~~~~~~~~~~~~~~~~^~ In file included 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/istream:120:7: note: candidate: 'std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(__istream_type& (*)(__istream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]' 120 | operator>>(__istream_type& (*__pf)(__istream_type&)) | ^~~~~~~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:120:36: note: no known conversion for argument 1 from 'std::vector<std::array<int, 2>, std::allocator<std::array<int, 2> > >' to 'std::basic_istream<char>::__istream_type& (*)(std::basic_istream<char>::__istream_type&)' {aka 'std::basic_istream<char>& (*)(std::basic_istream<char>&)'} 120 | operator>>(__istream_type& (*__pf)(__istream_type&)) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/incl
ソースコード
#include <bits/stdc++.h> using namespace std; #define incII(i, l, r) for(decay_t<decltype(r)> i = (l) ; i <= (r); i++) #define incIX(i, l, r) for(decay_t<decltype(r)> i = (l) ; i < (r); i++) #define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++) #define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i < (r); i++) #define decII(i, l, r) for(decay_t<decltype(r)> i = (r) ; i >= (l); i--) #define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--) #define decXI(i, l, r) for(decay_t<decltype(r)> i = (r) ; i > (l); i--) #define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i > (l); i--) #define inc(i, n) incIX(i, 0, n) #define dec(i, n) decIX(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec1(i, n) decII(i, 1, n) auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); }; auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a < r); }; auto inXI = [](auto a, auto l, auto r) -> bool { return (l < a && a <= r); }; auto inXX = [](auto a, auto l, auto r) -> bool { return (l < a && a < r); }; auto setmin = [](auto & a, auto b) -> bool { return (b < a ? a = b, true : false); }; auto setmax = [](auto & a, auto b) -> bool { return (b > a ? a = b, true : false); }; auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); }; auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); }; using LL = long long int; using LD = long double; #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(a) begin(a), end(a) #define RALL(a) rbegin(a), rend(a) #define RV(a) reverse(ALL(a)) #define ST(a) sort(ALL(a)) #define RST(a) sort(RALL(a)) #define SC static_cast #define SI(a) SC<int>(a.size()) #define SL(a) SC<LL>(a.size()) #define RF(e, ...) for(auto && e: __VA_ARGS__) #define SF(a, ...) for(auto && [__VA_ARGS__]: a) #define until(...) while(not(__VA_ARGS__)) #define if_not(...) if(not(__VA_ARGS__)) #define ef else if #define UR assert(false) auto * IS = & cin; auto * OS = & cout; template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); } #define IN(...) __VA_ARGS__; in(__VA_ARGS__) struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_; void out_([[maybe_unused]] string const & s) { } template<typename A > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; } template<typename A, typename ... B> void out_( string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); } auto outF = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; }; auto outN = [](auto const & ... a) { outF("" , "" , a ...); }; auto outS = [](auto const & ... a) { outF(" " , " " , a ...); }; auto outL = [](auto const & ... a) { outF("\n", "\n", a ...); }; auto outSN = [](auto const & ... a) { outF(" " , "" , a ...); }; auto outNL = [](auto const & ... a) { outF("" , "\n", a ...); }; auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); }; auto out = outSL; template<typename A > void disp_(A const & a) { * OS << a; } template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } } auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; }; auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; }; auto dispL = [](auto const & a, auto const & ... t) { dispT(a, "\n", t ...); }; template<typename A> istream & operator>>(istream & is, vector<A> & v) { for(auto && e: v) { is >> e; } return is; } template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; } template<typename A > auto make_v(A a) { return a; } template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); } template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; } template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a) { for(auto && e: a) { is >> e; } return is; } template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; } template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p) { return is >> p.first >> p.second; } template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; } template<int I = 0, typename T> void tin_ (istream & is, T & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } } template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } } template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t) { tin_ (is, t); return is; } template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; } // ---- ---- auto fl = [](auto a, auto b) { assert(b != 0); return a / b - (a % b != 0 && ((a >= 0) != (b >= 0)) ? 1 : 0); }; auto ce = [](auto a, auto b) { assert(b != 0); return a / b + (a % b != 0 && ((a >= 0) == (b >= 0)) ? 1 : 0); }; auto mo = [](auto a, auto b) { assert(b != 0); a %= b; if(a < 0) { a += abs(b); } return a; }; int main() { int IN(n, m); auto a = read_v<array<int, 2>>(m); SF(a, b, c) { c = mo(c, b); } ST(a); inc(i, m - 1) { auto [b, c] = a[i]; auto [bb, cc] = a[i + 1]; if(b == bb && c != cc) { out("NaN"); exit(0); } } incII(i, 0, n) { if(i % a.BA[0] != a.BA[1]) { continue; } bool f = true; SF(a, b, c) { f &= (i % b == c); } if(f) { out(i); exit(0); } } out("NaN"); }