# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
628687 | 2022-08-13T15:25:13 Z | a_aguilo | Fancy Fence (CEOI20_fancyfence) | C++14 | 96 ms | 476 KB |
#include<bits/stdc++.h> using namespace std; int MOD = 1e9 + 7; int main(){ int n, h, w; cin >> n; long long int H = 0; for(int i = 0; i < n; ++i){ cin >> H; } long long int W = 0; for(int i = 0; i < n; ++i){ cin >> w; W += w; W%=MOD; } long long chooseh = (H*(H+1)/2)%MOD; long long choosew = (W*(W+1)/2)%MOD; cout << (chooseh*choosew)%MOD << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | 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 | 2 ms | 296 KB | Output is correct |
2 | Correct | 9 ms | 420 KB | Output is correct |
3 | Correct | 45 ms | 332 KB | Output is correct |
4 | Correct | 96 ms | 476 KB | Output is correct |
5 | Correct | 93 ms | 400 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
# | 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 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |