Submission #1131256


Source Code Expand

#include <cstdio>
using namespace std;
constexpr int mod = 1000000007;
int a[100000];
int main() {
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
        scanf("%d", a + i);
    int ans = 1;
    for(int i = 0, j = 0; i < n; i++) {
        while(j + 1 < n && a[j] >= 2 * (j - i) + 1)
            j++;
        // fprintf(stderr, "j=%d i=%d\n", j, i);
        ans = 1LL * ans * (j - i + 1) % mod;
    }
    printf("%d\n", ans);
}

Submission Info

Submission Time
Task A - Robot Racing
User johnchen902
Language C++14 (GCC 5.4.1)
Score 900
Code Size 461 Byte
Status AC
Exec Time 12 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:9:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", a + 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 128 KB
0_01.txt AC 1 ms 128 KB
0_02.txt AC 0 ms 128 KB
0_03.txt AC 0 ms 128 KB
1_00.txt AC 1 ms 128 KB
1_01.txt AC 0 ms 128 KB
1_02.txt AC 1 ms 128 KB
1_03.txt AC 1 ms 128 KB
1_04.txt AC 0 ms 128 KB
1_05.txt AC 1 ms 128 KB
1_06.txt AC 0 ms 128 KB
1_07.txt AC 1 ms 128 KB
1_08.txt AC 1 ms 128 KB
1_09.txt AC 1 ms 128 KB
1_10.txt AC 0 ms 128 KB
2_00.txt AC 10 ms 512 KB
2_01.txt AC 10 ms 512 KB
2_02.txt AC 12 ms 512 KB
2_03.txt AC 10 ms 512 KB
2_04.txt AC 10 ms 512 KB
2_05.txt AC 10 ms 512 KB
2_06.txt AC 10 ms 512 KB
2_07.txt AC 10 ms 512 KB
2_08.txt AC 10 ms 512 KB
2_09.txt AC 10 ms 512 KB
2_10.txt AC 10 ms 512 KB
2_11.txt AC 12 ms 512 KB
2_12.txt AC 12 ms 512 KB