oj.uz

Submission #753953

# Submission time Handle Problem Language Result Execution time Memory
753953 2023-06-06T11:30:39 Z epicci23 Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 81 ms 12472 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}

int add(int a,int b)
{
  if(a+b>=MOD) return a+b-MOD;
  return a+b;
}

int mult(int a,int b)
{
  if(a*b>=MOD) return (a*b)%MOD;
  return a*b;
}

int eks(int a,int b)
{
  if(a<b) return a-b+MOD;
  return a-b;
}

int fast(int a,int b)
{
  if(b==0) return 1;
  int res=fast(a,b/2);
  res=mult(res,res);
  if(b&1) res=mult(res,a);
  return res;
}

void solve()
{
  int n=in(),ans=0;
  array<int,2> ar[n+2];
  ar[0]=ar[n+1]={0,0};
  for(int i=1;i<=n;i++) ar[i][0]=in();
  for(int i=1;i<=n;i++) ar[i][1]=in();
  
  int pre[n+1];
  pre[0]=0;
  int xd=fast(2,MOD-2);
  auto get=[&](int a){
    return mult(xd,mult(a,eks(a,1LL)));
  };

  for(int i=1;i<=n;i++) pre[i]=add(pre[i-1],ar[i][1]);

  array<int,2> hist[n+1];
  stack<int> s;
  for(int i=1;i<=n;i++)
  {
    while(!s.empty() && ar[s.top()][0]>=ar[i][0]) s.pop();
    hist[i][0]=s.empty() ? 0 : s.top();
    s.push(i);
  }

  while(!s.empty()) s.pop();
  
  for(int i=n;i>=1;i--)
  {
    while(!s.empty() && ar[s.top()][0]>=ar[i][0]) s.pop();
    hist[i][1]=s.empty() ? n+1 : s.top();
    s.push(i);
  }

  while(!s.empty()) s.pop();
  
  //cout << "";
  map<pii,bool> mp;

  for(int i=1;i<=n;i++)
  {
    if(mp[{ar[i][0],hist[i][0]}]) continue;
    mp[{ar[i][0],hist[i][0]}]=1;
    int r=hist[i][1]; 
    int l=hist[i][0];
    int maxi=max(ar[l][0],ar[r][0]);
    int uz=add(1LL,eks(pre[r-1],pre[l]));
    //cout << maxi << endl;
    ans=add(ans,mult(get(uz),get(add(eks(ar[i][0],maxi),1LL))));
    ans=add(ans,mult(get(uz),mult(eks(ar[i][0],maxi),maxi)));
  }

  cout << ans%MOD << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

fancyfence.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 212 KB Output is correct
2 Correct 2 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 17 ms 3524 KB Output is correct
4 Correct 37 ms 6336 KB Output is correct
5 Correct 33 ms 6768 KB Output is correct
6 Correct 30 ms 5844 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 3 ms 840 KB Output is correct
3 Correct 13 ms 3132 KB Output is correct
4 Correct 25 ms 6088 KB Output is correct
5 Correct 37 ms 6216 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 13 ms 3136 KB Output is correct
5 Correct 22 ms 6088 KB Output is correct
6 Correct 25 ms 6200 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 5 ms 1492 KB Output is correct
9 Correct 22 ms 4528 KB Output is correct
10 Correct 56 ms 12256 KB Output is correct
11 Correct 70 ms 12400 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 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 1 ms 212 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 1 ms 212 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 15 ms 3604 KB Output is correct
12 Correct 24 ms 6348 KB Output is correct
13 Correct 31 ms 6828 KB Output is correct
14 Correct 29 ms 5816 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 796 KB Output is correct
17 Correct 12 ms 3156 KB Output is correct
18 Correct 33 ms 6204 KB Output is correct
19 Correct 26 ms 6208 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 5 ms 1492 KB Output is correct
22 Correct 20 ms 4460 KB Output is correct
23 Correct 54 ms 12308 KB Output is correct
24 Correct 67 ms 12364 KB Output is correct
25 Correct 1 ms 212 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 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 6 ms 1516 KB Output is correct
31 Correct 6 ms 1480 KB Output is correct
32 Correct 31 ms 6028 KB Output is correct
33 Correct 34 ms 6340 KB Output is correct
34 Correct 80 ms 12236 KB Output is correct
35 Correct 74 ms 11852 KB Output is correct
36 Correct 81 ms 12420 KB Output is correct
37 Correct 73 ms 12368 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 80 ms 12108 KB Output is correct
40 Correct 81 ms 12348 KB Output is correct
41 Correct 54 ms 12472 KB Output is correct
42 Correct 53 ms 12424 KB Output is correct