Submission #1000711
Source Code Expand
#ifdef DEBUG #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> using namespace std; mt19937 mrand(random_device{} ()); int rnd(int x) { return mrand() % x; } typedef long double ld; typedef long long ll; #ifdef DEBUG #define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr) #else #define eprintf(...) ; #endif #define pb push_back #define mp make_pair #define sz(x) ((int) (x).size()) #define TASK "text" const int inf = (int) 1.01e9; const ld eps = 1e-9; const ld pi = acos((ld) -1.0); void precalc() { } const int n = 6; int ps[2][n]; int read() { for (int it = 0; it < 2; ++it) { for (int i = 0; i < n; ++i) { if (scanf("%d", ps[it] + i) < 1) { return 0; } } } return 1; } void solve() { vector<pair<ld, ld> > adds; ld cur = 0, v = 0; for (int i = 0; i < n; ++i) { ld a = ps[0][i], b = ps[1][i]; if (ps[0][i] + ps[1][i] == 0) { continue; } cur += b; v += -b; ld x = b / (a + b); adds.pb(mp(x, a + b)); adds.pb(mp(1, -b)); } sort(adds.begin(), adds.end()); ld res = cur; ld last = 0; for (int i = 0; i < sz(adds); ++i) { cur += v * (adds[i].first - last); last = adds[i].first; v += adds[i].second; res = min(res, cur); } res /= 100; printf("%.18f\n", (double) res); } int main() { precalc(); #ifdef LOCAL freopen(TASK ".out", "w", stdout); assert(freopen(TASK ".in", "r", stdin)); #endif while (1) { if (!read()) { break; } solve(); #ifdef DEBUG eprintf("Time %.2f\n", (double) clock() / CLOCKS_PER_SEC); #endif } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | XraY |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1706 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 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 | AC | 3 ms | 256 KB |
003.txt | AC | 3 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | AC | 3 ms | 256 KB |
006.txt | AC | 3 ms | 256 KB |
007.txt | AC | 3 ms | 256 KB |
008.txt | AC | 3 ms | 256 KB |
009.txt | AC | 3 ms | 256 KB |
010.txt | AC | 3 ms | 256 KB |
011.txt | AC | 3 ms | 256 KB |
012.txt | AC | 3 ms | 256 KB |
013.txt | AC | 3 ms | 256 KB |
014.txt | AC | 3 ms | 256 KB |
015.txt | AC | 3 ms | 256 KB |
016.txt | AC | 3 ms | 256 KB |
017.txt | AC | 3 ms | 256 KB |
018.txt | AC | 3 ms | 256 KB |
019.txt | AC | 3 ms | 256 KB |
020.txt | AC | 3 ms | 256 KB |
021.txt | AC | 3 ms | 256 KB |
022.txt | AC | 3 ms | 256 KB |
023.txt | AC | 3 ms | 256 KB |
024.txt | AC | 3 ms | 256 KB |
025.txt | AC | 3 ms | 256 KB |
026.txt | AC | 3 ms | 256 KB |
027.txt | AC | 3 ms | 256 KB |
028.txt | AC | 3 ms | 256 KB |
029.txt | AC | 3 ms | 256 KB |
030.txt | AC | 3 ms | 256 KB |
031.txt | AC | 3 ms | 256 KB |
032.txt | AC | 3 ms | 256 KB |
033.txt | AC | 3 ms | 256 KB |
034.txt | AC | 3 ms | 256 KB |
035.txt | AC | 3 ms | 256 KB |
036.txt | AC | 3 ms | 256 KB |
037.txt | AC | 3 ms | 256 KB |
038.txt | AC | 3 ms | 256 KB |
example0.txt | AC | 3 ms | 256 KB |
example1.txt | AC | 3 ms | 256 KB |