| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| Slight Clarification | SquidBoy | 2056. Стипендия | 1 апр 2024 13:02 | 3 |
It took me a while to get this one correct, and it's because I found part of the descritpion to be ambiguous/unclear - so I'm posting this clarification which hopefully will help anyone else who has the same misunderstanding.
"if a student has got satisfactory marks, the scholarship is not given, "
I read this to mean "got ONLY satisfactory marks" but my solutions were rejected.
Once I modified my solution to treat it as "got ANY satisfactory marks", the solution was accepted. |
| Check this test case to avoid WA #4 | Newaz | 1581. Работа в команде | 1 апр 2024 11:04 | 1 |
First time I've got WA #4 because of this test case:
Input:
6
1 1 2 1 1 1
Correct answer:
2 1 1 2 3 1 |
| Solution idea in C++ | Newaz | 1585. Пингвины | 1 апр 2024 10:04 | 1 |
Instead of using getline(cin, str), use two different string such as string s1, s2.
Then compare s1! |
| Wrong test cases | pocochuk | 1984. Охранник компота | 29 мар 2024 08:40 | 1 |
When n > 6 the cases are wrong. Try to do it without placing a circle in the center. |
| Test 42 | BENDER | 1014. Произведение цифр | 29 мар 2024 02:32 | 2 |
How is it POSSIBLE to find 42 test case?
It seems like everything should work fine.. OK, found my mistake. 777&222 would be very helpful test cases) |
| solved | Jakub Minarik | 1000. A+B Problem | 28 мар 2024 16:13 | 1 |
solved Jakub Minarik 28 мар 2024 16:13 already done. for someone who doesn't know how to do it:
a,b = input().split()
print(int(a)+int(b))
a = int(1)
b = int(5)
Edited by author 28.03.2024 16:23 |
| Is the segment close or open? | Ade | 1469. Не курить! | 28 мар 2024 08:06 | 2 |
What the output of?
2
0 0 1 1
1 1 2 2
|
| WA in 11 test help please | Nabi | 1469. Не курить! | 28 мар 2024 08:03 | 2 |
i used redblack tree on python and using a quick input using stdin
i passed test 8 time limit and met evening at 11 ok, it was a perpendicular but what about 15 test |
| Use cstdio | pocochuk | 1306. Медиана последовательности | 27 мар 2024 05:35 | 1 |
|
| The most stupid solution | andreyDagger`~ | 1621. Definite Integral | 23 мар 2024 21:40 | 1 |
Just run Simpson's method, you will only need to find suitable "a", "b" and "N" parameters, but it can be done easily with trial and error method |
| How to solve it without BigDecimal? | gerind | 1814. Цепная дробь | 22 мар 2024 17:26 | 2 |
|
| Who can explain the right solution?(-) | Programmer | 1735. Похищение века | 22 мар 2024 07:53 | 2 |
|
| WA5 Python | Shepeleva Elena | 1037. Управление памятью | 21 мар 2024 22:28 | 1 |
class MemoryManager:
def __init__(self, n, t):
self.n = n
self.t = t
self.blocks = {}
self.free_blocks = set(range(1, n + 1))
def allocate_block(self, time):
block = min(self.free_blocks)
self.free_blocks.remove(block)
self.blocks[block] = time + self.t
return block
def access_block(self, time, block_no):
if block_no in self.blocks and self.blocks[block_no] >= time:
return '+'
else:
return '-'
n = 30000
t = 10
memory_manager = MemoryManager(n, t)
queries = input().strip()
for query in queries:
query_type = query[0]
time = query[1]
if query_type == '+':
print(memory_manager.allocate_block(time))
elif query_type == '.':
block_no = query[2]
print(memory_manager.access_block(time, block_no)) |
| Can anyone explain to me the input ? | Nguyen Khac Tung | 1878. Кубик Рубинчика | 17 мар 2024 22:20 | 2 |
I don't understand how to translate them to the initial state . Tks This is 4 layered Rubics Cube. These layers are situated behind each other (perpendicularly). You can think them as 4 Cards placed behind each other.
Also, each layer is transparent. So, color on the second, third or fourth layer can be seen through the first layer.
Top View is watching the cube from the first layer. As all the layers are transparent, so we can see the colors of each layer behind it from the first layer.
So, from the TOP VIEW you will see a complete cube combining each layer's colors.
In the description, the first picture is the 4 layers of the cube. Can you place them behind each other? What will you see if you observe them from the first layer and considering them as transparent?
If you see them like below, then bingo you get the idea!!
YRYB
RRYY
GGBB
RGBG
Here, the first Y and the last B color of the first row are coming from the 4th layer if you see. And so on for the rests.
In the given input, let say the color code is like below,
1 - Red
2 - Yellow
3 - Blue
4 - Green.
So, the input basically says that what you will see all the layers from the front of the first layer.
If you replaced the number with the color, then you will get the exact same cube that is given in the description. (We have already built it above!!) |
| Idea | InstouT94 | 2166. Две дороги | 16 мар 2024 20:49 | 1 |
Idea InstouT94 16 мар 2024 20:49 I haven't coded my idea yet, but it looks plausible. We can use the idea of binsearch by answer. For a fixed cost x, we need to check that all intersection points are inside a square with center (0;0) and side length x*sqrt(2), rotated at an angle of 45 degrees. That is, there are no points of intersection of lines outside the square. Let us cut out the area of intersection with the square for each straight line, then each straight line will be divided into no more than two parts. Then we apply the idea of solving problem 1469. And the complexity will be O(log(max_answer)*n*log(n)). |
| HINT | Dhaval Rathod | 1742. Тим-билдинг | 15 мар 2024 22:33 | 2 |
HINT Dhaval Rathod 26 фев 2022 23:07 first make a SCC , u will get max
iterate through scc graph root nodes and in dfs the node size is great than 2 increment answer u will get min is great than 2 no, great than 1! I got AC using it |
| WA8 | Kruppov07 | 1014. Произведение цифр | 15 мар 2024 16:12 | 2 |
WA8 Kruppov07 14 июн 2020 16:47 150 : 556
Edited by author 14.06.2020 17:05 Re: WA8 Dmitry Zhukov 15 мар 2024 16:12 There is another interesting test case that might be a cause of WA8. Try 12, and the right answer should be 26.
Edited by author 15.03.2024 16:13 |
| WA #3 :( | Rafal | 1269. Антимат | 15 мар 2024 14:29 | 8 |
Hi. Any ideas what they put inside the test file to #3? У меня этот тест проходит :(, но WA 3...
Может кто-нибудь помочь с тестом? I have passed your test,but I still WA#3.Why?
Read badwords with spaces, so:
'this is badword'
not:
this
is
badword
:) changes nothing, still wrong answer Could be space trimming of right side or left side a problem... Hi. Any ideas what they put inside the test file to #3? |
| Hint | pocochuk | 1152. Кривые зеркала | 14 мар 2024 00:30 | 1 |
Hint pocochuk 14 мар 2024 00:30 Use dp + bitmask. I got AC in 0.015 and 1M
Edited by author 14.03.2024 00:30 |
| Works good for my local, why it returns a wrong result? | satybal | 1910. Руины титанов: сокрытый вход | 13 мар 2024 16:51 | 1 |
#include <iostream>
using namespace std;
int main() {
double n, k1, k2, k3, pos = 2, current_pos = 2, oldsum = 0;
cin >> n;
cin >> k1 >> k2;
while (cin >> k3) {
double sum = k1 + k2 + k3;
if (sum > oldsum) {
oldsum = sum;
pos = current_pos;
}
k1 = k2; k2 = k3; ++current_pos;
}
cout << oldsum << " " << pos;
return 0;
} |
