Submission #1005293
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }
class Simplex {
public:
typedef long double Num;
typedef vector<Num> Vector;
typedef vector<Vector> Matrix;
static Num getEPS() { return 1e-10; }
int solve(const Matrix &A, const Vector &b, const Vector &c, Num &value) {
m = (int)A.size(), n = (int)c.size();
this->A.assign(m + 1, Vector(n + 1));
this->b.assign(m + 1, Num());
this->N.assign(n, -1);
this->B.assign(m, -1);
for(int i = 0; i < m; ++ i) {
for(int j = 0; j < n; ++ j)
this->A[i][j] = A[i][j];
this->A[i][n] = b[i];
}
for(int j = 0; j < n; ++ j)
this->A[m][j] = c[j];
return simplex(value);
}
private:
int n, m;
Matrix A;
Vector b;
vector<int> N, B;
void pivot(int r, int c) {
swap(N[c], B[r]);
A[r][c] = 1 / A[r][c];
for(int j = 0; j <= n; ++ j) if(j != c)
A[r][j] = A[r][j] * A[r][c];
for(int i = 0; i <= m; ++ i) if(i != r) {
for(int j = 0; j <= n; ++ j) if(j != c)
A[i][j] -= A[i][c] * A[r][j];
A[i][c] = -A[i][c] * A[r][c];
}
}
int feasible() {
while(1) {
Num p = numeric_limits<Num>::infinity();
int r, c;
for(int i = 0; i < m; i++)
if(A[i][n] < p)
p = A[i][n], r = i;
if(p >= -getEPS()) return 1;
p = 0;
for(int i = 0; i < n; i++)
if(A[r][i] < p)
p = A[r][i], c = i;
if(p >= -getEPS()) return 0;
p = A[r][n] / A[r][c];
for(int i = r + 1; i < m; i++) if(A[i][c] > getEPS()) {
Num v = A[i][n] / A[i][c];
if(v < p) r = i, p = v;
}
pivot(r, c);
}
}
int simplex(Num &value) {
for(int i = 0; i < n; ++ i) N[i] = i;
for(int i = 0; i < m; ++ i) B[i] = n + i;
if(!feasible()) return 0;
while(1) {
Num p = 0; int r, c;
for(int i = 0; i < n; ++ i) if(A[m][i] > p)
p = A[m][i], c = i;
if(p < getEPS()) {
for(int i = 0; i < n; i++) if(N[i] < n)
b[N[i]] = 0;
for(int i = 0; i < m; i++) if(B[i] < n)
b[B[i]] = A[i][n];
value = -A[m][n];
return 1;
}
p = numeric_limits<Num>::infinity();
for(int i = 0; i < m; i++) if(A[i][c] > getEPS()) {
Num v = A[i][n] / A[i][c];
if(v < p) p = v, r = i;
}
if(p == numeric_limits<Num>::infinity())
return -1;
pivot(r, c);
}
}
};
int main() {
while(1) {
const int N = 6;
vector<int> p(N);
for(int i = 0; i < N; ++ i)
scanf("%d", &p[i]);
vector<int> q(N);
for(int i = 0; i < N; ++ i)
scanf("%d", &q[i]);
if(feof(stdin)) break;
Simplex::Matrix A;
Simplex::Vector b, c(N + 1);
const int x = N;
rep(i, N) {
A.push_back(Simplex::Vector(c.size()));
//p_i x <= y_i
A.back()[x] = p[i] * 1e-2;
A.back()[i] = -1;
b.push_back(0);
//q_i (1-x) <= y_i
A.push_back(Simplex::Vector(c.size()));
A.back()[x] = -q[i] * 1e-2;
A.back()[i] = -1;
b.push_back(-q[i] * 1e-2);
}
rep(i, N) c[i] = -1;
Simplex simplex;
Simplex::Num ans;
simplex.solve(A, b, c, ans);
printf("%.10f\n", (double)-ans);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Dice Game |
User |
anta |
Language |
C++14 (GCC 5.4.1) |
Score |
1000 |
Code Size |
3583 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
384 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:109:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &p[i]);
^
./Main.cpp:112:22: 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 |
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 |
384 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 |