Submission #8735444
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define REPP(i,a,b,c) for(int i=a; i<=b; i+=c)
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,c) for(int i=a; i>=b; i-=c)
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) REP(i,0,(int)a-1)
#define FORD(i,a) REV(i,(int)a-1,0)
#define PB push_back
#define POB pop_back
#define FI first
#define SE second
#define MP make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef pair < int , int > pii;
typedef vector < int > vi;
typedef vector < pii > vii;
typedef vector < ll > vl;
typedef pair < ll , ll > pll;
const double PI = acos(-1);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
ll addMod(ll a, ll b){
if(a + b >= MOD) return a + b - MOD;
return a + b;
}
ll mulMod(ll a, ll b){
return (a*b)%MOD;
}
ll fast(ll a, ll b){
if(b == 0) return 1;
ll tmp = fast(a,b/2);
tmp = mulMod(tmp,tmp);
if(b%2 == 1) tmp = mulMod(tmp,a);
return tmp;
}
ll GCD(ll a, ll b){
if(a > b) return GCD(b,a);
if(a == 0) return b;
return GCD(b%a,a);
}
#define getc getchar
template<typename T>
T getnum(){
int sign = 1;
T ret = 0;
char c;
do{
c = getc();
}while(c == ' ' || c == '\n');
if(c == '-')sign = -1;
else ret = c-'0';
while(1){
c = getc();
if(c < '0' || c > '9')break;
ret = 10*ret + c-'0';
}
return sign * ret;
}
inline void ini(int& x){
x = getnum<int>();
}
//////////////////////////////////////////////
const int N = 1e5;
int arr[N + 5];
int cnt[N + 5];
int main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
REP(i,1,n) cin >> arr[i];
ll ans = 1;
int cnt0 = 0;
REP(i,1,n){
if(arr[i] > 0){
ans = mulMod(ans,cnt[arr[i]-1]);
cnt[arr[i]-1]--;
}
else ans = mulMod(ans,3-cnt0), cnt0++;
cnt[arr[i]]++;
}
cout << ans << endl;
return 0;
}
Submission Info
| Submission Time |
|
| Task |
E - Colorful Hats 2 |
| User |
ekeitaro |
| Language |
C++14 (GCC 5.4.1) |
| Score |
500 |
| Code Size |
1899 Byte |
| Status |
AC |
| Exec Time |
10 ms |
| Memory |
1024 KiB |
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
500 / 500 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
| All |
in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in59.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, sample_01.txt, sample_02.txt, sample_03.txt |
| Case Name |
Status |
Exec Time |
Memory |
| in01.txt |
AC |
1 ms |
256 KiB |
| in02.txt |
AC |
10 ms |
1024 KiB |
| in03.txt |
AC |
1 ms |
256 KiB |
| in04.txt |
AC |
1 ms |
256 KiB |
| in05.txt |
AC |
9 ms |
768 KiB |
| in06.txt |
AC |
9 ms |
768 KiB |
| in07.txt |
AC |
9 ms |
768 KiB |
| in08.txt |
AC |
9 ms |
768 KiB |
| in09.txt |
AC |
1 ms |
256 KiB |
| in10.txt |
AC |
9 ms |
640 KiB |
| in11.txt |
AC |
1 ms |
256 KiB |
| in12.txt |
AC |
1 ms |
256 KiB |
| in13.txt |
AC |
9 ms |
768 KiB |
| in14.txt |
AC |
9 ms |
768 KiB |
| in15.txt |
AC |
9 ms |
1024 KiB |
| in16.txt |
AC |
9 ms |
896 KiB |
| in17.txt |
AC |
9 ms |
768 KiB |
| in18.txt |
AC |
8 ms |
640 KiB |
| in19.txt |
AC |
1 ms |
256 KiB |
| in20.txt |
AC |
1 ms |
256 KiB |
| in21.txt |
AC |
2 ms |
384 KiB |
| in22.txt |
AC |
9 ms |
768 KiB |
| in23.txt |
AC |
9 ms |
768 KiB |
| in24.txt |
AC |
9 ms |
768 KiB |
| in59.txt |
AC |
1 ms |
256 KiB |
| in61.txt |
AC |
1 ms |
256 KiB |
| in62.txt |
AC |
1 ms |
256 KiB |
| in63.txt |
AC |
1 ms |
256 KiB |
| in64.txt |
AC |
1 ms |
256 KiB |
| in65.txt |
AC |
1 ms |
256 KiB |
| in66.txt |
AC |
1 ms |
256 KiB |
| sample_01.txt |
AC |
1 ms |
256 KiB |
| sample_02.txt |
AC |
1 ms |
256 KiB |
| sample_03.txt |
AC |
1 ms |
256 KiB |