Submission #132591

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
132591	2019-07-19T07:54:17 Z	anayk	Dojave (COCI17_dojave)	C++14	Compilation error	0 ms	0 KB

dojave

#include <iostream>
 
#define MAXN 2000000
 
int m, n;
int first[MAXN];
int other[MAXN];
int seq[MAXN];
long long dp[2][MAXN];
int min, max;
int a, b;
 
void add(int x)
{
	min = std::min(x, min);
	max = std::max(x, max);
}
 
void solve(int l, int r)
{
	int m = (l+r)/2;
 
	a = m;
	b = m+1;
 
	min = a;
	max = b;
 
	add(other[seq[a]]);
	add(other[seq[b]]);
 
	while(true)
	{
		if(a > min)
		{
			if(a == l)
				break;
 
			a--;
			add(other[seq[a]]);
		}
		else if(b < max)
		{
			if(b == r)
				break;
 
			b++;
			add(other[seq[b]]);
		}
		else
		{
			first[a] = std::min(first[a], b);
 
			if(a == l)
				break;
 
			a--;
			add(other[seq[a]]);
		}
	}
}
 
int main()
{	

  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
 
	std::cin >> m;
	n = (1 << m);
 
	if(m == 1)
	{
		std::cout << 2 << std::endl;
		return 0;
	}
 
	for(int i = 0; i < n; i++)
	{
		std::cin >> seq[i];
		first[i] = MAXN;
		other[seq[i]^(n-1)] = i;
	}
 
	int c = 2;
	while(c <= n)
	{
		for(int i = 0; i < n; i+=c)
			solve(i, i+c-1);
		c *= 2;
	}
 
	long long answer = n;
	answer *= (answer-1);
	answer /= 2;
	answer += (long long) n;
 
	dp[0][n] = dp[1][n] = 0;
 
	for(int i = n-1; i >= 0; i--)
	{
		dp[0][i] = dp[1][i] = 0;
		
		if(first[i] == MAXN)
			continue;
 
		int c = first[i]-i+1;
		if(c%4)
		{
			dp[1][i] = 1;
			dp[1][i] += dp[0][first[i]+1];
			dp[0][i] += dp[1][first[i]+1];
		}
		else
		{
			dp[0][i] = 1;
			dp[1][i] += dp[1][first[i]+1];
			dp[0][i] += dp[0][first[i]+1];
		}
 
		answer -= dp[0][i];
	}
 
	std::cout << answer << std::endl;
 
	return 0;
}

Compilation message

dojave.cpp:67:2: error: stray '\302' in program
   std::cin.tie(0);
  ^
dojave.cpp:67:3: error: stray '\240' in program
   std::cin.tie(0);
   ^