Submission #101968

---

Source Code Expand

#include <cstdio>
#include <algorithm>

using namespace std;

int a[100000];
int b[1 << 21][3];

int add(int x, int y, int z, int w)
{
    if (z < 0) {
        if (b[x][2] == -1) b[x][2] = w;
        
        return 1;
    } else {
        if ((y >> z) & 1) {
            b[x][0] = add(x * 2, y, z - 1, w);
        } else {
            b[x][1] = add(x * 2 + 1, y, z - 1, w);
        }
        
        return b[x][0] + b[x][1];
    }
}

pair<int, pair<int, int> > get(int x, int y, int z)
{
    if (z < 0) {
        return make_pair(0, make_pair(min(b[x][2], b[y][2]), max(b[x][2], b[y][2])));
    } else {
        pair<int, pair<int, int> > ans = make_pair(-1, make_pair(1e9, 1e9)), p;
        
        if ((b[x][0] == 0 || b[y][1] == 0) && (b[x][1] == 0 || b[y][0] == 0)) {
            if (b[x][0] > 0 && b[y][0] > 0) {
                p = get(x * 2, y * 2, z - 1);
                
                if (p.first > ans.first || (p.first == ans.first && p.second.first < ans.second.first) || (p.first == ans.first && p.second.first == ans.second.first && p.second.second < ans.second.second)) ans = p;
            }
            
            if (b[x][1] > 0 && b[y][1] > 0) {
                p = get(x * 2 + 1, y * 2 + 1, z - 1);
                
                if (p.first > ans.first || (p.first == ans.first && p.second.first < ans.second.first) || (p.first == ans.first && p.second.first == ans.second.first && p.second.second < ans.second.second)) ans = p;
            }
        } else {
            if (b[x][0] > 0 && b[y][1] > 0) {
                p = get(x * 2, y * 2 + 1, z - 1);
                
                if (p.first > ans.first || (p.first == ans.first && p.second.first < ans.second.first) || (p.first == ans.first && p.second.first == ans.second.first && p.second.second < ans.second.second)) ans = p;
            }
            
            if (b[x][1] > 0 && b[y][0] > 0) {
                p = get(x * 2 + 1, y * 2, z - 1);
                
                if (p.first > ans.first || (p.first == ans.first && p.second.first < ans.second.first) || (p.first == ans.first && p.second.first == ans.second.first && p.second.second < ans.second.second)) ans = p;
            }
            
            ans.first |= (1 << z);
        }
        
        return ans;
    }
}

int main()
{
    int n, x = 0, i;
    pair<int, pair<int, int> > p;
    
    scanf("%d", &n);
    
    for (i = 0; i < n; i++) scanf("%d", &a[i]);
    
    for (i = 0; i < (1 << 21); i++) b[i][2] = -1;
    
    add(1, 0, 19, 0);
    
    for (i = 0; i < n; i++) {
        x ^= a[i];
        
        add(1, x, 19, i + 1);
    }
    
    if (b[1][0] + b[1][1] == 1) {
        puts("0 1 1");
        
        return 0;
    }
    
    p = get(1, 1, 19);
    
    printf("%d %d %d\n", p.first, p.second.first + 1, p.second.second);
    
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:70:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:72:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result