Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2)

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
2096 Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) FINISHED False 7200 31418684 April 19, 2025, 2:35 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 417 ) G Wonderful Guessing Game PROGRAMMING interactive

This is an interactive problem. You are a proud teacher at the Millennium Science School. Today, a student named Alice challenges you to a guessing game. Alice is thinking of an integer from (1) to (n), and you must guess it by asking her some queries. To make things harder, she says you must ask all the queries first , and she will ignore exactly (1) query. For each query, you choose an array of (k) distinct integers from (1) to (n), where (k) is even. Then, Alice will respond with one of the following: (L): the number is one of the first (\frac{k}{2}) elements of the array; (R): the number is one of the last (\frac{k}{2}) elements of the array; (N): the number is not in the array; (?): this query is ignored. Alice is impatient, so you must find a strategy that minimizes the number of queries. Can you do it? Formally, let (f(n)) be the minimum number of queries required to determine Alice's number. Then you must find a strategy that uses exactly (f(n)) queries. Note that the interactor is adaptive , which means Alice's number is not fixed at the beginning and may depend on your queries. However, it is guaranteed that there exists at least one number that is consistent with Alice's responses. We can show that (f(n) \leq 20) for all (n) such that (2 \le n \le 2 \cdot 10^5). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The only line of each test case contains a single integer (n) ((2 \le n \le 2 \cdot 10^5)) — the maximum possible value of Alice's number. It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). The interaction begins by reading the integer (n). Then, output a single integer (q) ((1 \leq q \leq 20)) — the number of queries. To ask a query, output a line in th

Tutorials

Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
316283300 arzhantsev64 G April 19, 2025, 4:18 p.m. OK C++17 (GCC 7-32) TESTS 23 390 35225600
316291828 KroosTheKeenGlint G April 19, 2025, 5:13 p.m. OK C++17 (GCC 7-32) TESTS 23 405 25088000
316278962 orzdevinwang G April 19, 2025, 4:05 p.m. OK C++17 (GCC 7-32) TESTS 23 405 159641600
316281601 79brue G April 19, 2025, 4:13 p.m. OK C++17 (GCC 7-32) TESTS 23 437 72601600
316322999 keisuke6 G April 20, 2025, 1:20 a.m. OK C++17 (GCC 7-32) TESTS 23 452 22016000
316307644 TadijaSebez G April 19, 2025, 7:45 p.m. OK C++17 (GCC 7-32) TESTS 23 468 17715200
316277752 heuristica G April 19, 2025, 4:01 p.m. OK C++17 (GCC 7-32) TESTS 23 468 30924800
316289020 Feduk_Pro_Spb G April 19, 2025, 4:34 p.m. OK C++17 (GCC 7-32) TESTS 23 515 55808000
316289044 flamestorm G April 19, 2025, 4:34 p.m. OK C++17 (GCC 7-32) TESTS 23 515 71372800
316302397 skyhgzsh G April 19, 2025, 6:44 p.m. OK C++17 (GCC 7-32) TESTS 23 1640 79360000
316275807 cn449 G April 19, 2025, 3:56 p.m. OK C++20 (GCC 13-64) TESTS 23 218 19968000
316292318 SirTechnical G April 19, 2025, 5:16 p.m. OK C++20 (GCC 13-64) TESTS 23 264 23040000
316281423 Z-301 G April 19, 2025, 4:13 p.m. OK C++20 (GCC 13-64) TESTS 23 265 14848000
316284895 BurnedChicken G April 19, 2025, 4:23 p.m. OK C++20 (GCC 13-64) TESTS 23 280 25702400
316283227 StarSilk G April 19, 2025, 4:18 p.m. OK C++20 (GCC 13-64) TESTS 23 311 19865600
316291658 gloria_mundi G April 19, 2025, 5:12 p.m. OK C++20 (GCC 13-64) TESTS 23 312 10854400
316276858 jeroenodb G April 19, 2025, 3:59 p.m. OK C++20 (GCC 13-64) TESTS 23 327 9932800
316287065 cxm1024 G April 19, 2025, 4:30 p.m. OK C++20 (GCC 13-64) TESTS 23 327 12083200
316324494 perchuts G April 20, 2025, 1:57 a.m. OK C++20 (GCC 13-64) TESTS 23 327 25907200
316294359 shiomusubi496 G April 19, 2025, 5:31 p.m. OK C++20 (GCC 13-64) TESTS 23 342 716800
316291880 lcyxds G April 19, 2025, 5:14 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 203 10752000
316312934 MridulAhi G April 19, 2025, 8:58 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 265 40243200
316283637 cdxcdxcdxcdx G April 19, 2025, 4:19 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 265 121241600
316272905 ugly2333 G April 19, 2025, 3:47 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 312 21811200
316282702 maroonrk G April 19, 2025, 4:17 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 312 30822400
316282676 orz G April 19, 2025, 4:16 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 328 59904000
316296814 iakovlev.zakhar G April 19, 2025, 5:51 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 342 34713600
316299004 installb G April 19, 2025, 6:11 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 343 61235200
316297809 aaryaibtedafoyez G April 19, 2025, 6 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 358 10649600
316305079 bookcat G April 19, 2025, 7:14 p.m. OK C++23 (GCC 14-64, msys2) TESTS 23 358 17203200
316281417 hos.lyric G April 19, 2025, 4:13 p.m. OK D TESTS 23 1046 52428800
316275517 Tlatoani G April 19, 2025, 3:55 p.m. OK Kotlin 1.9 TESTS 23 1484 87142400
316323379 harurun4635 G April 20, 2025, 1:30 a.m. OK PyPy 3-64 TESTS 23 624 68608000
316280741 dyppp G April 19, 2025, 4:10 p.m. OK PyPy 3-64 TESTS 23 859 107008000
316277801 bronze_coder G April 19, 2025, 4:02 p.m. OK PyPy 3-64 TESTS 23 1233 166809600
316324497 esrever G April 20, 2025, 1:57 a.m. OK Rust 2021 TESTS 23 421 4505600

remove filters

Back to search problems