hihoCoder太阁最新面经算法竞赛4 register

Ended

Participants:109

Verdict:Accepted
Score:100 / 100
Submitted:2016-06-18 15:41:22

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
    int n, x, y;
    scanf("%d %d %d",&n,&x,&y);
    int flag = 1, temp; //线flag1flag0
    long long num = 0, N; 
    for (int i = n; i >= 1; i--)
    {
        N = 1<<(i-1);
        if (x <= N)
        {
            if (y <= N)  //p1
            {
                num += (1 - flag) * 3 * N*N;
                temp = y;
                y = x;
                x = N + 1 - temp;
                flag = 1 - flag;
            }
            else  //p2
            {
                num += (flag + (1 - flag) * 2)*N*N;
                y -= N;
            }
        }
        else
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX