Submission #3219128
Source Code Expand
#include "bits/stdc++.h" using namespace std; const int N = 105; int t[N], v[N], z[400 * N], mv, to, s; int main() { int n, i, j = 0; scanf("%d", &n); for(int i = 1; i <= n; ++i) scanf("%d", t + i), t[i] *= 2; for(int i = 1; i <= n; ++i) scanf("%d", v + i), v[i] *= 2; for(int i = 1; i <= n; ++i) { to += t[i]; z[j] = min(z[j], v[i]); for(++j; j <= to; ++j) z[j] = min(z[j - 1] + 1, v[i]); j--; } for(int i = j - 1; i >= 1; i--) s += mv = (min(z[i], mv + 1)); printf("%.9f\n", s / 4.0); }
Submission Info
Submission Time | |
---|---|
Task | D - AtCoder Express |
User | shibly |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 577 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:10:62: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i = 1; i <= n; ++i) scanf("%d", t + i), t[i] *= 2; ^ ./Main.cpp:11:62: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i = 1; i <= n; ++i) scanf("%d", v + i), v[i] *= 2; ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
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 | 256 KB |
in02.txt | AC | 1 ms | 256 KB |
in03.txt | AC | 1 ms | 256 KB |
in04.txt | AC | 1 ms | 256 KB |
in05.txt | AC | 1 ms | 384 KB |
in06.txt | AC | 1 ms | 384 KB |
in07.txt | AC | 1 ms | 384 KB |
in08.txt | AC | 1 ms | 384 KB |
in09.txt | AC | 1 ms | 384 KB |
in10.txt | AC | 1 ms | 256 KB |
in11.txt | AC | 1 ms | 384 KB |
in12.txt | AC | 1 ms | 256 KB |
in13.txt | AC | 1 ms | 256 KB |
in14.txt | AC | 1 ms | 256 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in17.txt | AC | 1 ms | 256 KB |
in18.txt | AC | 1 ms | 256 KB |
in19.txt | AC | 1 ms | 256 KB |
in20.txt | AC | 1 ms | 384 KB |
in21.txt | AC | 1 ms | 256 KB |
in22.txt | AC | 1 ms | 384 KB |
in23.txt | AC | 1 ms | 256 KB |
in24.txt | AC | 1 ms | 384 KB |
in25.txt | AC | 1 ms | 384 KB |
in26.txt | AC | 1 ms | 384 KB |
in27.txt | AC | 1 ms | 384 KB |
in28.txt | AC | 1 ms | 256 KB |
in29.txt | AC | 1 ms | 256 KB |
in30.txt | AC | 1 ms | 256 KB |
in31.txt | AC | 1 ms | 384 KB |
in32.txt | AC | 1 ms | 384 KB |
in33.txt | AC | 1 ms | 384 KB |
in34.txt | AC | 1 ms | 256 KB |
in35.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |
s5.txt | AC | 1 ms | 256 KB |