結果
問題 | No.425 ジャンケンの必勝法 |
ユーザー | colun |
提出日時 | 2016-09-22 23:22:38 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,756 bytes |
コンパイル時間 | 892 ms |
コンパイル使用メモリ | 55,920 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-17 19:32:08 |
合計ジャッジ時間 | 1,283 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 1 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 1 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | AC | 1 ms
5,248 KB |
testcase_17 | AC | 1 ms
5,248 KB |
testcase_18 | AC | 1 ms
5,248 KB |
testcase_19 | AC | 1 ms
5,248 KB |
testcase_20 | AC | 1 ms
5,248 KB |
testcase_21 | AC | 1 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
ソースコード
#define NDEBUG #undef __STRICT_ANSI__ #include <cstdlib> #include <cstdio> #include <tuple> #include <vector> #include <algorithm> #include <functional> #include <cstring> #include <cmath> #include <cfloat> #include <cassert> using namespace std; #undef assert #define assert(e) #include <cstdarg> #include <sys/time.h> class XsRandom { unsigned long long a; unsigned long long b; public: inline XsRandom() : a(0x8a5cd789635d2dffULL), b(0x121fd2155c472f96ULL) { } inline XsRandom(const XsRandom & o) : a(o.a), b(o.b) { } inline unsigned long long next64() { unsigned long long c = a ^ (a<<23); a = b; b = c ^ a ^ (c>>18) ^ (a>>5); return b + a; } inline XsRandom(unsigned int seed) : a(0x8a5cd789635d2dffULL), b(0x121fd2155c472f96ULL) { seed = seed * 1234567891 + 521288629; unsigned long long a2 = a; unsigned long long b2 = b; while(seed) { next64(); if(seed & 1) { a2 ^= a; b2 ^= b; } seed >>= 1; } a = a2; b = b2; } inline unsigned int next() { return (unsigned int)next64(); } inline int nextInt(int r) { assert(1<=r); return ((unsigned long long)next() * r)>>32; } }; typedef XsRandom MyRandom; MyRandom g_myRand; double g_startTime; double g_suspendTime = 0; const double g_timeupSecBase = 9.8; double g_timeupSec = g_timeupSecBase; #include <numeric> const char * nextCLineOrWord(int mode) { static char buf[65536]; static int bufLen = sizeof(buf); static int bufPos = sizeof(buf); static bool canReadFlag = true; static bool crFlag = false; static bool enterFlag = false; if(canReadFlag && (enterFlag ? bufLen<=bufPos : (int)sizeof(buf)<=bufPos+bufPos)) { if(0<bufLen-bufPos) { memmove(buf, buf+bufPos, bufLen-bufPos); bufLen -= bufPos; } else { bufLen = 0; } char * result = fgets(buf+bufLen, sizeof(buf)-bufLen, stdin); canReadFlag = (result!=NULL); if(result!=NULL) { int n = strlen(result); enterFlag = (n!=(int)sizeof(buf)-1-bufLen || (1<=bufLen+n && buf[bufLen+n-1]=='\n')); bufLen += n; } bufPos = 0; } if(mode==0) { int pos = bufPos; while(true) { char c = buf[pos]; if(c==32) { buf[pos++] = '\0'; break; } else if(c==10) { if(crFlag) { crFlag = false; if(bufPos==pos) { pos = ++bufPos; continue; } } buf[pos++] = '\0'; break; } else if(c==13) { crFlag = true; buf[pos++] = '\0'; break; } else if(c==0) { break; } ++pos; } const char * ret = buf + bufPos; bufPos = pos; return ret; } else if(mode==1) { int pos = bufPos; while(true) { char c = buf[pos]; if(c==10) { if(crFlag) { crFlag = false; if(bufPos==pos) { pos = ++bufPos; continue; } } buf[pos++] = '\0'; break; } else if(c==13) { crFlag = true; buf[pos++] = '\0'; break; } else if(c==0) { break; } ++pos; } const char * ret = buf + bufPos; bufPos = pos; return ret; } else if(mode==2) { return bufLen<=bufPos ? NULL : buf+bufPos; } assert(false); return NULL; } const char * nextCWord() { return nextCLineOrWord(0); } int nextInt() { return atoi(nextCWord()); } void echoln() { fputc('\n', stdout); } void echoln(const char * fmt, ...) { va_list arg; va_start(arg, fmt); vprintf(fmt, arg); va_end(arg); fputc('\n', stdout); } int main() { int p0 = nextInt(); int q = nextInt(); double win = 1.0 / 3; vector<double> vec(101); vec[p0] = win; for(int i=0; i<100; ++i) { vector<double> vec2(101); for(int p=0; p<101; ++p) { double p1 = vec[p] * p / 200; double p2 = vec[p] * (100-p) / 300; win += p1 + p2; vec2[max(0, p-q)] += p1; vec2[min(p+q, 100)] += p2; } vec = vec2; } echoln("%.10f", win); return 0; }