If you have an absolutely useless piece of code in your code that is not used anywhere, but it has an error going out of bounds, then this may instead affect the execution of the rest program

Round(time) instead of Ceil(time)

What should i check if i have WA in test 5?

Can't debug it, WA4/6

Delete a rectangle if there is another one covering this one

All the test cases I've come up with have been solved correctly by this method but no AC :(

code:
```
#include <bits/stdc++.h>

using namespace std;

int main() {
  int n;
  cin >> n;

  vector<vector<int>> x(n, vector<int>(3, 0));

  for (int i = 0; i < n; i++) {
    cin >> x[i][0];
    cin >> x[i][1];
    x[i][2] = i + 1;
  }

  sort(x.begin(), x.end());

  auto med = (n - 1) / 2;

  cout << x[med][2] << " " << x[med + 1][2];
}

```

Edited by author 11.11.2024 16:23

Edited by author 11.11.2024 16:23

Test 3 :
input :
5 2
-1 -2 -3 -4 -5
output :
2 4

Test 4 :
input :
2 0
1 -5
output :
0 0

Test 5 :
input :
15 23
252 33 215 789 1000 123 -125 29 -45 -450 121 -555 -72 120 123
output :
23 113

Test 6 :
0 213
output
Impossible

Test 7 :
input :
8 12
1 2 3 4 5 6 7 8
output :
Impossible

Test 10 :
input :
0 0
output :
0 0

Test 15 :
input :
2 12
1000 -1000
output :
12 2012

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;
}