Submission #1913809
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <cmath> using namespace std; long double p[10], q[10], sum, r, s; vector<pair<long double, long double>> A, B; int main() { for (int i = 1; i <= 6; i++) { cin >> p[i]; p[i] /= 100; } for (int i = 1; i <= 6; i++) { cin >> q[i]; q[i] /= 100; } for (int i = 1; i <= 6; i++) { if (fabs(p[i] - q[i]) < 0.001) { A.push_back(make_pair(0, p[i] + q[i])); s += q[i]; } else if (p[i] > q[i]) { A.push_back(make_pair(p[i] - q[i], p[i] + q[i])); s += q[i]; } else { B.push_back(make_pair(q[i] - p[i], p[i] + q[i])); r += p[i]; } } sum = r + s; sort(A.begin(), A.end()); sort(B.begin(), B.end()); if (r < s) { long double S = s - r; for (int i = 0; i < A.size(); i++) { long double E = A[i].second; if (E > S) { sum += A[i].first*S / E; break; } else { S -= A[i].second; sum += A[i].first; } } } else { long double S = r - s; for (int i = 0; i < B.size(); i++) { long double E = B[i].second; if (E > S) { sum += B[i].first*S / E; break; } else { S -= B[i].second; sum += B[i].first; } } } printf("%.20Lf\n", 1.0L - sum / 2); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | E869120 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1207 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 | AC | 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 | AC | 1 ms | 256 KB |
007.txt | AC | 1 ms | 256 KB |
008.txt | WA | 1 ms | 256 KB |
009.txt | WA | 1 ms | 256 KB |
010.txt | AC | 1 ms | 256 KB |
011.txt | AC | 1 ms | 256 KB |
012.txt | WA | 1 ms | 256 KB |
013.txt | AC | 1 ms | 256 KB |
014.txt | AC | 1 ms | 256 KB |
015.txt | AC | 1 ms | 256 KB |
016.txt | AC | 1 ms | 256 KB |
017.txt | AC | 1 ms | 256 KB |
018.txt | AC | 1 ms | 256 KB |
019.txt | AC | 1 ms | 256 KB |
020.txt | WA | 1 ms | 256 KB |
021.txt | AC | 1 ms | 256 KB |
022.txt | AC | 1 ms | 256 KB |
023.txt | WA | 1 ms | 256 KB |
024.txt | AC | 1 ms | 256 KB |
025.txt | AC | 1 ms | 256 KB |
026.txt | AC | 1 ms | 256 KB |
027.txt | WA | 1 ms | 256 KB |
028.txt | AC | 1 ms | 256 KB |
029.txt | WA | 1 ms | 256 KB |
030.txt | AC | 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 | AC | 1 ms | 256 KB |
035.txt | WA | 1 ms | 256 KB |
036.txt | AC | 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 |