Submission #1625664
Source Code Expand
#include <algorithm> #include <cassert> #include <cctype> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <queue> #include <random> #include <set> #include <sstream> #include <string> #include <utility> #include <vector> #define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++) using namespace std; typedef long long int ll; typedef vector<int> VI; typedef vector<ll> VL; typedef pair<int, int> PI; const ll mod = 1e9 + 7; int main(void) { int n; cin >> n; VI a(n); REP(i, 0, n) { cin >> a[i]; } ll prod = 1; int pos = 0; REP(i, 0, n) { if (a[i] < 2 * pos + 1) { // solve cut prod = prod * ll(pos + 1) % mod; } else { pos += 1; } } REP(i, 1, pos + 1) { prod = prod * i % mod; } cout << prod << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | kobae964 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 907 Byte |
Status | AC |
Exec Time | 41 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | 400 / 400 | ||||||
Status |
|
|
|
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 | 30 ms | 640 KB |
2_01.txt | AC | 31 ms | 640 KB |
2_02.txt | AC | 41 ms | 640 KB |
2_03.txt | AC | 30 ms | 640 KB |
2_04.txt | AC | 30 ms | 640 KB |
2_05.txt | AC | 31 ms | 640 KB |
2_06.txt | AC | 31 ms | 640 KB |
2_07.txt | AC | 31 ms | 640 KB |
2_08.txt | AC | 30 ms | 640 KB |
2_09.txt | AC | 30 ms | 640 KB |
2_10.txt | AC | 31 ms | 640 KB |
2_11.txt | AC | 40 ms | 640 KB |
2_12.txt | AC | 40 ms | 640 KB |