CSES - HIIT Open 2017 - Results
Submission details
Task:Contest
Sender:oispa opiskelupaikka tefyllä ;...;
Submission time:2017-05-27 15:42:46 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.05 sdetails
#20.06 sdetails
#3--details
#4--details
#5ACCEPTED0.04 sdetails
#60.07 sdetails
#70.07 sdetails
#80.04 sdetails
#90.05 sdetails
#100.04 sdetails
#11--details
#12--details
#13--details
#14--details
#15--details
#16--details
#17ACCEPTED0.06 sdetails
#180.05 sdetails
#190.05 sdetails
#200.07 sdetails
#210.07 sdetails
#22--details
#230.04 sdetails
#240.06 sdetails
#250.06 sdetails
#26--details
#27--details
#28--details
#29--details
#30--details
#31--details
#32ACCEPTED0.09 sdetails
#330.15 sdetails
#340.08 sdetails
#350.09 sdetails
#360.10 sdetails
#37--details
#380.08 sdetails
#390.12 sdetails
#400.09 sdetails
#41--details
#42--details
#43--details
#44--details
#45--details
#46--details

Code

#include <bits/stdc++.h>

using namespace std;
int n, k;
unordered_map<int, int> ad, ud;
int getA(int i){
    if(ad.count(i))
        return ad[i];
    cout << "1 " << i+1 << endl;
    cout.flush();
    int re; cin >> re;
    ad[i] = re;
    return re;
}

int getU(int i){
    if(ud.count(i))
        return ud[i];
    cout << "2 " << i+1 << endl;
    cout.flush();
    int re; cin >> re;
    ud[i] = re;
    return re;
}
bool dd = false;
bool endd = false;

int idxa(int lol){
    int cn = getA(lol);
    int i = -1;
    for(int bi = 1<<19; bi > 0; bi/=2){
        while(i+bi < n && cn > getU(i+bi))
            i+=bi;
    }
    return lol+(i+1);
}
void hae1(){
    int i = 0;
    for(int bi = 1<<19; bi > 0; bi/=2){
        while(i+bi < n && idxa(i+bi) <= k)
            i+=bi;
    }
    if(i == k){
        endd = 1;
        cout << "3 " << getA(i) << endl;
    }
}

int idxu(int lol){
    int cn = getU(lol);
    int i = -1;
    for(int bi = 1<<19; bi > 0; bi/=2){
        while(i+bi < n && cn > getA(i+bi))
            i+=bi;
    }
    return lol+(i+1);
}
void hae2(){
    if(endd)
        return;
    int i = 0;
    for(int bi = 1<<19; bi > 0; bi/=2){
        while(i+bi < n && idxu(i+bi) <= k)
            i+=bi;
    }
    if(i == k){
        endd = 1;
        cout << "3 " << getU(i) << endl;
    }
}



