# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
132356 |
2019-07-18T18:13:24 Z |
anayk |
Dojave (COCI17_dojave) |
C++14 |
|
291 ms |
36256 KB |
#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 >> 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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
380 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
656 KB |
Output is correct |
2 |
Correct |
3 ms |
632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
888 KB |
Output is correct |
2 |
Correct |
5 ms |
888 KB |
Output is correct |
3 |
Correct |
5 ms |
888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
2300 KB |
Output is correct |
2 |
Correct |
12 ms |
2360 KB |
Output is correct |
3 |
Correct |
27 ms |
4276 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
2352 KB |
Output is correct |
2 |
Correct |
24 ms |
4216 KB |
Output is correct |
3 |
Correct |
54 ms |
9208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
68 ms |
7768 KB |
Output is correct |
2 |
Correct |
44 ms |
7752 KB |
Output is correct |
3 |
Correct |
55 ms |
9180 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
291 ms |
29284 KB |
Output is correct |
2 |
Correct |
244 ms |
29304 KB |
Output is correct |
3 |
Correct |
187 ms |
29376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
266 ms |
29236 KB |
Output is correct |
2 |
Correct |
171 ms |
29288 KB |
Output is correct |
3 |
Correct |
203 ms |
36256 KB |
Output is correct |
4 |
Correct |
264 ms |
36216 KB |
Output is correct |