Submission #1688918
Source Code Expand
#include<bits/stdc++.h> #define vi vector<int> #define vvi vector<vector<int> > #define vl vector<ll> #define vvl vector<vector<ll>> #define vb vector<bool> #define vc vector<char> #define vs vector<string> using ll = long long; using ld =long double; #define int ll #define INF 1e9 #define EPS 0.0000000001 #define rep(i,n) for(int i=0;i<n;i++) #define loop(i,s,n) for(int i=s;i<n;i++) #define all(in) in.begin(), in.end() template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; } template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; } #define MAX 9999999 using namespace std; typedef pair<int, int> pii; typedef pair<int,pii> piii; signed main() { int n; cin>>n; vector<int>v(n); vector<int>u(n); rep(i,n)cin>>v[i]; rep(i,n)cin>>u[i]; vector<bool>def(n,false); if(v[n-1]!=u[0])return puts("0")*0; def[0]=def[n-1]=true; for(int i=0; i<n;i++){ if(i==0)continue; if(v[i-1]!=v[i]){ def[i]=true; if(u[i]<v[i])return puts("0")*0; } } for(int i=n-1; i>=0;i--){ if(i==n-1)continue; if(u[i]!=u[i+1]){ def[i]=true; if(u[i]<v[i])return puts("0")*0; } } int ans=1; int MOD=INF+7; for(int i=0;i<n;i++){ if(def[i])continue; ans*=min(v[i],u[i]); ans%=MOD; } cout<<ans%MOD<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Two Alpinists |
User | yebityon |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1456 Byte |
Status | WA |
Exec Time | 94 ms |
Memory | 1920 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 | WA | 1 ms | 256 KB |
1_008.txt | AC | 94 ms | 1792 KB |
1_009.txt | WA | 76 ms | 1792 KB |
1_010.txt | WA | 81 ms | 1792 KB |
1_011.txt | WA | 86 ms | 1792 KB |
1_012.txt | AC | 82 ms | 1792 KB |
1_013.txt | WA | 87 ms | 1792 KB |
1_014.txt | AC | 85 ms | 1792 KB |
1_015.txt | WA | 87 ms | 1792 KB |
1_016.txt | AC | 85 ms | 1792 KB |
1_017.txt | WA | 83 ms | 1792 KB |
1_018.txt | AC | 81 ms | 1792 KB |
1_019.txt | AC | 69 ms | 1792 KB |
1_020.txt | AC | 66 ms | 1920 KB |