oj.uz

Submission #974831

# Submission time Handle Problem Language Result Execution time Memory
974831 2024-05-03T21:05:14 Z imarn Fancy Fence (CEOI20_fancyfence) C++14
30 / 100
 32 ms 5100 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define sz(x) (ll)x.size()
#define pp pair<int,pii>
using namespace std;
const int mxn=1e5+5,inf=1e9+7;
int pr[mxn]{0};
ll sz[mxn]{0};
int get(int r){
    return pr[r]==r?r:pr[r]=get(pr[r]);
}
ll c(ll x){
    return ((x*(x+1))/2)%inf;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);ll ans=0;
    int n;cin>>n;vector<pp>v(n);iota(pr,pr+n+1,0);
    for(int i=0;i<n;i++)cin>>v[i].f,v[i].s.s=i+1;
    for(int i=0;i<n;i++)cin>>v[i].s.f;sort(v.begin(),v.end(),greater<pp>());
    for(auto it : v){int i=it.s.s;pr[i]=i;sz[i]=it.s.f;sz[i]%=inf;
        ans+=(c(sz[i])*c(it.f))%inf;
        if(pr[it.s.s-1]&&get(it.s.s-1)!=get(i)){
            int u=get(it.s.s-1);
            ans-=((c(sz[u])*c(it.f))%inf+(c(sz[i])*c(it.f))%inf)%inf;ans%=inf;
            sz[i]+=sz[u];sz[i]%=inf;
            pr[u]=i;
            ans+=(c(sz[i])*c(it.f))%inf;ans%=inf;
        }
        if(pr[it.s.s+1]&&get(it.s.s+1)!=get(i)){
            int u=get(it.s.s+1);
            ans-=((c(sz[u])*c(it.f))%inf+(c(sz[i])*c(it.f))%inf)%inf;ans%=inf;
            sz[i]+=sz[u];sz[i]%=inf;
            pr[u]=i;
            ans+=(c(sz[i])*c(it.f))%inf;ans%=inf;
        }
    }cout<<(ans%inf+inf)%inf;
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:23:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   23 |     for(int i=0;i<n;i++)cin>>v[i].s.f;sort(v.begin(),v.end(),greater<pp>());
      |     ^~~
fancyfence.cpp:23:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   23 |     for(int i=0;i<n;i++)cin>>v[i].s.f;sort(v.begin(),v.end(),greater<pp>());
      |                                       ^~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 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 348 KB Output is correct
2 Incorrect 1 ms 348 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 1 ms 348 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 15 ms 2488 KB Output is correct
4 Correct 30 ms 4696 KB Output is correct
5 Correct 31 ms 4688 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 3 ms 820 KB Output is correct
4 Correct 15 ms 2396 KB Output is correct
5 Correct 32 ms 4708 KB Output is correct
6 Correct 30 ms 5100 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 3 ms 860 KB Output is correct
9 Correct 15 ms 2652 KB Output is correct
10 Correct 21 ms 4448 KB Output is correct
11 Correct 21 ms 4700 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 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 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -