oj.uz

Submission #491878

# Submission time Handle Problem Language Result Execution time Memory
491878 2021-12-04T21:46:30 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++14
0 / 100
 1000 ms 3432 KB 
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;

stack <pair<int,int>> S;
int n,v[100005],i,dr[100005],st[100005],x,j,val,Max;
unsigned long long suma[100001],total;
pair <int,int > sor[100005];


long long bin(long long x){
	x %= mod;
    return ((x*(x+1))/2)%mod;
}
long long rectCount(long long x, long long y){
    return (bin(x)*bin(y))%mod;
}


int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(i=1;i<=n;i++){
    cin>>v[i];
    sor[i].first = v[i];
    sor[i].second = i;
    dr[i] = n + 1;
}
sort(sor+1,sor+n+1);
for(i=1;i<=n;i++){
    cin>>x;
    suma[i] = suma[i-1] + x;
}
for(i=1;i<=n;i++){
    x = v[i];
    while(S.empty() == false && x<S.top().first){
        dr[S.top().second] = i;
        S.pop();
    }
    S.push({x,i});
}
while(S.empty() == false){
    S.pop();
}
for(i=n;i>=1;i--){
    x = v[i];
    while(S.empty() == false && x < S.top().first){
        st[S.top().second] = i;
        S.pop();
    }
    S.push({x,i});
}
for(i=1;i<=n;i++){
    total += rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i].first) % mod;
    for(j=1;j<=i-1;j++){
        if(st[sor[j].second] <= i && dr[sor[j].second] >= i)
            Max = sor[j].first;
    }
    total -= rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],Max) % mod;
}
cout << total % mod;
    return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 2 ms 332 KB Output isn't correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 40 ms 588 KB Output is correct
3 Correct 989 ms 1916 KB Output is correct
4 Execution timed out 1086 ms 3404 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 44 ms 588 KB Output is correct
4 Correct 988 ms 1916 KB Output is correct
5 Execution timed out 1094 ms 3432 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 2 ms 368 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 332 KB Output is correct
2 Incorrect 2 ms 332 KB Output isn't correct