oj.uz

답안 #777727

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777727 2023-07-09T14:23:09 Z groshi Fancy Fence (CEOI20_fancyfence) C++17
0 / 100
 1 ms 504 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
int mod=1e9+7;
int h[200000];
int w[200000];
int licz(int x,int y)
{
    x+=y;
    ///x*(x+1)/2-y*(y+1)/2
    int jeden=x*(x+1)/2;
    int dwa=y*(y+1)/2;
    jeden-=dwa;
    jeden%=mod;
    jeden+=mod*mod;
    jeden%=mod;
    return jeden;
}
int32_t main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int n;
    cin>>n;
    int wynik=0;
    vector<pair<int,int> > Q;
    for(int i=1;i<=n;i++)
        cin>>h[i];
    for(int i=1;i<=n;i++)
        cin>>w[i];
    for(int i=1;i<=n;i++)
    {
        int x=h[i];
        int y=w[i];
        int suma=0;
        while(Q.size() && Q.back().first>=x)
        {
            int cos1=(Q.back().first)*(Q.back().first+1);
            cos1/=2;
            cos1%=mod;
            int cos2=licz(Q.back().second,suma);
            cos1*=cos2;
            cos1%=mod;
            wynik+=cos1;
            wynik%=mod;
            suma+=Q.back().second;
            suma%=mod;
            Q.pop_back();
        }
        Q.push_back({x,(suma+y)%mod});
        //cout<<"wrzucam "<<x<<" "<<y<<"\n";
    }
    int suma=0;
    while(Q.size())
    {
        int cos1=(Q.back().first)*(Q.back().first+1);
        cos1/=2;
        cos1%=mod;
        //cout<<cos1<<"\n";
        int cos2=licz(Q.back().second,suma);
        cos1*=cos2;
        cos1%=mod;
        wynik+=cos1;
        //cout<<"dodaje "<<cos1<<"\n";
        wynik%=mod;
        suma+=Q.back().second;
        suma%=mod;
        Q.pop_back();
    }
    cout<<wynik;
    return 0;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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