oj.uz

Submission #746038

# Submission time Handle Problem Language Result Execution time Memory
746038 2023-05-21T10:43:06 Z vjudge1 Fancy Fence (CEOI20_fancyfence) C++17
28 / 100
 98 ms 3664 KB 
#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1e9+7;

int main(){
//idk
    long long n; cin >> n;
    long long x;
    long long ans = 0;
    bool b = true;
    vector<long long> w, h, comp;
    long long wsum = 0;
    for(long long i = 0; i < n; i++){
        cin >> x;
        h.push_back(x);
        if (x != 1 && x != 2) b = false;
    }
    for(long long i = 0; i < n; i++){
        cin >> x;
        wsum += x;
        wsum = wsum % MOD;
        w.push_back(x);
    }
if(b){
    for(long long i = 0; i < n; i++){
        if(h[i] == 2){
            if(i == 0) comp.push_back(w[i]);
            else if(h[i-1] == 2) comp.back() += w[i];
            else comp.push_back(w[i]);
        }
    }

    for(long long k : comp) {
        k = k % MOD;
        ans += k*(k+1);
        ans = ans % MOD;
    }


    ans += wsum*(wsum+1)/2;
    ans = ans % MOD;

    cout << ans;}
else{
    ans = wsum * (wsum+1);
    ans = ans%1000000007;
    ans *= h[0];
    ans = ans%1000000007;
    ans *= (h[0]+1);
    ans = ans%1000000007;
    while(ans % 4 != 0){
        ans += 1000000007;
    }
    ans /= 4;
    cout << ans;
}
}

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 34 ms 2024 KB Output is correct
4 Correct 59 ms 3520 KB Output is correct
5 Correct 52 ms 3584 KB Output is correct
6 Correct 55 ms 3520 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 8 ms 724 KB Output is correct
3 Correct 40 ms 2400 KB Output is correct
4 Correct 74 ms 3664 KB Output is correct
5 Correct 75 ms 3544 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 9 ms 724 KB Output is correct
4 Correct 43 ms 1956 KB Output is correct
5 Correct 98 ms 2936 KB Output is correct
6 Correct 77 ms 2748 KB Output is correct
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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