Submission #1455403


Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

long long int power(long long int x, long long int n, long long int M) {
	long long int tmp = 1;

	if (n > 0) {
		tmp = power(x, n / 2, M);
		if (n % 2 == 0) tmp = (tmp*tmp) % M;
		else tmp = (((tmp*tmp) % M)*x) % M;
	}
	return tmp;
}

long long int N, M, K, Q, W, H, L, R;
long long int ans;



int main() {
	ios::sync_with_stdio(false);
	cin >> N;
	int mi[100000] = {};
	int ma[100000] = {};
	int t=0;
	for (int i = 0; i < N; i++) {
		int a;
		cin >> a;
		if (a > t) {
			t = a;
			mi[i] = a;
			ma[i] = a;
		}
		else {
			mi[i] = 1;
			ma[i] = t;
		}
	}
	t = 0;
	int num[100001] = {};
	for (int i = 0; i < N; i++)cin >> num[i];
	for (int i = N-1; i >=0; i--) {
		int a = num[i];
		if (a > t) {
			t = a;
			mi[i] = max(mi[i], a);
			ma[i] = min(ma[i], a);
		}
		else {
			mi[i] = max(mi[i], 1);
			ma[i] = min(ma[i], t);
		}
	}
	ans = 1;
	for (int i = 0; i < N; i++) {
	//	cout << ma[i] << " " << mi[i] << endl;
		ans *= (ma[i] - mi[i] + 1);
		ans %= MOD;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Two Alpinists
User olphe
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1417 Byte
Status WA
Exec Time 23 ms
Memory 1408 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 14
WA × 7
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 2 ms 1408 KB
0_001.txt AC 1 ms 1408 KB
0_002.txt AC 1 ms 1408 KB
0_003.txt AC 1 ms 1408 KB
1_004.txt AC 1 ms 1408 KB
1_005.txt WA 1 ms 1408 KB
1_006.txt WA 1 ms 1408 KB
1_007.txt AC 1 ms 1408 KB
1_008.txt AC 23 ms 1408 KB
1_009.txt AC 20 ms 1408 KB
1_010.txt AC 21 ms 1408 KB
1_011.txt AC 22 ms 1408 KB
1_012.txt WA 22 ms 1408 KB
1_013.txt AC 22 ms 1408 KB
1_014.txt WA 22 ms 1408 KB
1_015.txt AC 22 ms 1408 KB
1_016.txt WA 22 ms 1408 KB
1_017.txt AC 21 ms 1408 KB
1_018.txt WA 21 ms 1408 KB
1_019.txt AC 19 ms 1408 KB
1_020.txt WA 18 ms 1408 KB