# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745928 | 2023-05-21T09:43:41 Z | vjudge1 | Fancy Fence (CEOI20_fancyfence) | C++17 | 2 ms | 284 KB |
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; int x, e, hossz; int ans = 0; vector<int> w, h; int wsum = 0; for(int i = 0; i < n; i++){ cin >> x; h.push_back(x); } for(int i = 0; i < n; i++){ cin >> x; wsum += x; w.push_back(x); } hossz = (h[0]-1)*w[0]; for(int i = 1; i < n; i++){ if(h[i] == 2){ hossz += w[i]; } else if(h[i-1] == 2){ // cout << hossz << " "; ans += hossz*(hossz+1); ans = ans % 1000000007; hossz = 0; } } // cout << hossz << " "; ans += hossz*(hossz+1); ans = ans % 1000000007; ans += wsum*(wsum+1)/2; ans = ans % 1000000007; cout << ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 232 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 2 ms | 284 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |