CODE FESTIVAL 2016 Elimination Tournament Round 2 (Parallel)

Submission #1628834

Source codeソースコード

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

void mainmain(){
	ll _x;
	cin>>_x;
	double x=_x;
	double p;
	cin>>p;
	p = p/100;
	double ans;
	if(_x%2==0){
		ans = 1/p*x/2;
	}
	else{
		ans = p*(1/p*(x-1)/2) + (1-p)*(1/p*(x+1)/2);
		ans+=1;
	}
	cout<<ans<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Submission

Task問題 A - 迷子の高橋君 / Takahashi is Missing!
User nameユーザ名 nola_suz
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 700
Source lengthソースコード長 2411 Byte
File nameファイル名
Exec time実行時間 1 ms
Memory usageメモリ使用量 256 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - subtask_01_ex1.txt,subtask_03_ex2.txt,subtask_04_ex3.txt
Dataset1 200 / 200 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 300 / 300 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 200 / 200 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
subtask_01_02.txt AC 1 ms 256 KB
subtask_01_03.txt AC 1 ms 256 KB
subtask_01_04.txt AC 1 ms 256 KB
subtask_01_ex1.txt AC 1 ms 256 KB
subtask_02_01.txt AC 1 ms 256 KB
subtask_02_02.txt AC 1 ms 256 KB
subtask_02_03.txt AC 1 ms 256 KB
subtask_03_01.txt AC 1 ms 256 KB
subtask_03_02.txt AC 1 ms 256 KB
subtask_03_03.txt AC 1 ms 256 KB
subtask_03_04.txt AC 1 ms 256 KB
subtask_03_05.txt AC 1 ms 256 KB
subtask_03_ex2.txt AC 1 ms 256 KB
subtask_04_01.txt AC 1 ms 256 KB
subtask_04_02.txt AC 1 ms 256 KB
subtask_04_03.txt AC 1 ms 256 KB
subtask_04_04.txt AC 1 ms 256 KB
subtask_04_05.txt AC 1 ms 256 KB
subtask_04_06.txt AC 1 ms 256 KB
subtask_04_07.txt AC 1 ms 256 KB
subtask_04_08.txt AC 1 ms 256 KB
subtask_04_09.txt AC 1 ms 256 KB
subtask_04_ex3.txt AC 1 ms 256 KB