oj.uz

답안 #900675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900675 2024-01-08T20:56:18 Z 3laa Fancy Fence (CEOI20_fancyfence) C++14
0 / 100
 1 ms 600 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
#include <unordered_map>
#define endl '\n'
#define mid ((l+r)/2)
#define  F first
#define  S second
#define pb push_back
#define yes void (cout<<"YES"<<endl)
#define no void (cout<<"NO"<<endl)
#define ump unordered_map <ll,ll>
#define sp " "
#define vll vector<ll>
#define vint vector<int>
#define pll pair<ll,ll>
typedef long long ll;
using namespace std;
const ll inf=1e18+9;
const ll M=1e9+7;
ll n;
ll h[100009];
ll w[100009];
int main(){
    cin>>n;
    for(ll i=0 ; i<n ; i++){
        cin>>h[i];
    }
    for(ll i=0 ; i<n ; i++){
        cin>>w[i];
    }
    ll ans=((n*(n+1))/2)%M;
    vector<pll> v;
    v.pb({h[0],1});
    for(ll i=1 ; i<n ; i++){
        if(h[i]==h[i-1]){
            v[v.size()-1].S++;
        }
        else
            v.pb({h[i],1});
    }
    for(auto it : v){
        //cout<<it.F<<sp<<it.S<<endl;
        if(it.F==1)continue;
        ll x=((it.S*(it.S+1))/2)%M;
        x=(x*2)%M;
        ans=(ans+x)%M;
    }
    cout<<ans<<endl;
}

Subtask #1
0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 15.0

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

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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