Submission #1131184


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define FORD(i,b,a) for (int i = (int)(b) - 1; i >= a; --i)
#define REP(i,N) FOR(i,0,N)
#define st first
#define nd second
#define pb push_back

typedef pair<int, int> PII;
typedef long long LL;

const int MOD = 1000000007;

int DP[111111]; // Najdluzszy
int X[111111];

int minp[111111];
int main() {
  int N;
  scanf("%d", &N);
  REP(i,N) scanf("%d", &X[i]);

  DP[0] = 1;
  FOR(i,1,N) DP[i] = min(DP[i-1] + 1, (X[i] + 1) / 2);

  int last = 1;
  LL res = 1;
  REP(i,N) {
    while (last < N && last - DP[last-1] <= i) ++last;
    res *= (last - i);
    res %= MOD;
  }
  printf("%lld\n", res);
}

Submission Info

Submission Time
Task A - Robot Racing
User voover
Language C++14 (GCC 5.4.1)
Score 900
Code Size 733 Byte
Status AC
Exec Time 13 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &N);
                  ^
./Main.cpp:23:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   REP(i,N) scanf("%d", &X[i]);
                              ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 500 / 500 400 / 400
Status
AC × 4
AC × 14
AC × 28
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
Subtask 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 1 ms 256 KB
2_00.txt AC 11 ms 1024 KB
2_01.txt AC 11 ms 1024 KB
2_02.txt AC 13 ms 1024 KB
2_03.txt AC 11 ms 1024 KB
2_04.txt AC 11 ms 1024 KB
2_05.txt AC 11 ms 1024 KB
2_06.txt AC 11 ms 1024 KB
2_07.txt AC 11 ms 1024 KB
2_08.txt AC 11 ms 1024 KB
2_09.txt AC 11 ms 1024 KB
2_10.txt AC 11 ms 1024 KB
2_11.txt AC 13 ms 1024 KB
2_12.txt AC 13 ms 1024 KB