int main(){
    cin >> n >> k;
    k--;
    hae1();
    hae2();
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1 1
33
18

correct output
(empty)

user output
1 1
1 1
33
3 33

Test 2

Verdict:

input
1 1
37
55

correct output
(empty)

user output
1 1
1 1
37
3 37

Test 3

Verdict:

input
1 2
80
38

correct output
(empty)

user output
(empty)

Test 4

Verdict:

input
1 2
29
48

correct output
(empty)

user output
(empty)

Test 5

Verdict: ACCEPTED

input
2 1
98 91
83 14

correct output
(empty)

user output
2 1
1 2
91
2 2
14
...

Test 6

Verdict:

input
2 1
25 23
39 31

correct output
(empty)

user output
2 1
1 2
23
2 2
31
...

Test 7

Verdict:

input
2 1
73 57
77 32

correct output
(empty)

user output
2 1
1 2
57
2 2
32
...

Test 8

Verdict:

input
2 2
77 64
63 2

correct output
(empty)

user output
2 2
1 2
64
2 2
2
...

Test 9

Verdict:

input
2 2
61 28
97 90

correct output
(empty)

user output
2 2
1 2
28
2 2
90
...

Test 10

Verdict:

input
2 2
87 66
75 38

correct output
(empty)

user output
2 2
1 2
66
2 2
38
...

Test 11

Verdict:

input
2 4
70 39
33 12

correct output
(empty)

user output
(empty)

Test 12

Verdict:

input
2 4
47 20
67 52

correct output
(empty)

user output
(empty)

Test 13

Verdict:

input
2 4
54 20
90 1

correct output
(empty)

user output
(empty)

Test 14

Verdict:

input
2 4
68 66
64 61

correct output
(empty)

user output
(empty)

Test 15

Verdict:

input
2 4
35 27
68 66

correct output
(empty)

user output
(empty)

Test 16

Verdict:

input
2 4
51 32
25 18

correct output
(empty)

user output
(empty)

Test 17

Verdict: ACCEPTED

input
10 1
100 78 74 72 71 70 64 57 43 39
29 26 22 21 15 13 11 9 4 3

correct output
(empty)

user output
10 1
1 9
43
2 8
9
...

Test 18

Verdict:

input
10 1
56 52 49 48 17 14 13 12 9 3
99 98 84 80 78 75 69 67 66 62

correct output
(empty)

user output
10 1
1 9
9
2 8
67
...

Test 19

Verdict:

input
10 1
91 86 73 65 53 42 28 14 13 6
100 77 70 58 52 41 35 33 17 9

correct output
(empty)

user output
10 1
1 9
13
2 8
33
...

Test 20

Verdict:

input
10 2
88 87 69 68 64 63 57 55 54 51
50 36 35 31 27 22 15 14 8 1

correct output
(empty)

user output
10 2
1 9
54
2 8
14
...
Truncated

Test 21

Verdict:

input
10 2
31 28 26 16 13 9 8 6 5 2
95 87 80 78 76 65 59 53 41 40

correct output
(empty)

user output
10 2
1 9
5
2 8
53
...

Test 22

Verdict:

input
10 2
98 93 89 68 61 41 32 30 23 4
96 86 76 75 73 58 35 29 26 7

correct output
(empty)

user output
(empty)

Test 23

Verdict:

input
10 10
99 86 85 84 82 81 77 74 71 69
45 27 26 24 21 18 15 13 11 4

correct output
(empty)

user output
10 10
1 9
71
2 8
13
...

Test 24

Verdict:

input
10 10
46 41 40 28 24 23 18 14 8 4
100 94 90 85 78 77 75 68 59 54

correct output
(empty)

user output
10 10
1 9
8
2 8
68
...

Test 25

Verdict:

input
10 10
91 80 68 39 38 37 31 30 7 1
100 95 87 71 67 41 33 18 17 11

correct output
(empty)

user output
10 10
1 9
7
2 8
18
...

Test 26

Verdict:

input
10 18
87 86 85 80 79 74 64 60 59 47
43 39 37 34 29 27 26 16 6 5

correct output
(empty)

user output
(empty)

Test 27

Verdict:

input
10 18
54 48 42 38 28 27 22 19 15 5
100 96 91 84 79 73 72 64 63 60

correct output
(empty)

user output
(empty)

Test 28

Verdict:

input
10 18
98 87 84 71 62 59 45 38 34 10
89 86 77 73 69 67 46 32 31 6

correct output
(empty)

user output
(empty)

Test 29

Verdict:

input
10 20
91 90 86 79 73 71 67 65 61 56
46 44 36 25 18 11 6 5 3 1

correct output
(empty)

user output
(empty)

Test 30

Verdict:

input
10 20
56 48 47 46 35 28 26 18 10 3
95 90 89 85 79 77 67 66 62 59

correct output
(empty)

user output
(empty)

Test 31

Verdict:

input
10 20
81 80 79 76 71 63 57 34 29 24
96 70 61 59 52 36 22 5 4 2

correct output
(empty)

user output
(empty)

Test 32

Verdict: ACCEPTED

input
100000 1
999998453 999997813 999980598 ...

correct output
(empty)

user output
100000 1
1 65537
673553588
2 65536
172867921
...
Truncated

Test 33

Verdict:

input
100000 1
498482877 498480230 498478078 ...

correct output
(empty)

user output
100000 1
1 65537
171785183
2 65536
669514162
...
Truncated

Test 34

Verdict:

input
100000 1
999986977 999979153 999972315 ...

correct output
(empty)

user output
100000 1
1 65537
344651117
2 65536
343267139
...
Truncated

Test 35

Verdict:

input
100000 20000
999990977 999974610 999971985 ...

correct output
(empty)

user output
100000 20000
1 65537
674178849
2 65536
172134979
...
Truncated

Test 36

Verdict:

input
100000 20000
501434689 501431546 501422578 ...

correct output
(empty)

user output
100000 20000
1 65537
172605568
2 65536
673497612
...
Truncated

Test 37

Verdict:

input
100000 20000
999995686 999994228 999993000 ...

correct output
(empty)

user output
(empty)

Test 38

Verdict:

input
100000 100000
999992342 999991618 999988963 ...

correct output
(empty)

user output
100000 100000
1 65537
673489872
2 65536
171393059
...
Truncated

Test 39

Verdict:

input
100000 100000
500754694 500749114 500734428 ...

correct output
(empty)

user output
100000 100000
1 65537
172948003
2 65536
673316641
...
Truncated

Test 40

Verdict:

input
100000 100000
999988713 999962210 999939592 ...

correct output
(empty)

user output
100000 100000
1 65537
343755588
2 65536
344731553
...
Truncated

Test 41

Verdict:

input
100000 180000
999994001 999991970 999991811 ...

correct output
(empty)

user output
(empty)

Test 42

Verdict:

input
100000 180000
499560736 499555703 499549265 ...

correct output
(empty)

user output
(empty)

Test 43

Verdict:

input
100000 180000
999996507 999993660 999990414 ...

correct output
(empty)

user output
(empty)

Test 44

Verdict:

input
100000 200000
999987384 999983480 999981446 ...

correct output
(empty)

user output
(empty)

Test 45

Verdict:

input
100000 200000
500801844 500800718 500792295 ...

correct output
(empty)

user output
(empty)

Test 46

Verdict:

input
100000 200000
999984710 999974756 999965175 ...

correct output
(empty)

user output
(empty)