oj.uz

Submission #922045

# Submission time Handle Problem Language Result Execution time Memory
922045 2024-02-04T21:14:13 Z Alebn Fancy Fence (CEOI20_fancyfence) C++14
0 / 100
 1000 ms 348 KB 
#include <bits/stdc++.h>
#define int long long
 
using namespace std;
 
const int MOD = 1e9+7, INV = 250000002;
 
int mod(int n) {
    return (n + 3 * MOD) % MOD;
}
int f(int h, int w) {
	h%=MOD, w%=MOD;
	int facteur=mod((h*(h+1))/2);
	int ans=mod((w*(w+1))/2);
	return mod(ans*facteur);
}
 
signed main() {
    //input and sum
    int n;
    cin >> n;
    vector<int> h(n), w(n);
    for(int i = 0; i < n; i++) cin >> h[i];
    for(int i = 0; i < n; i++) cin >> w[i];
    //linearily go over and compute result
    int res = 0, temp;
    for(int i = 0; i < n; i++) {
        int minH = h[i], sumW = w[i];
        res = mod(res + f(minH, sumW));
        for(int j = i+1; j < n; j++) {
            minH = min(minH, h[i]), sumW = mod(sumW + w[j]);
            temp = f(minH, sumW);
            temp -= mod(f(minH, sumW - w[j]) + f(minH, sumW - w[i]));
            temp = mod(temp);
            temp += f(minH, sumW - w[i] - w[j]);
            res = mod(res + mod(temp));
        }
    }
    cout << res << "\n";
}

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 344 KB Output is correct
2 Execution timed out 1041 ms 344 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 14 ms 348 KB Output is correct
3 Execution timed out 1040 ms 344 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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