結果
問題 | No.355 数当てゲーム(2) |
ユーザー |
![]() |
提出日時 | 2016-04-01 22:52:53 |
言語 | C++11 (gcc 13.3.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,420 bytes |
コンパイル時間 | 924 ms |
コンパイル使用メモリ | 108,060 KB |
実行使用メモリ | 40,540 KB |
最終ジャッジ日時 | 2024-07-16 23:10:18 |
合計ジャッジ時間 | 7,315 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | TLE * 1 -- * 51 |
コンパイルメッセージ
main.cpp: In lambda function: main.cpp:43:42: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 43 | auto get = [&]() { int hit, blow; scanf("%d%d",&hit,&blow); return std::move(make_pair(hit, blow)); }; | ~~~~~^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/11/bits/char_traits.h:39, from /usr/include/c++/11/ios:40, from /usr/include/c++/11/ostream:38, from /usr/include/c++/11/iostream:39, from main.cpp:1: In static member function ‘static _Tp* std::__copy_move<_IsMove, true, std::random_access_iterator_tag>::__copy_m(const _Tp*, const _Tp*, _Tp*) [with _Tp = int; bool _IsMove = false]’, inlined from ‘_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = int*; _OI = int*]’ at /usr/include/c++/11/bits/stl_algobase.h:495:30, inlined from ‘_OI std::__copy_move_a1(_II, _II, _OI) [with bool _IsMove = false; _II = int*; _OI = int*]’ at /usr/include/c++/11/bits/stl_algobase.h:522:42, inlined from ‘_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = int*; _OI = int*]’ at /usr/include/c++/11/bits/stl_algobase.h:529:31, inlined from ‘_OI std::copy(_II, _II, _OI) [with _II = int*; _OI = int*]’ at /usr/include/c++/11/bits/stl_algobase.h:620:7, inlined from ‘static _ForwardIterator std::__uninitialized_copy<true>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = int*; _ForwardIterator = int*]’ at /usr/include/c++/11/bits/stl_uninitialized.h:110:27, inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = int*; _ForwardIterator = int*]’ at /usr/include/c++/11/bits/stl_uninitialized.h:151:15, inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _Inpu
ソースコード
#include <iostream>#include <algorithm>#include <cmath>#include <vector>#include <complex>#include <queue>#include <deque>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <iomanip>#include <assert.h>#include <array>#include <cstdio>#include <cstring>#include <random>#include <functional>#include <numeric>#include <bitset>using namespace std;void main_(); signed main() {main_(); return 0;}#define REP(i,a,b) for(int i=a;i<(int)b;i++)#define rep(i,n) REP(i,0,n)#define all(c) (c).begin(), (c).end()#define zero(a) memset(a, 0, sizeof a)#define minus(a) memset(a, -1, sizeof a)template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }typedef long long ll;int const inf = 1<<29;void main_() {vector<int> ns(4);auto ask = [&]() { rep(i, 4) printf("%d%c", ns[i], i == 3 ? '\n' : ' '); };auto get = [&]() { int hit, blow; scanf("%d%d",&hit,&blow); return std::move(make_pair(hit, blow)); };vector<int> v;rep(i, 10) {printf("%d %d %d %d\n", i, i, i, i);int hit, blow; tie(hit, blow) = get();if(hit > 0) {v.push_back(i);}}ns = v;do {ask();int h, b; tie(h, b) = get();if(h == 4) {exit(0);}} while(next_permutation(all(ns)));}