oj.uz

답안 #492047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492047 2021-12-05T10:49:01 Z ValiAntonie Fancy Fence (CEOI20_fancyfence) C++14
60 / 100
 1000 ms 6504 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=1;j<=i-1;j++){
        if(st[sor[j].second] <= sor[i].second && dr[sor[j].second] >= sor[i].second)
            Max = sor[j].first;
    }
    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

# 결과 실행 시간 메모리 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 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 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Execution timed out 1092 ms 2004 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 14 ms 2252 KB Output is correct
4 Correct 25 ms 4280 KB Output is correct
5 Correct 29 ms 4268 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 14 ms 2244 KB Output is correct
5 Correct 26 ms 4216 KB Output is correct
6 Correct 31 ms 4276 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 14 ms 2516 KB Output is correct
10 Correct 25 ms 6468 KB Output is correct
11 Correct 29 ms 6504 KB Output is correct
12 Correct 1 ms 320 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 2 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 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 3 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 332 KB Output is correct
4 Correct 2 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 Execution timed out 1079 ms 2016 KB Time limit exceeded
12 Halted 0 ms 0 KB -