Submission #1455499
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }
template<int MOD>
struct ModInt {
static const int Mod = MOD;
unsigned x;
ModInt() : x(0) {}
ModInt(signed sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }
ModInt(signed long long sig) { int sigt = sig % MOD; if (sigt < 0) sigt += MOD; x = sigt; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const {
signed a = x, b = MOD, u = 1, v = 0;
while (b) {
signed t = a / b;
a -= t * b; std::swap(a, b);
u -= t * v; std::swap(u, v);
}
if (u < 0) u += MOD;
ModInt res; res.x = (unsigned)u;
return res;
}
};
template<int MOD>
ostream &operator << (ostream &os, const ModInt<MOD> &m) { return os << m.x; }
template<int MOD>
istream &operator >> (istream &is, ModInt<MOD> &m) { signed long long s; is >> s; m = ModInt<MOD>(s); return is; };
template<int MOD>
ModInt<MOD> pow(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1;
while (k) {
if (k & 1) r *= a;
a *= a;
k >>= 1;
}
return r;
}
using mint = ModInt<1000000007>;
vector<mint> fact, factinv;
void nCr_compute_factinv(int N) {
N = min(N, mint::Mod - 1);
fact.resize(N + 1); factinv.resize(N + 1);
fact[0] = 1;
rep(i, 1, N + 1) fact[i] = fact[i - 1] * i;
factinv[N] = fact[N].inverse();
for (int i = N; i >= 1; i--) factinv[i - 1] = factinv[i] * i;
}
mint nCr(int n, int r) {
if (n >= mint::Mod)
return nCr(n % mint::Mod, r % mint::Mod) * nCr(n / mint::Mod, r / mint::Mod);
return r > n ? 0 : fact[n] * factinv[n - r] * factinv[r];
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<int> T(N); rep(i, 0, N) {
cin >> T[i];
}
vector<int> A(N); rep(i, 0, N) {
cin >> A[i];
}
vector<bool> flag(N);
flag.front() = flag.back() = true;
mint ans = 1;
rep(i, 1, N) {
if (T[i - 1] < T[i]) {
flag[i] = true;
if (T[i] > A[i])
ans = 0;
}
else if (T[i - 1] > T[i])
ans = 0;
}
rep(i, 0, N - 1) {
if (A[i] > A[i + 1]) {
flag[i] = true;
if (T[i] < A[i])
ans = 0;
}
else if (A[i] < A[i + 1])
ans = 0;
}
rep(i, 0, N) {
if (flag[i])continue;
ans *= min(T[i], A[i]);
}
if (N == 1 && A[0] != T[0]) ans = 0;
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Two Alpinists |
User |
minaminao |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3470 Byte |
Status |
AC |
Exec Time |
22 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt |
All |
0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
1 ms |
256 KB |
0_001.txt |
AC |
1 ms |
256 KB |
0_002.txt |
AC |
1 ms |
256 KB |
0_003.txt |
AC |
1 ms |
256 KB |
1_004.txt |
AC |
1 ms |
256 KB |
1_005.txt |
AC |
1 ms |
256 KB |
1_006.txt |
AC |
1 ms |
256 KB |
1_007.txt |
AC |
1 ms |
256 KB |
1_008.txt |
AC |
22 ms |
1024 KB |
1_009.txt |
AC |
19 ms |
1024 KB |
1_010.txt |
AC |
21 ms |
1024 KB |
1_011.txt |
AC |
21 ms |
1024 KB |
1_012.txt |
AC |
21 ms |
1024 KB |
1_013.txt |
AC |
21 ms |
1024 KB |
1_014.txt |
AC |
21 ms |
1024 KB |
1_015.txt |
AC |
21 ms |
1024 KB |
1_016.txt |
AC |
21 ms |
1024 KB |
1_017.txt |
AC |
20 ms |
1024 KB |
1_018.txt |
AC |
20 ms |
1024 KB |
1_019.txt |
AC |
18 ms |
1024 KB |
1_020.txt |
AC |
18 ms |
1024 KB |