Common Board| Show all threads Hide all threads Show all messages Hide all messages | | Test 48 | 107th | 1394. Ships. Version 2 | 9 Feb 2021 10:39 | 5 | Hello :) Could someone please give me test 48 or similar to let me understand what is wrong with my program ? :) My program works fast on this test case :) (about 0.5 seconds) but still have TLE 48 ) What is the best way to collect information for particular test? Time/100ms (if there is window for that), memory/100kB, WA, TLE, RE... what else? What maximum number of bits per try? Let's call it `bitrate`. Serious enough term for further discussion =), isn't it?
How to match particular test? Binary search for hash value of the input?
Please, reveal your super-duper technology with your fancy-nancy metrics.
Edited by author 18.12.2017 22:11
Re: test case 70:
Posted by Shen Yang 19 Dec 2017 05:08
I just use stupid bianry search every veriable and submit many many many times
I don't have better ideas
and I have only test case 70...
Edited by author 19.12.2017 05:09 Thank you for prompt :) But I guess I found one which helped me:
Ships:
93, 93, 93, 93, 93, 93, 93, 93, 93, 93, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 83, 83, 83, 83, 73, 73, 73, 73, 73, 72, 72, 72, 62, 62, 57, 57, 57, 57, 57, 57, 57, 53, 53, 50, 50, 50, 50, 46, 46, 46, 42, 42, 42, 42, 42, 42, 42, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 24, 24, 24, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 10
Rows:
159, 516, 57, 724, 146, 1014, 688, 507, 1039 | | Good test cases | Deepesson | 1609. Tram Tile | 8 Feb 2021 17:48 | 4 | Some good test cases:
2 8
3
01100011
00011000
1 2
0
00
Edited by author 07.02.2021 19:15 8 10
4
0000011000
0000110000
0000011000
0000110000
0000000000
0000000000
0000000000
0000000000
You should also try switching N and M (10 8)
Edited by author 08.02.2021 16:48 10 10
5
0000000000
1000000000
1100000000
0111100000
0010110000
0000000000
0000000000
0000000000
0000000000
0000000000 AC finally!!! I used a randomized approach, but in the end, I needed to use a special seed. Nice problem, but unfortunately, I wasn't able to find test 74 to share here. | | WA 13 | Dias | 1651. Shortest Subchain | 5 Feb 2021 22:21 | 3 | WA 13 Dias 11 May 2010 01:43 Maybe someone could explain why I'm still getting WA 13? On all of tests in this forum i get right answers. Can anyone give more tests? I just figured out that I got WA13 because I assumed that if I get to each node with the minimum steps,I can eventually got to the end point with minimum steps.But this is not always true. Try This test
9
1 2 3 4 1 3 5 6 4
The answers is obviously 1 2 3 4.But my WA13 programme gave the answer 1 3 5 6 4
Hope this helps. I have WA 13 too, but i have correct answer for this test | | Account Related | Abdulla | | 5 Feb 2021 02:54 | 3 | Is there any way I could change my user(Author) name? Update your info -> Login | | Tips | Ruhul Amin | 1209. 1, 10, 100, 1000... | 4 Feb 2021 05:02 | 1 | Tips Ruhul Amin 4 Feb 2021 05:02 The triangular sequence is behind the scene.
n belongs to triangular sequence if and only if (8n+1) is a square. | | No subject | [MAI] do_v_5_strok | 2025. Line Fighting | 3 Feb 2021 21:49 | 1 | Edited by author 03.02.2021 23:21
Edited by author 03.02.2021 23:21
Edited by author 03.02.2021 23:21 | | This problem is so ez, why it has difficulty 2k | Zergatul | 1953. Biggest Inscribed Ellipse | 3 Feb 2021 19:01 | 1 | Few lines of code with no conditions | | Nice one! | bsu.mmf.team | 2134. Stampman | 3 Feb 2021 17:57 | 1 | The most time I consumed was to prove that naive algorithm works here :) | | Why wrong answer? Is author crazy? Code is all right! В чём неправильный ответ? Автор шизик? Код нормальный, и всё правильно. | Vlad Polukarov | 1820. Ural Steaks | 2 Feb 2021 19:39 | 1 | | | Few tests | Zergatul | 2153. Perfect Squad | 1 Feb 2021 19:37 | 1 | 4
WMC
WMC
WMC
WMC
---
3
Looking for rogue
4
WM
WMC
WMR
MR
---
4 | | Texta | Dmitriy | K. Walk Along the Infinite Road | 1 Feb 2021 02:40 | 2 | Texta Dmitriy 31 Jan 2021 17:35 Okey, he lost the page that had the number of the k-th interesting lamppost.
So, the input contains one integer k.
> Output the number of the k-th interesting lamppost.
Sorry, what? What does input `k` mean then?
____
Я вроде бы родился русским, но никак не могу понять условие задачи. Это что, часть задачи - понять что требуется? Да, так и есть. По входным данным надо было понять, что это алгебраческая прогрессия, с шагом в 10074. | | 8 test python 3.6 | roman velichkin | 1196. History Exam | 31 Jan 2021 17:37 | 3 | use sets it's easy with them | | TL 8, хотя разогнал на столько на сколько можно было | Ivan | 1196. History Exam | 31 Jan 2021 17:35 | 4 | Сначала пробовал через множества, потом сократил через map
всегда валился на 8 тесте по времени
Решил напрячься
Сел и написал два модуля, чтобы работать с битами
На преподавателе включаю биты
На студенте проверяю и прибавляю к ответу
Сдаю задачу, уже в предвкушении надписи "Accepted", как тут мои глаза лезут на лоб. Снова "TL8"
Что это за монстр такой этот восьмой тест?) Обычный бинарный поиск в этой задаче же. | | A methodical way to solve(definitely can be improved) using c++ | tdnnojtupbkmuhehvb | 1197. Lonesome Knight | 30 Jan 2021 09:38 | 1 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--){
string s;
int a,b;
cin>>s;
a = s[0]-'a'+1;
b = s[1]-'0';
a = min(a,9-a);
b = min(b,9-b);
if(a==b){
if(a==1) printf("2\n");
else if(a==2) printf("4\n");
else printf("8\n");
} else {
if((a==1&&b==2)||(a==2&&b==1)) printf("3\n");
else if((a==1&&b>=3)||(a>=3&&b==1)) printf("4\n");
else if((a==2&&b>=3)||(a>=3&&b==2)) printf("6\n");
else if(a>2&&b>2)printf("8\n");
}
}
return 0;
} | | Limit for n <= 10^4 in russian version, and n <= 10^5 in english version | c_pp | 1906. The Lost Civilization | 28 Jan 2021 23:16 | 3 | | | How to copy value? | Zergatul | 2028. URCAPL, Episode 2 | 27 Jan 2021 07:01 | 2 | I am stuck with this, it seems impossible to value from input to 2 registers. Ok, you can actually read n from input multiple times. And you can reduce value in current register to zero while increasing 2 (or more) other registers. This leads to copy operation. | | WA#9 | Zergatul | 2027. URCAPL, Episode 1 | 27 Jan 2021 06:11 | 2 | WA#9 Zergatul 30 Nov 2020 03:04 My limit was 10^4, not 10^5 | | If WA 1 | Toshpulatov (MSU Tashkent) | 1732. Ministry of Truth | 26 Jan 2021 08:31 | 1 | If WA 1 Toshpulatov (MSU Tashkent) 26 Jan 2021 08:31 | | WA18 | Ilya Konik | 1593. Square Country. Version 2 | 25 Jan 2021 17:40 | 1 | WA18 Ilya Konik 25 Jan 2021 17:40 Wrong answer 18. Can anybody help me, please? | | Условия | Toshpulatov (MSU Tashkent) | 1487. Chinese Football | 25 Jan 2021 10:58 | 1 | Условия Toshpulatov (MSU Tashkent) 25 Jan 2021 10:58 В задаче сказано, проверить существует ли такая команда 'x' что она обыграет и команду A и команду В, если существует то ответ No иначе YES
в таком случае можно использовать bitset |
|
|
