oj.uz

Submission #49212

# Submission time Handle Problem Language Result Execution time Memory
49212 2018-05-23T19:54:09 Z ami Dojave (COCI17_dojave) C++14
140 / 140
 254 ms 29308 KB 
#include <bits/stdc++.h>
#define sz(c)      int(c.size())
#define rep(i,a,b) for (int i=a; i<(b); ++i)
#define per(i,a,b) for (int i=(b)-1; i>=(a); --i)
using namespace std;
using i64 = long long;

int const MAXN=1<<21;
int n;
int a[MAXN];
int to[MAXN];

int len_[MAXN];
i64 cnt_[MAXN][2];
auto len=len_+1;
auto cnt=cnt_+1;

i64 solve(int l,int r) {
  if (l==r) return 0;
  int m=(l+r)/2;
  i64 res=solve(l,m)+solve(m+1,r);
  int lo=m+1,hi=m;
  int i=m+1,j=m;
  while (l<=lo && hi<=r) {
    if (lo<i) {
      i-=1;
      lo=min(lo,to[a[i]]);
      hi=max(hi,to[a[i]]);
    } else if (j<hi) {
      j+=1;
      lo=min(lo,to[a[j]]);
      hi=max(hi,to[a[j]]);
    } else {
      int curLen=j-i+1;
      int lenL=(l<=i-1 ? len[i-1] : 0);
      int lenR=(j+1<=r ? len[j+1] : 0);
      lo-=lenL;
      hi+=lenR;

      len[lo]=len[hi]=hi-lo+1;

      rep(modL,0,2) if (m<hi) {
        i64 cntL=(l<=i-1 ? cnt[i-1][modL] : 0) + (curLen>0 && modL==0 ? 1 : 0);
        cnt[hi][((curLen+lenR)/2+modL)%2]+=cntL;
      }

      rep(modR,0,2) if (lo<=m) {
        i64 cntR=(j+1<=r ? cnt[j+1][modR] : 0) + (curLen>0 && modR==0 ? 1 : 0);
        cnt[lo][((curLen+lenL)/2+modR)%2]+=cntR;
      }

      rep(modL,0,2) rep(modR,0,2) if ((curLen/2+modL+modR)%2==0) {
        i64 cntL=(l<=i-1 ? cnt[i-1][modL] : 0) + (curLen>0 && modL==0 ? 1 : 0);
        i64 cntR=(j+1<=r ? cnt[j+1][modR] : 0) + (curLen>0 && modR==0 ? 1 : 0);
        res+=cntL*cntR;
      }

      lo-=1;
      hi+=1;
    }
  }
  return res;
}

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout<<fixed<<setprecision(10);

  cin>>n;
  int N=1<<n;
  rep(i,0,N) cin>>a[i];

  if (n==1) {
    cout<<2<<endl;
    return 0;
  }

  rep(i,0,N) to[N-1-a[i]]=i;

  cout<<i64(N+1)*N/2-solve(0,N-1)<<endl;

  return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 476 KB Output is correct
2 Correct 3 ms 476 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 732 KB Output is correct
2 Correct 4 ms 732 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 804 KB Output is correct
2 Correct 5 ms 804 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 848 KB Output is correct
2 Correct 4 ms 1004 KB Output is correct
3 Correct 6 ms 1004 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1388 KB Output is correct
2 Correct 12 ms 2412 KB Output is correct
3 Correct 44 ms 4156 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4156 KB Output is correct
2 Correct 24 ms 4332 KB Output is correct
3 Correct 52 ms 7788 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 7788 KB Output is correct
2 Correct 49 ms 7788 KB Output is correct
3 Correct 54 ms 7916 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 12960 KB Output is correct
2 Correct 227 ms 13304 KB Output is correct
3 Correct 225 ms 29304 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 29304 KB Output is correct
2 Correct 198 ms 29308 KB Output is correct
3 Correct 197 ms 29308 KB Output is correct
4 Correct 252 ms 29308 KB Output is correct