| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| Weak tests | [ЛЕСТЕХ] UstinovG`~ | 1992. CVS | 13 мар 2023 13:39 | 3 |
All operations except clone work O(1) in my program, but clone works in O(n). Despite that fact, my solution works in 0.218s New tests were added. Thank you.
Edited by author 27.09.2020 14:29 Tests not check memory leaks, but check amount of used memory... Its weard. If you dont copy robot's stacks and just relink pointers, tests not check that you have lost memory
Case
Learn 1 1
Learn 1 2
....
Learn 1 n
Clone 1
Rollback 1
Rollback 2
....
Rollback 1
Rollback 2
Learn 1 1
...
Learn 1 n
In my solution in the end youll have n losted elements and n new elements in 1 robot that is assimptotically equal to copy all stacks |
| If you get WA6 | Denis Koshman | 1463. Радость населению! | 11 мар 2023 15:22 | 2 |
Read problem statement more closely. The graph can be disconnected. Read problem statement more closely. The graph can be disconnected. Really helped me a lot. |
| runtime error python | Vitaly Nedzvetsky | 1493. В одном шаге от счастья | 10 мар 2023 00:23 | 1 |
import sys
num = str(sys.stdin.readline().split()[0])
a = int(num[:3])
b = int(num[3:]) - 1
c = int(num[3:]) + 1
sum0 = sum([int(num) for num in str(a)])
sum1 = sum([int(num) for num in str(b)])
sum2 = sum([int(num) for num in str(c)])
if abs(sum0 - sum1 == 0) or abs(sum0 - sum2 == 0) or abs(sum1 - sum0 == 0) or abs(sum2 - sum0 == 0):
print("Yes")
else:
print("No") |
| Wrong answer UPD: solved | dry9goincer | 1001. Обратный корень | 7 мар 2023 20:37 | 1 |
using System;
public class Reverse
{
private static void Main()
{
string[] numbers = Console.ReadLine().Split(new char[] {' ', '\t', '\n', '\r'}, StringSplitOptions.RemoveEmptyEntries);
for(int i = numbers.Length-1; i >= 0; i--)
{
double result = Math.Sqrt(double.Parse(numbers[i]));
Console.WriteLine($"{result:F4}");
}
}
}
Edited by author 07.03.2023 20:45 |
| What is test 35? | Egor | 1503. Многочлен | 6 мар 2023 02:52 | 1 |
What in 35 test, I always get WA
Edited by author 06.03.2023 04:44
Edited by author 06.03.2023 04:50 |
| Why this is wrong ans in visual C? | Iftekhar | 1209. 1, 10, 100, 1000... | 4 мар 2023 19:16 | 1 |
#include<stdio.h>
#include<math.h>
unsigned long a[70000];
int main()
{
unsigned long i,k,n;
long double l;
scanf("%lu\n",&n);
for(i=0;i<n;i++)
{
scanf("%lu",&a[i]);
}
for(i=0;i<n;i++)
{
l=((sqrt(-7+8*a[i])-1)/ 2);
k=l;
if(l==k)
printf("1 ");
else
printf("0 ");
}
return 0;
} |
| just 12Lines of python | SUBHADEEP MANDAL | 1880. Собственные числа Psych Up | 4 мар 2023 15:34 | 1 |
a=input()
a1=list(map(int,input().split()))
b=input()
b1=list(map(int,input().split()))
c=input()
c1=list(map(int,input().split()))
cnt=0
for i in a1:
if i in b1:
if i in c1:
cnt+=1
print(cnt) |
| WA in test case #37 | Unsocial_A | 2019. Пара: нормальное и паранормальное | 4 мар 2023 12:24 | 3 |
What is test case no #37?Or give me some test case.. Try this: ACbcBaAbCBCa, you definetely can connnect them Not correct test.The sequence has exactly n lowercase letters and exactly n uppercase letters. |
| WA 4 | 👑TIMOFEY👑 | 1037. Управление памятью | 1 мар 2023 18:01 | 1 |
WA 4 👑TIMOFEY👑 1 мар 2023 18:01 dont forget return in your functions |
| TL 8 | 👑TIMOFEY👑 | 1806. Мобильные телеграфы | 28 фев 2023 17:00 | 2 |
TL 8 👑TIMOFEY👑 27 фев 2023 18:02 you need to check, what element exist in your map
Edited by author 28.02.2023 17:06 |
| C++ not pass 2 test | andrey | 1001. Обратный корень | 27 фев 2023 20:43 | 1 |
#include <cstdlib> #include <iomanip> #include <iostream> #include <cstdio> #include <math.h> #include <vector> #include <string.h> #include <algorithm> using namespace std; vector <double> numbers = {}; int main(int argc, const char * argv[]) { double n; while (std::cin >> n) { numbers.push_back(n); if (cin.peek() == '\n' ){ reverse(numbers.begin(),numbers.end()); for(int i = 0;i < numbers.size();++i){ cout<<fixed<<setprecision(4)<<sqrt(numbers[i])<<endl; } break; }; } return 0; } I have a correct answer with input numbers in sample, and i see message "wrong answer" in 2 test. First test was passed, but i don't see where i lose... |
| RE 16 | 👑TIMOFEY👑 | 2152. Таможенные пошлины | 27 фев 2023 18:04 | 1 |
RE 16 👑TIMOFEY👑 27 фев 2023 18:04 I think is bigger problem is surmise, what stoi dont work for long long integers |
| Difficulty is overestimated | Igor Parfenov | 1266. Закон Кирхгоффа | 26 фев 2023 15:23 | 1 |
Seems, programmers just know physics quite poorly)
This is just gauss. But don't forget about multiple edges. |
| Hint | Конобейцев Иван Олегович | 1484. Кинорейтинг | 26 фев 2023 13:14 | 1 |
Hint Конобейцев Иван Олегович 26 фев 2023 13:14 You CAN'T just assume x2 = x + 0.5 because x2 is some INTEGER / n. So max x2 can be x or x + 0.1 + x + 0.38 etc. Took me 15 minutes to ac after I understood it |
| test3??? | vtalgo23_drobysh_333219 | 1155. Дуоны | 25 фев 2023 22:48 | 1 |
test3??? vtalgo23_drobysh_333219 25 фев 2023 22:48 can you please share the Idea of test 3? |
| anyone in O(1) extra space? | Aayush Chaturvedi | 1319. Отель | 24 фев 2023 23:41 | 2 |
Is there a O(1) extra space solution? I tried looking up for patterns but it didn't help. Can we have a function f such that matrix[i][j] = f(i, j, n) for all valid i and j? Still takes more space than some O(N^2) solution i've found for some reasons. I am not really familiar with cpp compiler optimizations, so that might be linked !
#include <iostream>
int main(int argc, char* argv[]) {
int size;
if (argc != 2) {
scanf("%d",&size);
} else {
size = std::atoi(argv[1]);
}
int halfSquare = (size * size) / 2;
int half = size / 2;
int previousY0 = halfSquare - (half) - size;
int previous;
for (int y = 0; y < size; y++) {
previous = previousY0 + (size + 1 - y);
printf("\n%d ", previous);
for (int x = 1; x < size; x++) {
previous = previous - (size - 1 - std::max(std::abs(x - y), 1) + (x >= y));
printf("%d ", previous);
}
previousY0 = previousY0 + (size + 1 - y);
}
return 0;
}
|
| WA10 | andreyDagger`~ | 1281. River Basin | 24 фев 2023 01:09 | 1 |
WA10 andreyDagger`~ 24 фев 2023 01:09 Two segments of rivers (a, b) and (c, d) intersects iff a == c or a == d or b == c or b == d |
| Usefull test | Zombie1995 | 1160. Network | 23 фев 2023 18:55 | 1 |
For me this test was usefull:
7 11
1 2 7
1 4 5
2 4 9
2 3 8
2 5 7
3 5 5
4 5 15
4 6 6
5 6 8
5 7 9
6 7 11 |
| WA 8 test | Конобейцев Иван Олегович | 1534. Гондорский футбол | 23 фев 2023 16:53 | 1 |
WA 8 test Конобейцев Иван Олегович 23 фев 2023 16:53 |
| this problem has incomplete tests | 👑TIMOFEY👑 | 2152. Таможенные пошлины | 23 фев 2023 16:14 | 1 |
mxw can be 1, and all w is about 10^9 and a can be 10^9, then in the worst case we need to withdraw the sum of 10^18 about 10^5 times, so long double should not fit, but it fits |
