oj.uz

Submission #881454

# Submission time Handle Problem Language Result Execution time Memory
881454 2023-12-01T09:03:30 Z Danet Fancy Fence (CEOI20_fancyfence) C++14
100 / 100
 89 ms 6032 KB 
#include<bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")

#define tof_io  ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double  long double
#define int     long long
#define pb      push_back
#define all(x)  x.begin(),x.end()
#define endl    '\n'

const int mod = 1e9+7; //998244353
const long long inf = 1e18;
const int N = 1e3 + 23;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int modplus(int x) {if (x >= mod) {x -= mod;} else if (x < 0) {x += mod;}return x;} 
int nc2(int x){x = x * (x+1);return x;}
vector<pair<int, int>> s;
vector<int> h;
vector<int> ps;
int ans = 0;
int res = 0;
void sl(int i)
{
    while (s.back().first >= h[i]) 
    {
        int x = (s.back().second - s[s.size() - 2ll].second) % mod;
        res = modplus(res - x * (nc2(s.back().first) / 2 % mod) % mod);
        s.pop_back();
    }
}
int32_t main() 
{
    int n;
    cin >> n;

    h.pb(0);
    ps.pb(0);
    for (int i = 1; i <= n; i++) 
    {
        int x;
        cin >> x;
        h.pb(x);
    }
    for (int i = 1; i <= n; i++) 
    {
        int x;
        cin >> x;
        ps.pb(x + ps[i-1]);
    }
    s.pb(make_pair(0ll,0ll));
    for (int i = 1; i <= n; i++) 
    {
        sl(i);
        if (s.back().second != ps[i-1]) 
        {
            int x = (ps[i - 1] - s.back().second) % mod;
            res = modplus(res + x * (nc2(h[i]) / 2 % mod) % mod);
            s.pb(make_pair(h[i], ps[i - 1]));
        }
        int x = (ps[i] - ps[i - 1]) % mod;
        ans = modplus(ans + res % mod * x % mod);
        ans = modplus(ans + (nc2(x) % nc2(mod)/2 % mod) * (nc2(h[i]) % nc2(mod)/2 % mod) % mod);
        res = modplus(res + (nc2(h[i]) / 2 % mod) * x % mod);
        s.pb(make_pair(h[i], ps[i]));
    }
    cout << ans;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 23 ms 2004 KB Output is correct
4 Correct 45 ms 3536 KB Output is correct
5 Correct 50 ms 3524 KB Output is correct
6 Correct 44 ms 3536 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 7 ms 860 KB Output is correct
3 Correct 31 ms 2448 KB Output is correct
4 Correct 61 ms 4504 KB Output is correct
5 Correct 63 ms 4464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 7 ms 856 KB Output is correct
4 Correct 30 ms 2572 KB Output is correct
5 Correct 60 ms 4488 KB Output is correct
6 Correct 62 ms 4472 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 6 ms 1104 KB Output is correct
9 Correct 30 ms 2896 KB Output is correct
10 Correct 57 ms 5836 KB Output is correct
11 Correct 69 ms 6032 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 22 ms 2004 KB Output is correct
12 Correct 45 ms 3528 KB Output is correct
13 Correct 44 ms 3520 KB Output is correct
14 Correct 44 ms 3676 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 7 ms 848 KB Output is correct
17 Correct 38 ms 2508 KB Output is correct
18 Correct 89 ms 4468 KB Output is correct
19 Correct 62 ms 4552 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 6 ms 1116 KB Output is correct
22 Correct 31 ms 2944 KB Output is correct
23 Correct 76 ms 5840 KB Output is correct
24 Correct 65 ms 5912 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 452 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 7 ms 856 KB Output is correct
31 Correct 6 ms 860 KB Output is correct
32 Correct 29 ms 2296 KB Output is correct
33 Correct 30 ms 2512 KB Output is correct
34 Correct 64 ms 4548 KB Output is correct
35 Correct 57 ms 4296 KB Output is correct
36 Correct 60 ms 4296 KB Output is correct
37 Correct 61 ms 4304 KB Output is correct
38 Correct 0 ms 500 KB Output is correct
39 Correct 61 ms 4328 KB Output is correct
40 Correct 71 ms 4716 KB Output is correct
41 Correct 69 ms 4344 KB Output is correct
42 Correct 60 ms 5388 KB Output is correct