oj.uz

Submission #921466

# Submission time Handle Problem Language Result Execution time Memory
921466 2024-02-03T22:51:12 Z Alebn Fancy Fence (CEOI20_fancyfence) C++14
15 / 100
 61 ms 3924 KB 
#include <bits/stdc++.h>
#define int long long
 
using namespace std;
 
const int MOD = 1e9+7, INV = 250000002;
 
int calc(int n, int m) {
    return n*m%MOD*(n+1)%MOD*(m+1)%MOD*INV%MOD;
}
 
signed main() {
    int n;
    cin >> n;
    vector<int> h(n), w(n);
    int sum = 0;
    for(int i = 0; i < n; i++) cin >> h[i];
    for(int i = 0; i < n; i++) {
        cin >> w[i];
        sum = (sum + w[i]) % MOD;
    }
    cout << calc(h[0], sum) << "\n";
}

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 6 ms 604 KB Output is correct
3 Correct 42 ms 2132 KB Output is correct
4 Correct 57 ms 3780 KB Output is correct
5 Correct 61 ms 3924 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -