Submission #1714460
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef long double lf;
ll cross(pii a, pii b) {
return 1LL * a.first * b.second - 1LL * a.second * b.first;
}
int P[6], Q[6];
vector<pii> Sum, Conv;
vector<pii> mrg(vector<pii> &a, vector<pii> &b) {
vector<pii> ret;
int pos1 = 0, pos2 = 0;
while(pos1 < a.size() && pos2 < b.size()) {
if(cross(a[pos1], b[pos2]) <= 0) ret.push_back(a[pos1]), pos1++;
else ret.push_back(b[pos2]), pos2++;
}
while(pos1 < a.size()) ret.push_back(a[pos1]), pos1++;
while(pos2 < b.size()) ret.push_back(b[pos2]), pos2++;
return ret;
}
int main() {
for(int i = 0; i < 6; i++) {
scanf("%d", &P[i]);
}
for(int i = 0; i < 6; i++) {
scanf("%d", &Q[i]);
}
Sum.push_back(pii(-P[0], Q[0]));
Sum.push_back(pii(P[0], -Q[0]));
for(int i = 1; i < 6; i++) {
vector<pii> tmp;
tmp.push_back(pii(-P[i], Q[i]));
tmp.push_back(pii(P[i], -Q[i]));
Sum = mrg(Sum, tmp);
}
pii st = pii(0, 0);
for(int i = 0; i < 6; i++) {
st.first += P[i];
}
Conv.push_back(st);
for(int i = 0; i < (int)Sum.size() - 1; i++) {
pii tmp = Conv.back();
Conv.push_back(pii(tmp.first + Sum[i].first, tmp.second + Sum[i].second));
}
lf ans = 0;
for(int i = 0; i < Conv.size(); i++) {
pii a = Conv[i];
pii b = Conv[(i + 1)%Conv.size()];
if(a.first == a.second || b.first == b.second || ((a.first < a.second) ^ (b.first < b.second))) {
lf x1 = a.first;
lf y1 = a.second;
lf x2 = b.first;
lf y2 = b.second;
if(a.first == b.first) ans = max(ans, x1);
else ans = max(ans, (y1 - (y2 - y1) / (x2 - x1) * x1) / (1 - (y2 - y1) / (x2 - x1)));
}
else if(a.first < a.second) ans = max(ans, (lf)max(a.first, b.first));
else ans = max(ans, (lf)max(a.second, b.second));
}
cout<<fixed;
cout.precision(20);
cout << ans / 100;
}
Submission Info
Submission Time |
|
Task |
D - Dice Game |
User |
choikiwon |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2155 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:30:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &P[i]);
^
./Main.cpp:33:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &Q[i]);
^
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 |
WA |
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 |
AC |
1 ms |
256 KB |
009.txt |
AC |
1 ms |
256 KB |
010.txt |
AC |
1 ms |
256 KB |
011.txt |
AC |
1 ms |
256 KB |
012.txt |
AC |
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 |
WA |
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 |
AC |
1 ms |
256 KB |
021.txt |
AC |
1 ms |
256 KB |
022.txt |
AC |
1 ms |
256 KB |
023.txt |
AC |
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 |
AC |
1 ms |
256 KB |
028.txt |
AC |
1 ms |
256 KB |
029.txt |
AC |
1 ms |
256 KB |
030.txt |
AC |
1 ms |
256 KB |
031.txt |
AC |
1 ms |
256 KB |
032.txt |
AC |
1 ms |
256 KB |
033.txt |
AC |
1 ms |
256 KB |
034.txt |
AC |
1 ms |
256 KB |
035.txt |
AC |
1 ms |
256 KB |
036.txt |
AC |
1 ms |
256 KB |
037.txt |
AC |
1 ms |
256 KB |
038.txt |
AC |
1 ms |
256 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |