oj.uz

답안 #901487

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901487 2024-01-09T13:03:08 Z karamkallasi Fancy Fence (CEOI20_fancyfence) C++14
15 / 100
 28 ms 55916 KB 
#include <bits/stdc++.h>
#define T ll tt ; cin>>tt ; while(tt--)
#define fast ios::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define endl '\n'
#define yes void (cout << "YES" << endl)
#define no void (cout << "NO" << endl)
#define pb push_back
#define F first
#define S second
#define ld long double
#define fixed(g) fixed<<setprecision(g)
#define ll long long
using namespace std;
const ll N = 2e6 + 9 ;
const ll oo = 1e9 + 7 ;
ll n , m , k , x , y , z , g , gg , ans , sum , sum2 , cnt , dis[N] ,  sz , mn , a[N] , b[N] , last ;
bool ff , vis[N] ;
vector<pair<ll , ll> >v[N] ;
int main(){
fast
    sum = 0 ;
    cin >> n ;
    for(ll i=0 ; i<n ; i++)cin >> a[i] ;
    for(ll i=0 ; i<n ; i++){
        cin >> b[i] ;
        sum +=b[i];
        sum %=oo;
    }
    a[n] = -1 , b[n] = -1 , last = 0 ;
    for(ll i=0 ; i<n ; i++){
        if(a[i]==a[i+1]){
            x +=b[i] ;
            x %=oo;
        }
        else {
        //        cout<<sum<<' '<<x<<' '<<a[i]<<endl;
            x +=b[i] ;
            x %=oo;
            sum%=oo;
            y = sum*(sum+1) ;
            z = a[i]*(a[i]+1);
            g = y ;
            gg = last*(last+1) ;
            y/=2;//6
            z/=2;//3
            g/=2;//6
            gg/=2;//1
            y%=oo;
            z%=oo;
            g%=oo;
            gg%=oo;
      //  cout<<ans<<' '<<z<<'*'<<y<<endl;
            ans += z * y ;
            ans -= g * gg;
            ans%=oo;
            x%=oo;
            sum%=oo;
            sum -= x ;
            x = 0 , y = 0 , z = 0 , g=0 , gg=0;
            last = a[i];
        }
    }
    cout << ans << endl ;
return 0 ;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 51804 KB Output is correct
2 Correct 12 ms 52140 KB Output is correct
3 Correct 19 ms 52696 KB Output is correct
4 Correct 26 ms 55916 KB Output is correct
5 Correct 26 ms 55888 KB Output is correct
6 Correct 11 ms 51804 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 51800 KB Output is correct
2 Correct 12 ms 51804 KB Output is correct
3 Correct 14 ms 52060 KB Output is correct
4 Correct 19 ms 52828 KB Output is correct
5 Correct 28 ms 55896 KB Output is correct
6 Correct 27 ms 55888 KB Output is correct
7 Incorrect 11 ms 51804 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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