oj.uz

답안 #1006934

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1006934 2024-06-24T10:00:06 Z Hanksburger Fancy Fence (CEOI20_fancyfence) C++17
27 / 100
 17 ms 2004 KB 
#include <bits/stdc++.h>
using namespace std;
long long h[100005], w[100005], mod=1e9+7, inv2=5e8+4;
vector<pair<long long, long long> > vec;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n, cur=0, ans=0;
    cin >> n;
    for (long long i=1; i<=n; i++)
        cin >> h[i];
    for (long long i=1; i<=n; i++)
        cin >> w[i];
    vec.push_back({-1, 0});
    vec.push_back({0, 0});
    for (long long i=1; i<=n+1; i++)
    {
        while (vec[vec.size()-2].first>=h[i])
        {
            long long x=(cur-vec[vec.size()-1].second+mod)%mod*(cur-vec[vec.size()-1].second+1+mod)%mod*inv2%mod;
            long long y=(vec[vec.size()-1].first+vec[vec.size()-2].first+1)%mod*(vec[vec.size()-1].first-vec[vec.size()-2].first+mod)%mod*inv2%mod;
            ans+=x*y%mod;
            vec.pop_back();
        }
        if (vec[vec.size()-1].first>h[i])
        {
            long long x=(cur-vec[vec.size()-1].second+mod)%mod*(cur-vec[vec.size()-1].second+1+mod)%mod*inv2%mod;
            long long y=(vec[vec.size()-1].first+h[i]+1)%mod*(vec[vec.size()-1].first-h[i]+mod)%mod*inv2%mod;
            ans+=x*y%mod;
            vec[vec.size()-1].first=h[i];
        }
        else
            vec.push_back({h[i], cur});
        cur=(cur+w[i])%mod;
    }
    cout << ans;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 348 KB Output is correct
5 Correct 0 ms 396 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 8 ms 1116 KB Output is correct
4 Correct 17 ms 2004 KB Output is correct
5 Correct 17 ms 1880 KB Output is correct
6 Correct 0 ms 344 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 8 ms 1112 KB Output is correct
5 Correct 16 ms 1884 KB Output is correct
6 Correct 16 ms 1880 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -