oj.uz

Submission #492058

# Submission time Handle Problem Language Result Execution time Memory
492058 2021-12-05T11:08:24 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++14
73 / 100
 1000 ms 6552 KB 
#include <bits/stdc++.h>
#define mod 1000000007

using namespace std;

stack <pair<long long,long long>> S;
int n,v[100005],i,dr[100005],st[100005],x,j,val,Max,nr,nr2;
long long suma[100001],total1,val1, val2,total2;
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];
    if(v[i] == v[i-1])
        nr++;
    if(v[i] >= v[i-1])
        nr2++;
    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});
}
if(nr != n - 1 && nr2 != n){
//brut
for(i=1;i<=n;i++){
    total1 += rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i].first) % mod;
    total1 = total1 % mod;
    for(j=i-1;j>=1;j--){
        if(st[sor[j].second] <= sor[i].second && dr[sor[j].second] >= sor[i].second){
            Max = sor[j].first;
            break;
        }
    }
    total2 += rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],Max) % mod;
    total2 = total2 % mod;
}
}
else if(nr2 == n){
    //subtask 5
for(i=1;i<=n;i++){
    total1 += rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i].first) % mod;
    total1 = total1 % mod;
    total2 += rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i-1].first) % mod;
    total2 = total2 % mod;
}
}
else{
    //subtask 4
    total1 = rectCount(suma[n],v[1]);
}
if(total1 < total2)
    total1 += mod;
cout << total1 - total2 << endl;
    return 0;
}

Subtask #1
0.0 / 0.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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct

Subtask #3
13.0 / 13.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 156 ms 2124 KB Output is correct
4 Correct 184 ms 4876 KB Output is correct
5 Correct 540 ms 4864 KB Output is correct
6 Correct 377 ms 4292 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 844 KB Output is correct
3 Correct 18 ms 2252 KB Output is correct
4 Correct 33 ms 4324 KB Output is correct
5 Correct 29 ms 4400 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 3 ms 844 KB Output is correct
4 Correct 16 ms 2252 KB Output is correct
5 Correct 33 ms 4184 KB Output is correct
6 Correct 32 ms 4308 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 3 ms 928 KB Output is correct
9 Correct 13 ms 2432 KB Output is correct
10 Correct 25 ms 4712 KB Output is correct
11 Correct 25 ms 4796 KB Output is correct
12 Correct 0 ms 332 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct

Subtask #7
0 / 27.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 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 148 ms 2124 KB Output is correct
12 Correct 166 ms 4868 KB Output is correct
13 Correct 544 ms 4860 KB Output is correct
14 Correct 311 ms 4300 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 844 KB Output is correct
17 Correct 14 ms 3252 KB Output is correct
18 Correct 29 ms 6164 KB Output is correct
19 Correct 30 ms 6336 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 3 ms 972 KB Output is correct
22 Correct 18 ms 3396 KB Output is correct
23 Correct 28 ms 6396 KB Output is correct
24 Correct 27 ms 6552 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 66 ms 716 KB Output is correct
31 Correct 66 ms 716 KB Output is correct
32 Correct 739 ms 2684 KB Output is correct
33 Execution timed out 1081 ms 2596 KB Time limit exceeded
34 Halted 0 ms 0 KB -