# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
854893 | anhphant | Fancy Fence (CEOI20_fancyfence) | C++14 | 1038 ms | 8284 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, H[500007], W[500007];
void initialize() {
ios_base :: sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen("FILE.INP", "r")) {
freopen("FILE.INP", "r", stdin);
freopen("FILE.OUT", "w", stdout);
}
cin >> N;
for(int i = 1; i <= N; ++i) cin >> H[i];
for(int i = 1; i <= N; ++i) cin >> W[i];
cerr << ".";
}
namespace subtask1 {
ll A[57][57];
void solve() {
for(int i = 1; i <= N; ++i) {
for(int j = 1; j <= H[i]; ++j) {
A[i][j] = 1;
}
}
for(int i = 1; i <= N; ++i) {
for(int j = 1; j <= N; ++j) {
A[i][j] = A[i][j - 1] + A[i - 1][j] + A[i][j] - A[i - 1][j - 1];
}
}
ll ans = 0;
for(int i = 1; i <= N; ++i) {
for(int j = 1; j <= N; ++j) {
for(int k = i; k <= N; ++k) {
for(int l = j; l <= N; ++l) {
ans += (A[k][l] - A[i - 1][l] - A[k][j - 1] + A[i - 1][j - 1])
== ((k - i + 1) * (l - j + 1));
}
}
}
}
cout << ans;
}
void process() {
solve();
}
}
int main() {
initialize();
subtask1 :: process();
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |