Submission #1000690
Source Code Expand
#include <string> #include <vector> #include <cstdio> #include <cstdlib> #include <cmath> #include <algorithm> #include <queue> #include <map> #include <set> #include <iostream> #include <sstream> #include <cstring> #include <numeric> using namespace std; typedef long long ll; typedef pair<int,int> pii; #define F0(i,n) for (int i = 0; i < n; i++) #define F1(i,n) for (int i = 1; i <= n; i++) #define CL(a,x) memset(x, a, sizeof(x)); #define SZ(x) ((int)x.size()) const double eps = 1e-10; const int MOD = 1000000007; int i, j, k, m, n, l; int ans; int p[101], q[101]; double solve() { double ret = 0.0; F0(i, 6) { double guessed = 0; if (p[i] == q[i]) guessed += 0.5; else if (p[i] > q[i]) guessed += 1.0; ret += p[i] * 0.01 * guessed; } return ret; } int main() { //freopen("x.in", "r", stdin); F0(i, 6) cin >> p[i]; F0(i, 6) cin >> q[i]; double t1 = solve(); F0(i, 6) swap(p[i], q[i]); double t2 = solve(); double t = min(t1, t2); printf("%.10lf\n", t); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | USA |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1048 Byte |
Status | WA |
Exec Time | 3 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 | 3 ms | 256 KB |
001.txt | AC | 3 ms | 256 KB |
002.txt | WA | 3 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | WA | 3 ms | 256 KB |
006.txt | WA | 3 ms | 256 KB |
007.txt | WA | 3 ms | 256 KB |
008.txt | WA | 3 ms | 256 KB |
009.txt | WA | 3 ms | 256 KB |
010.txt | WA | 3 ms | 256 KB |
011.txt | WA | 3 ms | 256 KB |
012.txt | WA | 3 ms | 256 KB |
013.txt | WA | 3 ms | 256 KB |
014.txt | WA | 3 ms | 256 KB |
015.txt | WA | 3 ms | 256 KB |
016.txt | WA | 3 ms | 256 KB |
017.txt | WA | 3 ms | 256 KB |
018.txt | WA | 3 ms | 256 KB |
019.txt | WA | 3 ms | 256 KB |
020.txt | WA | 3 ms | 256 KB |
021.txt | WA | 3 ms | 256 KB |
022.txt | WA | 3 ms | 256 KB |
023.txt | WA | 3 ms | 256 KB |
024.txt | WA | 3 ms | 256 KB |
025.txt | WA | 3 ms | 256 KB |
026.txt | WA | 3 ms | 256 KB |
027.txt | WA | 3 ms | 256 KB |
028.txt | WA | 3 ms | 256 KB |
029.txt | WA | 3 ms | 256 KB |
030.txt | WA | 3 ms | 256 KB |
031.txt | WA | 3 ms | 256 KB |
032.txt | WA | 3 ms | 256 KB |
033.txt | WA | 3 ms | 256 KB |
034.txt | WA | 3 ms | 256 KB |
035.txt | WA | 3 ms | 256 KB |
036.txt | WA | 3 ms | 256 KB |
037.txt | WA | 3 ms | 256 KB |
038.txt | WA | 3 ms | 256 KB |
example0.txt | AC | 3 ms | 256 KB |
example1.txt | AC | 3 ms | 256 KB |