Submission #1131529


Source Code Expand

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const ld TAU=2*acos(-1);
const ld eps=1e-7;
const int inf=1e9+99;
const ll linf=1e18+88;
const int P=1e9+7;




int32_t main() {
	ll Z=1;
	int n; scanf("%d",&n);
	int ct=0;
	for(;n--;) {
		int x; scanf("%d",&x);
		++ct;
		if(x<=ct*2-2) Z=Z*ct%P, --ct;
		// cerr<<"got "<<x<<" curans "<<Z<<" and ct "<<ct<<endl;
	}
	for(;ct;) Z=Z*ct--%P;
	cout<<Z<<endl;
}


Submission Info

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

Compile Error

./Main.cpp: In function ‘int32_t main()’:
./Main.cpp:23:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int n; scanf("%d",&n);
                       ^
./Main.cpp:26:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int x; scanf("%d",&x);
                        ^

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 256 KB
2_01.txt AC 11 ms 256 KB
2_02.txt AC 13 ms 256 KB
2_03.txt AC 11 ms 256 KB
2_04.txt AC 11 ms 256 KB
2_05.txt AC 11 ms 256 KB
2_06.txt AC 11 ms 256 KB
2_07.txt AC 11 ms 256 KB
2_08.txt AC 11 ms 256 KB
2_09.txt AC 11 ms 256 KB
2_10.txt AC 11 ms 256 KB
2_11.txt AC 12 ms 256 KB
2_12.txt AC 12 ms 256 KB