Submission #1003936


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>

using namespace std;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
#define repv(t,it,v) for(vector<t>::iterator it = v.begin() ; it != v.end() ; ++it)

int p[6];
int q[6];

double fanc(double a){
	double x = 0.0;
	repp(i,0,6){
		x += max(p[i] * a / 100.0 , q[i] * (1.0-a) / 100.0);
	}
	return x;
}

double TS(double a , double b , int t){
	if(t == 100) return (a+b) / 2.0;
	double c = (b-a) / 3.0;
	return fanc(a+c) < fanc(b-c) ? TS(a,b-c,t+1) : TS(a+c,b,t+1);
}

int main(){
	repp(i,0,6){
		scanf("%d" , p + i);
	}
	repp(i,0,6){
		scanf("%d" , q + i);
	}
	printf("%.13f\n" , fanc(TS(0.0,1.0,0)));
	return 0;
}

Submission Info

Submission Time
Task D - Dice Game
User PIandS
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 853 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d" , p + i);
                      ^
./Main.cpp:36: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
AC × 2
AC × 41
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 128 KB
001.txt AC 1 ms 128 KB
002.txt AC 1 ms 128 KB
003.txt AC 1 ms 128 KB
004.txt AC 1 ms 128 KB
005.txt AC 1 ms 128 KB
006.txt AC 1 ms 128 KB
007.txt AC 1 ms 128 KB
008.txt AC 1 ms 128 KB
009.txt AC 1 ms 128 KB
010.txt AC 1 ms 128 KB
011.txt AC 1 ms 128 KB
012.txt AC 1 ms 128 KB
013.txt AC 1 ms 128 KB
014.txt AC 1 ms 128 KB
015.txt AC 1 ms 128 KB
016.txt AC 1 ms 128 KB
017.txt AC 1 ms 128 KB
018.txt AC 1 ms 128 KB
019.txt AC 1 ms 128 KB
020.txt AC 1 ms 128 KB
021.txt AC 1 ms 128 KB
022.txt AC 1 ms 128 KB
023.txt AC 1 ms 128 KB
024.txt AC 1 ms 128 KB
025.txt AC 1 ms 128 KB
026.txt AC 1 ms 128 KB
027.txt AC 1 ms 128 KB
028.txt AC 1 ms 128 KB
029.txt AC 1 ms 128 KB
030.txt AC 1 ms 128 KB
031.txt AC 1 ms 128 KB
032.txt AC 1 ms 128 KB
033.txt AC 1 ms 128 KB
034.txt AC 1 ms 128 KB
035.txt AC 1 ms 128 KB
036.txt AC 1 ms 128 KB
037.txt AC 1 ms 128 KB
038.txt AC 1 ms 128 KB
example0.txt AC 1 ms 128 KB
example1.txt AC 1 ms 128 KB