結果
問題 | No.3011 あ、俺こいつの役やりたい! |
ユーザー |
|
提出日時 | 2025-01-25 13:59:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 9,220 bytes |
コンパイル時間 | 4,379 ms |
コンパイル使用メモリ | 260,080 KB |
実行使用メモリ | 26,216 KB |
平均クエリ数 | 12.50 |
最終ジャッジ日時 | 2025-01-25 23:04:56 |
合計ジャッジ時間 | 8,389 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge9 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 41 WA * 3 |
ソースコード
#define _CRT_NONSTDC_NO_WARNINGS#define _CRT_SECURE_NO_WARNINGS#define ENABLE_DUMP//#define ENABLE_PERF#include <bits/stdc++.h>#include <random>#include <unordered_set>#include <array>#include <atcoder/all>//#include <json.hpp>//#include <boost/rational.hpp>//#include <boost/multiprecision/cpp_int.hpp>//#include <boost/multiprecision/cpp_bin_float.hpp>//using u128 = boost::multiprecision::uint128_t;//using i128 = boost::multiprecision::int128_t;#ifdef _MSC_VER#include <conio.h>#include <ppl.h>#include <filesystem>//#include <opencv2/core.hpp>//#include <opencv2/highgui.hpp>//#include <opencv2/imgproc.hpp>#include <intrin.h>int __builtin_clz(unsigned int n) { unsigned long index; _BitScanReverse(&index, n); return 31 - index; }int __builtin_ctz(unsigned int n) { unsigned long index; _BitScanForward(&index, n); return index; }namespace std { inline int __lg(int __n) { return sizeof(int) * 8 - 1 - __builtin_clz(__n); } }#define __builtin_popcnt = __popcnt;#define __builtin_popcntll = __popcnt64;#else#pragma GCC target("avx2")#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#endif/** compro_io **/#ifdef ATCODER_MODINT_HPPusing mint = atcoder::modint998244353;std::ostream& operator<<(std::ostream& os, const mint& m) {os << m.val();return os;}std::istream& operator>>(std::istream& is, mint& m) {uint64_t x;is >> x;m = x;return is;}#endifnamespace aux {template<typename T, unsigned N, unsigned L> struct tp { static void output(std::ostream& os, const T& v) { os << std::get<N>(v) << ", "; tp<T, N+ 1, L>::output(os, v); } };template<typename T, unsigned N> struct tp<T, N, N> { static void output(std::ostream& os, const T& v) { os << std::get<N>(v); } };}template<typename... Ts> std::ostream& operator<<(std::ostream& os, const std::tuple<Ts...>& t) { os << '['; aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t); return os << ']'; } // tuple outtemplate<class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& os, const Container& x); //container out (fwd decl)template<class S, class T> std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) { return os << "[" << p.first << ", " << p.second <<"]"; } // pair outtemplate<class S, class T> std::istream& operator>>(std::istream& is, std::pair<S, T>& p) { return is >> p.first >> p.second; } // pair instd::ostream& operator<<(std::ostream& os, const std::vector<bool>::reference& v) { os << (v ? '1' : '0'); return os; } // bool (vector) outstd::ostream& operator<<(std::ostream& os, const std::vector<bool>& v) { bool f = true; os << "["; for (const auto& x : v) { os << (f ? "" : ", ") <<x; f = false; } os << "]"; return os; } // vector<bool> outtemplate<class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& os, const Container& x) { bool f =true; os << "["; for (auto& y : x) { os << (f ? "" : ", ") << y; f = false; } return os << "]"; } // container outtemplate<class T, class = decltype(std::begin(std::declval<T&>())), class = typename std::enable_if<!std::is_same<T, std::string>::value>::type> std::istream& operator>>(std::istream& is, T& a) { for (auto& x : a) is >> x; return is; } // container intemplate<typename T> auto operator<<(std::ostream& out, const T& t) -> decltype(out << t.stringify()) { out << t.stringify(); return out; } // struct(has stringify() func) out/** io setup **/struct IOSetup { IOSetup(bool f) { if (f) { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); } std::cout << std::fixed << std::setprecision(15); } }iosetup(true); // set false when solving interective problems/** string formatter **/template<typename... Ts> std::string format(const std::string& f, Ts... t) { size_t l = std::snprintf(nullptr, 0, f.c_str(), t...); std::vector<char>b(l + 1); std::snprintf(&b[0], l + 1, f.c_str(), t...); return std::string(&b[0], &b[0] + l); }/** dump **/#ifdef ENABLE_DUMP#define DUMPOUT std::cerrstd::ostringstream DUMPBUF;#define dump(...) do{DUMPBUF<<" ";DUMPBUF<<#__VA_ARGS__<<" :[DUMP - "<<__LINE__<<":"<</*__PRETTY_FUNCTION__*/__FUNCTION__<<"]"<<std::endl;DUMPBUF<<"";dump_func(__VA_ARGS__);DUMPOUT<<DUMPBUF.str();DUMPBUF.str("");DUMPBUF.clear();}while(0);void dump_func() { DUMPBUF << std::endl; }template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPBUF << head; if (sizeof...(Tail) == 0) { DUMPBUF << " "; }else { DUMPBUF << ", "; } dump_func(std::move(tail)...); }#else#define DUMP(...) void(0);#endif/* timer */class Timer {double t = 0, paused = 0, tmp;public:Timer() { reset(); }static double time() {#ifdef _MSC_VERreturn __rdtsc() / 2.3e9;#elseunsigned long long a, d;__asm__ volatile("rdtsc": "=a"(a), "=d"(d));return (d << 32 | a) / 2.3e9;#endif}void reset() { t = time(); }void pause() { tmp = time(); }void restart() { paused += time() - tmp; }double elapsed_ms() const { return (time() - t - paused) * 1000.0; }} timer;/** perf counter **/#if !defined(__PRETTY_FUNCTION__) && !defined(__GNUC__)#define __PRETTY_FUNCTION__ __FUNCSIG__#endifstruct PerfCounter {std::string name;Timer timer;PerfCounter(const std::string& name_) : name(name_) {}~PerfCounter() {#ifdef ENABLE_PERFstd::cerr << format("[PerfCounter] %6d ms <%s>.\n", (int)timer.elapsed_ms(), name.c_str());#endif}};/** rand **/struct Xorshift {static constexpr uint32_t M = UINT_MAX;static constexpr double e = 1.0 / M;uint64_t x = 88172645463325252LL;Xorshift() {}Xorshift(uint64_t seed) { reseed(seed); }inline void reseed(uint64_t seed) { x = 0x498b3bc5 ^ seed; for (int i = 0; i < 20; i++) next_u64(); }inline uint64_t next_u64() { x ^= x << 7; return x ^= x >> 9; }inline uint64_t next_u64(uint64_t mod) { return next_u64() % mod; }inline uint64_t next_u64(uint64_t l, uint64_t r) { return l + next_u64(r - l + 1); }inline uint32_t next_u32() { return next_u64() >> 32; }inline uint32_t next_u32(uint32_t mod) { return ((uint64_t)next_u32() * mod) >> 32; }inline uint32_t next_u32(uint32_t l, uint32_t r) { return l + next_u32(r - l + 1); }inline double next_double() { return next_u32() * e; }inline double next_double(double c) { return next_double() * c; }inline double next_double(double l, double r) { return next_double(r - l) + l; }};/** shuffle **/template<typename T> void shuffle_vector(std::vector<T>& v, Xorshift& rnd) { int n = v.size(); for (int i = n - 1; i >= 1; i--) { int r = rnd.next_u32(i); std::swap(v[i], v[r]); } }/** split **/std::vector<std::string> split(std::string str, const std::string& delim) { for (char& c : str) if (delim.find(c) != std::string::npos) c = ' '; std::istringstream iss(str); std::vector<std::string> parsed; std::string buf; while (iss >> buf) parsed.push_back(buf); return parsed; }/** misc **/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); } // fill arraytemplate<typename T, typename ...Args> auto make_vector(T x, int arg, Args ...args) { if constexpr (sizeof...(args) == 0)return std::vector<T>(arg, x); else return std::vector(arg, make_vector<T>(x, args...)); }template<typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }template<typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }/** hash **/namespace aux { template<typename T> inline void hash(std::size_t& s, const T& v) { s ^= std::hash<T>()(v) + 0x9e3779b9 + (s << 6) + (s >> 2); } }namespace std { template<typename F, typename S> struct hash<std::pair<F, S>> { size_t operator()(const std::pair<F, S>& s) const noexcept { size_tseed = 0; aux::hash(seed, s.first); aux::hash(seed, s.second); return seed; } }; }/** using **/using ll = int64_t;using ull = uint64_t;using ld = double;//using ld = boost::multiprecision::cpp_bin_float_quad;using pii = std::pair<int, int>;using pll = std::pair<ll, ll>;template<typename T> using PQ = std::priority_queue<T>;template<typename T> using MPQ = std::priority_queue<T, std::vector<T>, std::greater<T>>;//using namespace std;template<typename T>void print_vector(const std::vector<T>& v) {for (int i = 0; i < v.size(); i++) {std::cout << (i ? " " : "") << v[i];}std::cout << '\n';}#if 1inline double get_temp(double stemp, double etemp, double t, double T) {return etemp + (stemp - etemp) * (T - t) / T;};#elseinline double get_temp(double stemp, double etemp, double t, double T) {return stemp * pow(etemp / stemp, t / T);};#endifvoid solve() {using namespace std;int x = 1000000000;for (int m = 0; m < 30; m++) {cout << x << endl;int r;cin >> r;if (r == 1 || r == -1) {return;}x = (x + 1) / 2;}}int main() {int T = 1;//cin >> T;for (int t = 0; t < T; t++) {solve();}return 0;}