oj.uz

Submission #544363

# Submission time Handle Problem Language Result Execution time Memory
544363 2022-04-01T19:13:21 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 42 ms 4272 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,st2[100005],dr2[100005];
long long suma[100001],total1,val1, val2,total2,nr;
pair <int,int > sor[100005];


long long bin(long long  x){
    if(x > mod){
	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);
scanf("%d", &n);
for(i=1;i<=n;i++){
    scanf("%d", &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++){
    scanf("%d", &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});
}

while(S.empty() == false){
    S.pop();
}
for(i=n;i>=1;i--){
    x = v[i];
    while(S.empty() == false && x<=S.top().first){
        st2[S.top().second] = i;
        S.pop();
    }
    S.push({x,i});
}
for(i=1;i<=n;i++){
    total1 = (total1 + rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i].first));
    if(total1 > mod){
        total1 -= mod;
    }
    Max = max(v[st2[sor[i].second]],v[dr[sor[i].second]]);
    total2 = (total2 + rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],Max)) % mod;
}
if(total1 < total2)
    total1 += mod;
cout << total1 - total2;
    return 0;
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:27:6: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 | scanf("%d", &n);
      | ~~~~~^~~~~~~~~~
fancyfence.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     scanf("%d", &v[i]);
      |     ~~~~~^~~~~~~~~~~~~
fancyfence.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     scanf("%d", &x);
      |     ~~~~~^~~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 16 ms 2004 KB Output is correct
4 Correct 31 ms 3976 KB Output is correct
5 Correct 33 ms 3656 KB Output is correct
6 Correct 31 ms 3428 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 4 ms 596 KB Output is correct
3 Correct 14 ms 2080 KB Output is correct
4 Correct 30 ms 3644 KB Output is correct
5 Correct 29 ms 3588 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 15 ms 2012 KB Output is correct
5 Correct 32 ms 3632 KB Output is correct
6 Correct 33 ms 3680 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 15 ms 2244 KB Output is correct
10 Correct 28 ms 4208 KB Output is correct
11 Correct 29 ms 4272 KB Output is correct
12 Correct 0 ms 340 KB Output is correct

Subtask #6
18.0 / 18.0

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

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 19 ms 2004 KB Output is correct
12 Correct 30 ms 4028 KB Output is correct
13 Correct 32 ms 3688 KB Output is correct
14 Correct 32 ms 3540 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 15 ms 2080 KB Output is correct
18 Correct 30 ms 3580 KB Output is correct
19 Correct 31 ms 3632 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 16 ms 2208 KB Output is correct
23 Correct 30 ms 4160 KB Output is correct
24 Correct 29 ms 4196 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 4 ms 596 KB Output is correct
31 Correct 5 ms 596 KB Output is correct
32 Correct 21 ms 1804 KB Output is correct
33 Correct 20 ms 1876 KB Output is correct
34 Correct 39 ms 3436 KB Output is correct
35 Correct 41 ms 3356 KB Output is correct
36 Correct 42 ms 3416 KB Output is correct
37 Correct 40 ms 3436 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 37 ms 3424 KB Output is correct
40 Correct 33 ms 3404 KB Output is correct
41 Correct 31 ms 3364 KB Output is correct
42 Correct 28 ms 3348 KB Output is correct