| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1219470 | sleepntsheep | Flooding Wall (BOI24_wall) | C11 | 139 ms | 396 KiB | 
#include <stdio.h>
#define N 22 
int n, a[N], b[N], v[N], pmx[N], smx[N];
long long answer;
int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; ++i) scanf("%d", a + i);
	for (int i = 0; i < n; ++i) scanf("%d", b + i);
	for (int m = 0; m < (1 << n); ++m) {
		for (int i = 0; i < n; ++i)
			v[i] = (m >> i) & 1 ? a[i] : b[i];
		pmx[1] = v[0];
		for (int i = 1; i < n - 1; ++i)
			pmx[i + 1] = pmx[i] > v[i] ? pmx[i] : v[i];
		smx[n - 2] = v[n - 1];
		for (int i = n - 2; i >= 1; --i)
			smx[i - 1] = smx[i] > v[i] ? smx[i] : v[i];
		for (int i = 1; i < n - 1; ++i) {
			int y = pmx[i] < smx[i] ? pmx[i] : smx[i];
			if (y > v[i])
				answer = (answer + y - v[i]) % 1000000007;
		}
	} 
	printf("%lld\n", answer);
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
