Submission #2531875


Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<functional>
#include<iomanip>
#include<queue>
#include<cassert>
#include<tuple>
#include<set>
#include<map>
#include<list>
#include<bitset>

#define PB push_back
#define ALL(a)  (a).begin(),(a).end()
#define DWN(a)  (a).begin(),(a).end(), greater<int>()
#define rep(i, m) for (int i = 0; i < m; i++)
#define REP(i, n, m) for (int i = n; i < m; i++)

#define mod 1000000007

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int INF = (int)1e9;

int N;
int t[101];
double v[101];
double maxv[40010];

int main()
{
	cin >> N;
	rep(i, N) {
		cin >> t[i];
		t[i] *= 2;
	}
	rep(i, N) cin >> v[i];

	fill(maxv, maxv + 40010, INF);

	int cur = 0;

	rep(i, N)
	{
		REP(j, cur, cur + t[i] + 1){
			maxv[j] = min(maxv[j], v[i]);
		}
		cur += t[i];
	}

	maxv[0] = 0; maxv[cur] = 0;

	for (int i = 0; i < cur - 1; i++) {
		maxv[i + 1] = min(maxv[i + 1], maxv[i] + 0.5);
	}

	for (int i = cur - 1; i >= 0; --i){
		maxv[i] = min(maxv[i], maxv[i + 1] + 0.5);
	}
	double ans = 0.0;

	rep(i, cur) {
		ans += maxv[i] + maxv[i + 1];
	}
	cout << setprecision(10) << ans / 4.0 << endl;
	return 0;
}

Submission Info

Submission Time
Task D - AtCoder Express
User tako_39
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1383 Byte
Status AC
Exec Time 2 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 5
AC × 40
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt, s5.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, s1.txt, s2.txt, s3.txt, s4.txt, s5.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 512 KB
in02.txt AC 1 ms 512 KB
in03.txt AC 1 ms 512 KB
in04.txt AC 1 ms 512 KB
in05.txt AC 2 ms 512 KB
in06.txt AC 2 ms 512 KB
in07.txt AC 2 ms 512 KB
in08.txt AC 2 ms 512 KB
in09.txt AC 2 ms 512 KB
in10.txt AC 2 ms 512 KB
in11.txt AC 2 ms 512 KB
in12.txt AC 1 ms 512 KB
in13.txt AC 1 ms 512 KB
in14.txt AC 1 ms 512 KB
in15.txt AC 1 ms 512 KB
in16.txt AC 1 ms 512 KB
in17.txt AC 1 ms 512 KB
in18.txt AC 1 ms 512 KB
in19.txt AC 1 ms 512 KB
in20.txt AC 2 ms 512 KB
in21.txt AC 2 ms 512 KB
in22.txt AC 2 ms 512 KB
in23.txt AC 1 ms 512 KB
in24.txt AC 2 ms 512 KB
in25.txt AC 2 ms 512 KB
in26.txt AC 2 ms 512 KB
in27.txt AC 2 ms 512 KB
in28.txt AC 1 ms 512 KB
in29.txt AC 1 ms 512 KB
in30.txt AC 1 ms 512 KB
in31.txt AC 2 ms 512 KB
in32.txt AC 2 ms 512 KB
in33.txt AC 2 ms 512 KB
in34.txt AC 1 ms 512 KB
in35.txt AC 1 ms 512 KB
s1.txt AC 1 ms 512 KB
s2.txt AC 1 ms 512 KB
s3.txt AC 1 ms 512 KB
s4.txt AC 1 ms 512 KB
s5.txt AC 1 ms 512 KB