oj.uz

답안 #492076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492076 2021-12-05T11:20:09 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++14
73 / 100
 1000 ms 4680 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});
}
//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;
}
if(total1 < total2)
    total1 += mod;
cout << total1 - total2 << endl;
    return 0;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 177 ms 1996 KB Output is correct
4 Correct 190 ms 4356 KB Output is correct
5 Correct 715 ms 3696 KB Output is correct
6 Correct 323 ms 3208 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 15 ms 2268 KB Output is correct
4 Correct 26 ms 4304 KB Output is correct
5 Correct 45 ms 4204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 3 ms 716 KB Output is correct
4 Correct 20 ms 2272 KB Output is correct
5 Correct 33 ms 4284 KB Output is correct
6 Correct 31 ms 4300 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 18 ms 2372 KB Output is correct
10 Correct 40 ms 4672 KB Output is correct
11 Correct 27 ms 4632 KB Output is correct
12 Correct 0 ms 332 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 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 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 0 ms 204 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 155 ms 2024 KB Output is correct
12 Correct 149 ms 4300 KB Output is correct
13 Correct 648 ms 3700 KB Output is correct
14 Correct 331 ms 3204 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 14 ms 2236 KB Output is correct
18 Correct 28 ms 4300 KB Output is correct
19 Correct 31 ms 4264 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 14 ms 2380 KB Output is correct
23 Correct 25 ms 4680 KB Output is correct
24 Correct 26 ms 4676 KB Output is correct
25 Correct 0 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 61 ms 572 KB Output is correct
31 Correct 72 ms 592 KB Output is correct
32 Correct 626 ms 1696 KB Output is correct
33 Execution timed out 1088 ms 1612 KB Time limit exceeded
34 Halted 0 ms 0 KB -