oj.uz

Submission #303377

# Submission time Handle Problem Language Result Execution time Memory
303377 2020-09-20T09:16:30 Z BeanZ Fancy Fence (CEOI20_fancyfence) C++14
30 / 100
 34 ms 4728 KB 
// I_Love_LPL
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
ll h[N], w[N];
ll dp[N];
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("A.inp", "r")){
                freopen("test.inp", "r", stdin);
                freopen("test.out", "w", stdout);
        }
        ll n;
        cin >> n;
        ll ans = 0;
        for (int i = 1; i <= n; i++) cin >> h[i];
        for (int i = 1; i <= n; i++) cin >> w[i];
        ll sum = 0;
        for (int i = 1; i <= n; i++){
                dp[i] = (w[i] * (w[i] + 1) / 2) % mod * ((h[i] * (h[i] + 1) / 2) % mod) % mod;
                dp[i] = (dp[i] + sum * w[i]) % mod;
                ans = (ans + dp[i]) % mod;
                sum = (sum + ((h[i] * (h[i] + 1) / 2) % mod) * w[i] % mod) % mod;
                //cout << dp[i] << " " << sum << endl;
        }
        cout << ans;
}
/*
2
2 2
2 4
*/

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:16:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   16 |                 freopen("test.inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fancyfence.cpp:17:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   17 |                 freopen("test.out", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 13 ms 2432 KB Output is correct
4 Correct 26 ms 4600 KB Output is correct
5 Correct 28 ms 4728 KB Output is correct
6 Correct 1 ms 384 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 13 ms 1536 KB Output is correct
5 Correct 25 ms 2680 KB Output is correct
6 Correct 34 ms 2696 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 13 ms 1536 KB Output is correct
10 Correct 24 ms 2616 KB Output is correct
11 Correct 25 ms 2680 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct