oj.uz

Submission #491871

# Submission time Handle Problem Language Result Execution time Memory
491871 2021-12-04T21:12:18 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++14
15 / 100
 34 ms 7876 KB 
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;

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


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;
}
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++){
    if(!dr[i])
    dr[i] = n + 1;
}
for(i=1;i<=n;i++){
    total += rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i].first) % mod;
    total -= rectCount(suma[dr[sor[i].second]-1] - suma[st[sor[i].second]],sor[i-1].first) % mod;
}
cout << total % mod;
    return 0;
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:37:34: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   37 |     while(S.empty() == false && x<S.top().first){
      |                                 ~^~~~~~~~~~~~~~
fancyfence.cpp:48:35: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   48 |     while(S.empty() == false && x < S.top().first){
      |                                 ~~^~~~~~~~~~~~~~~

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

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
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 3 ms 844 KB Output is correct
3 Correct 13 ms 3020 KB Output is correct
4 Correct 26 ms 5784 KB Output is correct
5 Correct 34 ms 7876 KB Output is correct
6 Correct 0 ms 324 KB Output is correct

Subtask #5
0 / 15.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 3 ms 844 KB Output is correct
4 Correct 14 ms 3076 KB Output is correct
5 Correct 28 ms 5872 KB Output is correct
6 Correct 31 ms 7868 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Incorrect 3 ms 1100 KB Output isn't correct
9 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 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

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