Submission #3513478
Source Code Expand
#include <bits/stdc++.h> #define rep(i, n) for (rint i = 1; i <= (n); i ++) #define re0(i, n) for (rint i = 0; i < (int) n; i ++) #define travel(i, u) for (rint i = head[u]; i; i = e[i].nxt) #define rint register int using namespace std; template<typename tp> inline void read(tp &x) { x = 0; char c = getchar(); int f = 0; for (; c < '0' || c > '9'; f |= c == '-', c = getchar()); for (; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + c - '0', c = getchar()); if (f) x = -x; } #define pb push_back #define db double db p[10], q[10]; int main(void) { rep (i, 6) cin >> p[i], p[i] /= 100; rep (i, 6) cin >> q[i], q[i] /= 100; db ans = 0.0, res; // Petr choose p first res = 0.0; rep (i, 6) { if (p[i] + q[i] < 1e-5) continue; res += p[i] * max(p[i], q[i]) / (p[i] + q[i]); } ans = max(ans, res); res = 0.0; rep (i, 6) { if (p[i] + q[i] < 1e-5) continue; res += q[i] * max(p[i], q[i]) / (p[i] + q[i]); } ans = max(ans, res); printf("%.10f\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1005 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1000 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | WA | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | WA | 1 ms | 256 KB |
006.txt | WA | 1 ms | 256 KB |
007.txt | WA | 1 ms | 256 KB |
008.txt | WA | 1 ms | 256 KB |
009.txt | WA | 1 ms | 256 KB |
010.txt | WA | 1 ms | 256 KB |
011.txt | WA | 1 ms | 256 KB |
012.txt | WA | 1 ms | 256 KB |
013.txt | WA | 1 ms | 256 KB |
014.txt | WA | 1 ms | 256 KB |
015.txt | WA | 1 ms | 256 KB |
016.txt | WA | 1 ms | 256 KB |
017.txt | WA | 1 ms | 256 KB |
018.txt | WA | 1 ms | 256 KB |
019.txt | WA | 1 ms | 256 KB |
020.txt | WA | 1 ms | 256 KB |
021.txt | WA | 1 ms | 256 KB |
022.txt | WA | 1 ms | 256 KB |
023.txt | WA | 1 ms | 256 KB |
024.txt | WA | 1 ms | 256 KB |
025.txt | WA | 1 ms | 256 KB |
026.txt | WA | 1 ms | 256 KB |
027.txt | WA | 1 ms | 256 KB |
028.txt | WA | 1 ms | 256 KB |
029.txt | WA | 1 ms | 256 KB |
030.txt | WA | 1 ms | 256 KB |
031.txt | WA | 1 ms | 256 KB |
032.txt | WA | 1 ms | 256 KB |
033.txt | WA | 1 ms | 256 KB |
034.txt | WA | 1 ms | 256 KB |
035.txt | WA | 1 ms | 256 KB |
036.txt | WA | 1 ms | 256 KB |
037.txt | WA | 1 ms | 256 KB |
038.txt | WA | 1 ms | 256 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |