Submission #997654
Source Code Expand
#include <iostream> #include <sstream> #include <algorithm> #include <string> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <memory> #include <complex> #include <numeric> #include <cstdio> #include <iomanip> #define REP(i,m,n) for(int i=int(m);i<int(n);i++) #define EACH(i,c) for (auto &(i): c) #define all(c) begin(c),end(c) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort(begin(c),end(c)) #define pb emplace_back #define MP make_pair #define SZ(a) int((a).size()) #ifdef LOCAL #define DEBUG(s) cout << (s) << endl #define dump(x) cerr << #x << " = " << (x) << endl #define BR cout << endl; #else #define DEBUG(s) do{}while(0) #define dump(x) do{}while(0) #define BR #endif using namespace std; using UI = unsigned int; using UL = unsigned long; using LL = long long int; using ULL = unsigned long long; using VI = vector<int>; using VVI = vector<VI>; using VLL = vector<LL>; using VS = vector<string>; using PII = pair<int,int>; using VP = vector<PII>; constexpr double EPS = 1e-10; constexpr double PI = acos(-1.0); template<class T> inline T sqr(T x) {return x*x;} double f(int x, double p) { return x / (2.0 * p); } int main() { int x,p; cin >> x >> p; if (p == 100) { cout << (x + 1) / 2 << endl; return 0; } if (x % 2 == 1) { //cout << (1-1.0*p/100) + 1 + (x - 1) / (2.0 * p / 100) << endl; //cout << (x - 1) / (2.0 * p / 100) << endl; //printf("%.08f\n", (1-1.0*p/100) + 1 + (x - 1) / (2.0 * p / 100)); printf("%.08f\n", 1+1.0*p/100*(f(x-1,1.0*p/100))+(1-1.0*p/100)*(f(x+1,1.0*p/100))); } else { //cout << x / (2.0 * p / 100) << endl; printf("%.08f\n", f(x, 1.0*p/100)); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Takahashi is Missing! |
User | unsre |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1782 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Dataset1 | Dataset2 | Dataset3 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 300 / 300 | 200 / 200 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask_01_ex1.txt, subtask_03_ex2.txt, subtask_04_ex3.txt |
Dataset1 | subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt |
Dataset2 | subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_ex2.txt |
Dataset3 | subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_ex2.txt, subtask_04_01.txt, subtask_04_02.txt, subtask_04_03.txt, subtask_04_04.txt, subtask_04_05.txt, subtask_04_06.txt, subtask_04_07.txt, subtask_04_08.txt, subtask_04_09.txt, subtask_04_ex3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask_01_02.txt | AC | 2 ms | 256 KB |
subtask_01_03.txt | AC | 2 ms | 256 KB |
subtask_01_04.txt | AC | 3 ms | 256 KB |
subtask_01_ex1.txt | AC | 2 ms | 256 KB |
subtask_02_01.txt | AC | 2 ms | 256 KB |
subtask_02_02.txt | AC | 2 ms | 256 KB |
subtask_02_03.txt | AC | 2 ms | 256 KB |
subtask_03_01.txt | AC | 2 ms | 256 KB |
subtask_03_02.txt | AC | 2 ms | 256 KB |
subtask_03_03.txt | AC | 3 ms | 256 KB |
subtask_03_04.txt | AC | 2 ms | 256 KB |
subtask_03_05.txt | AC | 3 ms | 256 KB |
subtask_03_ex2.txt | AC | 2 ms | 256 KB |
subtask_04_01.txt | AC | 2 ms | 256 KB |
subtask_04_02.txt | AC | 2 ms | 256 KB |
subtask_04_03.txt | AC | 3 ms | 256 KB |
subtask_04_04.txt | AC | 2 ms | 256 KB |
subtask_04_05.txt | AC | 3 ms | 256 KB |
subtask_04_06.txt | AC | 2 ms | 256 KB |
subtask_04_07.txt | AC | 2 ms | 256 KB |
subtask_04_08.txt | AC | 2 ms | 256 KB |
subtask_04_09.txt | AC | 2 ms | 256 KB |
subtask_04_ex3.txt | AC | 2 ms | 256 KB |