Send me the answer or I'll kick you!

Почему задачу 1785 нельзя отправить на проверку и почитать её условие, однако она идёт в зачет количества решенных задач?

Чтобы новые пользователи никогда не могли решить все задачи? Так что ли?

Hi,

I've got a compilation error in Rust (id: 10760679) because of a feature that appears in edition 2021, and the compiler on Timus uses some previous edition. Any plans to compile Rust code in edition 2021? It's already 2024 and the edition is stable (in fact, a newer edition will be released in several months), so it makes no sense to stick to an older edition.

Starting from my second attempt (first was WA) I am always getting "Checker failed" independently of the code. Even, if I submit the first attempt's code, which was WA.

Sqrtl is inaccurate, check the numbers next to it

I think, you should delete old segment before add new. I had wa14 until i do this and get AC)
вообще, в чем смысл писать на английском, если подовляющее большинство посетителе сайта знают русский? кароч, я не смог придумать тест который у меня бы все ломал, но когда поправил эту багу, все стало хорошо)

Edited by author 10.08.2025 21:25

How can I improve memory usage in this code?

#include "bits/stdc++.h"

using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    short n;
    cin >> n;

    vector<pair<int,short>> s(n, pair<int,int>());

    for (int i = 0; i < n; i ++) {
        cin >> s[i].first;
        s[i].second = i;
    }

    sort(begin(s),end(s));
    for (short i = 1; i < n; i ++) {
        if (s[i].first == s[i - 1].first) {
            s.erase(begin(s) + i);
            n --;
            i --;
        }
    }

    vector<vector<short>> dp(n + 1, vector<short>(n + 1, 0));

    for (short i = 1; i < n - 1; i ++) {
        short l = i - 1;
        short r = i + 1;
        while (0 <= l && r < n) {
            int dfl = s[i].first - s[l].first;
            int dfr = s[r].first - s[i].first;
            if (dfl == dfr) {
                dp[i][r] = dp[l][i] + 1;
                l --;
                r ++;
            } else if (dfl > dfr) {
                r ++;
            } else {
                l --;
            }
        }
    }

    if (1 == n) {
        cout << "1\n1\n";
    } else {
        short mx = -1;
        short di = 0;
        short dj = 0;

        for (int i = 0; i < n - 1; i ++) {
            for (int j = i + 1; j < n; j ++) {
                if (dp[i][j] >= mx) {
                    mx = dp[i][j];
                    di = i;
                    dj = j;
                }
            }
        }

        int df = s[dj].first - s[di].first;

        mx += 2;

        cout << mx << '\n';

        for (; -1 < di;) {
            cout << s[dj].second + 1 << ' ';
            dj = di;
            di = -1;
            for (short i = 0; i < dj; i ++) {
                if (s[dj].first - s[i].first == df) {
                    di = i;
                    break;
                }
            }
        }

        cout << s[dj].second + 1 << '\n';
    }
}

Could you please give any hints or tests?

#include <iostream>
using namespace std;

int main()
{
    int n;
    cin >> n;
    long a = 1;
    long b = 1;
    long ans = 0;
    if(n == 1 || n == 2){
        ans = 1;
    }
    else {
        while (n - 2 > 0){
            ans = a + b;
            a = b;
            b = ans;
            n--;
        }
    }

    cout << 2 * ans;
    return 0;
}

If you have "Time limit exceeded", just use sys.stdin.read()... and it will put load on memory, as I suppose reading huge amount of data via input() takes forever.

Стал изучать программирование только для того, чтобы кекать с таких заданий

N = int(input())
p = []
maxi = 0

for i in range(N):
    p.append(int(input()))

summi = sum(p)
for i in range(N):
  fsummi = sum(p[i:len(p)-i-1])
  if fsummi > maxi and fsummi>summi :
      maxi = fsummi

maxi2 = 0
for i in range(0, N-1):
  nsummi = sum(p[i::])
  jsummi=summi-nsummi
  if nsummi > jsummi:
    maxi2 = nsummi
  else:
    maxi2 = jsummi

if maxi>maxi2:
  print(maxi)
elif summi> maxi and summi>maxi2:
  print(summi)
else:
  print(maxi2)

Вобщем безнадега какая-то

Edited by author 25.04.2007 01:26

btw, random work, but that not just Monte-Carlo

Many people has already written about it, but... I really don't understand why I get WA. My program pass all tests here. Please, help to find bug.
--

Edited by author 29.07.2016 15:52

0 0
10 0
10 10
0 10
10 10 11
0 -10

Ans: 11.3731475899

0 0
10 0
10 10
0 10
10 10 10
-10 -10

Ans: 22.3606797750

Edited by author 23.10.2024 20:18