結果

問題 No.355 数当てゲーム(2)
ユーザー naimonon77
提出日時 2016-09-03 05:06:02
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,996 bytes
コンパイル時間 2,432 ms
コンパイル使用メモリ 190,100 KB
実行使用メモリ 39,644 KB
最終ジャッジ日時 2024-07-17 00:22:49
合計ジャッジ時間 8,860 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other TLE * 1 -- * 51
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define REP(i,a,b) for(i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not a)
#define dump(x) cerr << #x << " = " << (x) << endl
using namespace std;
// #define int ll
bool test = 0;
int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define INF (1 << 28)
ull mod = (int)1e9 + 7;
//.....................
#define MAX (int)1e6 + 5
ll now_x, now_y;
ll pre_x, pre_y;
signed main(void) {
ll i, j, k, l;
map<int, int> status;
set<int> pre_query = { 0,1,2,3 };
auto itr = pre_query.begin();
for(i=0;i<3;i++,itr++) cout << *itr << " ";
cout << *itr << endl;
cin >> pre_x >> pre_y;
rep(i, 10) status[i] = 0;
while (status.size() > 4) {
int target = -1;
int try_num;
vector<int> target_vec;
for (auto v : pre_query) {
target_vec.push_back(v);
}
target = target_vec[rand() % target_vec.size()];
set<int> now_query = pre_query;
now_query.erase(target);
vector<int> o;
for (auto a : status) {
if (now_query.count(a.first) == 0) {
o.push_back(a.first);
}
}
try_num = o[rand() % o.size()];
now_query.insert(try_num);
// random
auto itr = now_query.begin();
for (i = 0; i<3; i++, itr++) cout << *itr << " ";
cout << *itr << endl;
cin >> now_x >> now_y;
int diff = now_x + now_y - (pre_x + pre_y);
if (diff < 0) {
status.erase(try_num);
status[target] = 1;
}
if (diff > 0) {
status.erase(target);
status[try_num] = 1;
}
pre_query = now_query;
pre_x = now_x;
pre_y = now_y;
for (auto v : status) {
fprintf(stderr,"status[%d] = %d\n", v.first, v.second);
}
}
vector<int> query;
for (auto a : status) query.push_back(a.first);
do {
rep(i, 3) cout << query[i] << " ";
cout << query[i] << endl;
cin >> now_x >> now_y;
if (now_x == 4) break;
} while (next_permutation(ALL(query)));
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0