Submission #1474075


Source Code Expand

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <map>
#include <string>
#include <stack>
#include <cctype>
#include <vector>
#include <queue>
#include <set>
using namespace std;

int a[100500];

void init()
{

    return;
}

int main()
{
    int n;
    scanf("%d",&n);
    int MOD=1e9+7;
    long long ans;
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    int s,k;
    s=1;k=1;ans=1;
    for (int i=1;i<n;i++)
    {
        if ((a[i]<s)&& (i!=n)) {ans=ans*k % MOD;continue;}
        s=s+2;k=k+1;
    }
    //printf("%d %d\n",s,k);
    for (int i=1;i<=k;i++)
    {
        ans=ans*i % MOD;
    }
    printf("%d\n",(int) ans);
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:31:26: 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 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 640 KB
2_01.txt AC 11 ms 640 KB
2_02.txt AC 13 ms 640 KB
2_03.txt AC 11 ms 640 KB
2_04.txt AC 11 ms 640 KB
2_05.txt AC 11 ms 640 KB
2_06.txt AC 11 ms 640 KB
2_07.txt AC 11 ms 640 KB
2_08.txt AC 11 ms 640 KB
2_09.txt AC 11 ms 640 KB
2_10.txt AC 11 ms 640 KB
2_11.txt AC 13 ms 640 KB
2_12.txt AC 13 ms 640 KB