Submission #1229703
Source Code Expand
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
int a[100010], b[100010];
signed main() {
int n; cin >> n;
rep(i,0,n) cin >> a[i];
rep(i,0,n) cin >> b[i];
int ans = 1;
rep(i,0,n) {
bool fla = false, flb = false;
if(i == 0 || a[i-1] < a[i]) fla = true;
if(i == n-1 || b[i] > b[i+1]) flb = true;
if(fla && flb) {if(a[i] != b[i]) ans *= 0;}
else if(fla) {if(a[i] > b[i]) ans *= 0;}
else if(flb) {if(a[i] < b[i]) ans *= 0;}
else ans = mmul(ans, min(a[i], b[i]));
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Two Alpinists |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
2312 Byte |
Status |
AC |
Exec Time |
87 ms |
Memory |
1792 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 |
87 ms |
1792 KB |
1_009.txt |
AC |
70 ms |
1792 KB |
1_010.txt |
AC |
75 ms |
1792 KB |
1_011.txt |
AC |
79 ms |
1792 KB |
1_012.txt |
AC |
76 ms |
1792 KB |
1_013.txt |
AC |
78 ms |
1792 KB |
1_014.txt |
AC |
78 ms |
1792 KB |
1_015.txt |
AC |
79 ms |
1792 KB |
1_016.txt |
AC |
80 ms |
1792 KB |
1_017.txt |
AC |
73 ms |
1792 KB |
1_018.txt |
AC |
71 ms |
1792 KB |
1_019.txt |
AC |
62 ms |
1792 KB |
1_020.txt |
AC |
59 ms |
1792 KB |