結果

問題 No.355 数当てゲーム(2)
ユーザー komori3komori3
提出日時 2018-02-14 04:53:04
言語 C++11
(gcc 11.4.0)
結果
RE  
実行時間 -
コード長 3,895 bytes
コンパイル時間 1,672 ms
コンパイル使用メモリ 158,248 KB
実行使用メモリ 24,408 KB
平均クエリ数 33.73
最終ジャッジ日時 2023-09-23 15:40:26
合計ジャッジ時間 8,038 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
23,532 KB
testcase_01 RE -
testcase_02 AC 23 ms
23,388 KB
testcase_03 AC 24 ms
23,664 KB
testcase_04 AC 26 ms
23,340 KB
testcase_05 RE -
testcase_06 AC 25 ms
24,060 KB
testcase_07 AC 24 ms
23,352 KB
testcase_08 AC 24 ms
24,036 KB
testcase_09 RE -
testcase_10 RE -
testcase_11 AC 24 ms
23,988 KB
testcase_12 AC 24 ms
23,676 KB
testcase_13 RE -
testcase_14 RE -
testcase_15 AC 24 ms
24,012 KB
testcase_16 AC 23 ms
23,676 KB
testcase_17 AC 24 ms
23,520 KB
testcase_18 AC 24 ms
24,024 KB
testcase_19 AC 24 ms
24,408 KB
testcase_20 AC 24 ms
24,228 KB
testcase_21 AC 24 ms
23,544 KB
testcase_22 AC 23 ms
23,388 KB
testcase_23 AC 24 ms
23,844 KB
testcase_24 AC 24 ms
23,400 KB
testcase_25 AC 23 ms
24,228 KB
testcase_26 AC 24 ms
24,012 KB
testcase_27 AC 25 ms
23,544 KB
testcase_28 AC 24 ms
23,424 KB
testcase_29 AC 22 ms
24,288 KB
testcase_30 AC 24 ms
23,532 KB
testcase_31 AC 21 ms
24,408 KB
testcase_32 AC 23 ms
24,300 KB
testcase_33 AC 22 ms
23,844 KB
testcase_34 AC 24 ms
24,264 KB
testcase_35 RE -
testcase_36 AC 23 ms
23,544 KB
testcase_37 AC 24 ms
23,208 KB
testcase_38 AC 24 ms
23,388 KB
testcase_39 AC 24 ms
24,072 KB
testcase_40 AC 23 ms
24,048 KB
testcase_41 AC 24 ms
24,060 KB
testcase_42 AC 24 ms
23,664 KB
testcase_43 AC 24 ms
23,640 KB
testcase_44 AC 23 ms
23,436 KB
testcase_45 AC 23 ms
23,796 KB
testcase_46 AC 24 ms
23,652 KB
testcase_47 AC 23 ms
23,364 KB
testcase_48 AC 24 ms
23,436 KB
testcase_49 AC 24 ms
23,424 KB
testcase_50 AC 24 ms
24,312 KB
testcase_51 AC 24 ms
24,060 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"

#include <random>
//#include "util.k"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



int main()
{
	//clock_t start, end;
	//start = clock();

	//cin.tie(0);
	//ios::sync_with_stdio(false);

	vector<int> x(4);
	int pos = 0;
	vector<bool> used(10, false);
	x[0] = 1; x[1] = 2; x[2] = 3; x[3] = 4;
	used[2] = used[3] = used[4] = true;

	int h, b;
	while (true) {
		vector<pii> s;
		bool flag = false;
		for (int i = 1; i <= 9; i++) {
			if (!used[i]) {
				used[x[pos]] = false;
				x[pos] = i;
				used[i] = true;
				
				cout << x[0] << " " << x[1] << " " << x[2] << " " << x[3] << endl;
				cin >> h >> b;
				if (h == 4) return 0;
				if (h + b == 4) {
					flag = true;
					break;
				}
				s.push_back(pii(-(h + b), i));
			}
		}
		if (flag) break;
		sort(all(s));
		used[x[pos]] = false;
		x[pos] = s.front().second;
		used[x[pos]] = true;
		pos++;
	}

	sort(all(x));
	do {
		cout << x[0] << " " << x[1] << " " << x[2] << " " << x[3] << endl;
		cin >> h >> b;
		if (h == 4) break;
	} while (next_permutation(all(x)));

	//end = clock();
	//printf("%d msec.\k", end - start);

	return 0;
}
0