#60534 (C++11) No.305 鍵(2)

• 問題: No.305 鍵(2)
• ユーザー: omu
• 提出日時: 2015-11-27 22:56:08
• 言語: C++11 (gcc 11.4.0)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 2,648 bytes
• コンパイル時間: 693 ms
• コンパイル使用メモリ: 92,860 KB
• 実行使用メモリ: 25,460 KB
• 平均クエリ数: 66.92
• 最終ジャッジ日時: 2024-07-16 06:40:22
• 合計ジャッジ時間: 2,049 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	26 ms; 24,964 KB
testcase_01	AC	23 ms; 25,220 KB
testcase_02	AC	23 ms; 25,220 KB
testcase_03	AC	23 ms; 24,964 KB
testcase_04	AC	22 ms; 25,348 KB
testcase_05	AC	24 ms; 24,964 KB
testcase_06	WA	-
testcase_07	AC	27 ms; 24,580 KB
testcase_08	AC	24 ms; 25,220 KB
testcase_09	AC	23 ms; 25,220 KB
testcase_10	AC	23 ms; 25,220 KB
testcase_11	AC	23 ms; 24,836 KB
testcase_12	AC	23 ms; 24,836 KB

ソースコード

#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;

inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep) { if (_First == _Last)return ""; ostringstream sout; sout << *_First; for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep << *_First; }return sout.str(); }
template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep, string sep2) { if (_First == _Last)return ""; ostringstream sout; sout << toString(all(*_First), sep); for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep2 << toString(all(*_First), sep); }return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
template<class T> inline T mypow(T x, ll n){ T res = 1; while (n > 0){ if (n & 1)res = res * x;	x = x * x;	n >>= 1; }return res; }
inline int gcd(ll a, ll b){ return b ? gcd(b, a%b) : a; }
inline int lcm(ll a, ll b){ return a / gcd(a, b) * b; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define rFor(i,a,b)	for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)	rFor(i,n,0)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define tostr(a)	toString(a)

const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };

const ll mod = 1e9 + 7;
const ll INF = 1e9 + 9;

#define int ll

signed main(){

	int prev = -1;
	string ans(10, '0');
	string s;
	cout << ans << endl;
	cin >> prev >> s;
	string out(10, '0');

	rep(target, 10){
		rep(chg, 10){
			out[target] = chg + '0';
			cout << out << endl;
			int now;
			cin >> now >> s;
			if (s == "unlocked")return 0;
			if (now > prev){
				ans[target] = chg + '0';
				prev = now;
				break;
			}
			prev = now;
		}
	}
	cout << ans << endl;

	return 0;
}