提出 #1720624


ソースコード 拡げる

#include <bits/stdc++.h>

#define fst first
#define snd second
#define INF 0x3FFFFFFF
#define PI (2*acos(0))

using namespace std;

typedef long long ll;
typedef complex<double> pt;

int v[100];
int t[100];
int speed[20001];
int limit[20001];
int sum;

void fix(int idx) {
  if (idx > 0 && speed[idx] + 1 < speed[idx - 1]) {
    speed[idx - 1] = speed[idx] + 1;
    fix(idx - 1);
  }
  if (idx < sum && speed[idx] + 1 < speed[idx + 1]) {
    speed[idx + 1] = speed[idx] + 1;
    fix(idx + 1);
  }
}

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &t[i]);
    sum += t[i];
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &v[i]);
  }
  
  limit[0] = 1000;
  int idx = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= t[i]; j++) {
      if (j == 0) {
        limit[idx] = v[i];
        speed[idx] = min(v[i], speed[idx]);
      } else {
        limit[idx] = v[i];
        speed[idx] = v[i];
      }
      idx++;
    }
    idx--;
  }
  speed[0] = 0;
  speed[sum] = 0;
  for (int i = 0; i <= sum; i++) {
    fix(i);
  }

  // for (int i = 0; i <= sum; i++) {
  //   cout << i << ":" << speed[i] << ":" << limit[i] << " ";
  // }
  // cout << endl;

  double res = 0;
  for (int i = 0; i < sum; i++) {
    res += speed[i];
    if (speed[i] < speed[i + 1] && limit[i] > speed[i]) res += 0.5;
    if (speed[i] == speed[i + 1] && limit[i] > speed[i]) res += 0.25;
    if (speed[i] > speed[i + 1]) res -= 0.5;
    // cout << res << endl;
  }
  printf("%.10lf\n", res);
  return 0;
}

提出情報

提出日時
問題 D - AtCoder Express
ユーザ pauljgblt
言語 C++14 (GCC 5.4.1)
得点 400
コード長 1607 Byte
結果 AC
実行時間 1 ms
メモリ 384 KiB

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
                  ^
./Main.cpp:34:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &t[i]);
                       ^
./Main.cpp:38:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &v[i]);
                       ^

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 5
AC × 40
セット名 テストケース
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
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 256 KiB
in02.txt AC 1 ms 256 KiB
in03.txt AC 1 ms 256 KiB
in04.txt AC 1 ms 256 KiB
in05.txt AC 1 ms 384 KiB
in06.txt AC 1 ms 384 KiB
in07.txt AC 1 ms 384 KiB
in08.txt AC 1 ms 384 KiB
in09.txt AC 1 ms 384 KiB
in10.txt AC 1 ms 384 KiB
in11.txt AC 1 ms 384 KiB
in12.txt AC 1 ms 256 KiB
in13.txt AC 1 ms 256 KiB
in14.txt AC 1 ms 256 KiB
in15.txt AC 1 ms 256 KiB
in16.txt AC 1 ms 256 KiB
in17.txt AC 1 ms 256 KiB
in18.txt AC 1 ms 256 KiB
in19.txt AC 1 ms 256 KiB
in20.txt AC 1 ms 384 KiB
in21.txt AC 1 ms 384 KiB
in22.txt AC 1 ms 384 KiB
in23.txt AC 1 ms 256 KiB
in24.txt AC 1 ms 384 KiB
in25.txt AC 1 ms 384 KiB
in26.txt AC 1 ms 384 KiB
in27.txt AC 1 ms 384 KiB
in28.txt AC 1 ms 256 KiB
in29.txt AC 1 ms 256 KiB
in30.txt AC 1 ms 256 KiB
in31.txt AC 1 ms 384 KiB
in32.txt AC 1 ms 384 KiB
in33.txt AC 1 ms 384 KiB
in34.txt AC 1 ms 256 KiB
in35.txt AC 1 ms 256 KiB
s1.txt AC 1 ms 256 KiB
s2.txt AC 1 ms 256 KiB
s3.txt AC 1 ms 256 KiB
s4.txt AC 1 ms 256 KiB
s5.txt AC 1 ms 256 KiB