oj.uz

Submission #900640

# Submission time Handle Problem Language Result Execution time Memory
900640 2024-01-08T18:27:12 Z karamkallasi Fancy Fence (CEOI20_fancyfence) C++17
0 / 100
 15 ms 51944 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 , ans , sum , sum2 , cnt , dis[N] ,  sz , mn , a[N] , b[N] ;
bool ff , vis[N] ;
queue<pair<ll , ll> >q;
set<pair<ll , ll> >st;
vector<pair<ll , ll> >v[N] ;
int main(){
fast
    cin >> n ;
    for(ll i=0 ; i<n ; i++)cin >> a[i] ;
    for(ll i=0 ; i<n ; i++)cin >> b[i] ;
    for(ll i=0 ; i<n ; i++){
        sum +=b[i];
    }
    for(ll i=0 ; i<n ; i++){
        if(a[i]==2){
            x +=b[i] ;
            x %= oo ;
        }
        else {
            g =  ( x * (x+1) ) % oo ;
            ans+= g ;
            x = 0 ;
        }
    }
    if(x){
        g = ( x * (x+1) ) % oo ;
        ans+= g ;
    }
  //  cout << ans <<' '<<sum << ' ';
    g = ( sum * (sum+1) ) % oo ;
    g /= 2;
    cout << ans + g << endl ;
return 0 ;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 51800 KB Output is correct
2 Incorrect 13 ms 51804 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 51800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 51804 KB Output is correct
2 Incorrect 12 ms 51804 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 51800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 51804 KB Output is correct
2 Incorrect 11 ms 51892 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 51804 KB Output is correct
2 Incorrect 12 ms 51944 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 51800 KB Output is correct
2 Incorrect 13 ms 51804 KB Output isn't correct
3 Halted 0 ms 0 KB -