CF1835C.Twin Clusters

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Famous worldwide astrophysicist Mleil waGrasse Tysok recently read about the existence of twin galaxy clusters. Before he shares this knowledge with the broader audience in his podcast called S.tarT-ok, he wants to prove their presence on his own. Mleil is aware that the vastness of the universe is astounding (almost as astounding as his observation skills) and decides to try his luck and find some new pair of twin clusters.

To do so, he used his TLEscope to observe a part of the night sky that was not yet examined by humanity in which there are exactly 2k+12^{k + 1} galaxies in a row. ii -th of them consist of exactly 0gi<4k0 \le g_i < 4^k stars.

A galaxy cluster is any non-empty contiguous segment of galaxies. Moreover, its' trait is said to be equal to the bitwise XOR of all values gig_i within this range.

Two galaxy clusters are considered twins if and only if they have the same traits and their corresponding segments are disjoint.

Write a program that, for many scenarios, will read a description of a night sky part observed by Mleil and outputs a location of two intervals belonging to some twin clusters pair, or a single value 1-1 if no such pair exists.

输入格式

The first line contains a single integer tt , denoting the number of test cases that the program has to handle. The following lines contain test case descriptions, each containing exactly two lines.

The first of them contains a single integer kk ( 0k170 \le k \le 17 ).

The second line contains 2k+12^{k + 1} integers g1,g2,,g2k+1g_1, g_2, \ldots, g_{2^{k+1}} ( 0gi<4k0 \le g_i < 4^k ).

We guarantee that the sum of values 2k+12^{k + 1} over all test cases does not exceed 2182^{18} .

输出格式

Answers for all test cases should be present in separate lines. If there exist a pair of twin galaxies, then output four integers aa , bb , cc , and dd denoting their inclusive ranges [a,b][a, b] and [c,d][c, d] (the first interval does not need to start before the second one, but they have to be disjoint). If no pair of such galaxies exist, output a single value 1-1 instead.

输入输出样例

  • 输入#1

    4
    2
    4 15 0 7 11 8 3 2
    1
    0 1 2 3
    0
    0 0
    3
    15 63 57 39 61 25 42 61 50 41 27 41 56 23 17 27

    输出#1

    2 4 6 6
    2 2 3 4
    1 1 2 2
    1 1 4 10

说明/提示

In the first test case we pick intervals [2,4][2, 4] and [6,6][6, 6] as our twin clusters. The trait of the first interval equals 1507=815 \oplus 0 \oplus 7 = 8 , and the trait of the second interval equals 88 , so these galaxy clusters are indeed twins.

首页