[1488] Avoid Flood in The City | Together C & C++ | Page 1

valid hearth Apr 26, 2024, 4:00 PM

#

int cmp(const void *a, const void *b) {
    return *(int *)a - *(int *)b;
}

int* avoidFlood(int* rains, int rainsSize, int* returnSize) {
    int *result = (int *)malloc(sizeof(int) * rainsSize);
    int *nextRain = (int *)malloc(sizeof(int) * rainsSize);
    int *fullLakes = (int *)malloc(sizeof(int) * rainsSize);
    int fullLakesSize = 0, nextRainSize = 0;
    memset(result, 0, sizeof(int) * rainsSize);
    memset(nextRain, 0, sizeof(int) * rainsSize);
    memset(fullLakes, 0, sizeof(int) * rainsSize);

    for (int i = 0; i < rainsSize; i++) {
        if (rains[i] > 0) {
            for (int j = 0; j < fullLakesSize; j++) {
                if (fullLakes[j] == rains[i]) {
                    *returnSize = 0;
                    return NULL;
                }
            }
            fullLakes[fullLakesSize++] = rains[i];
            nextRain[nextRainSize++] = i;
            result[i] = -1;
        } else {
            if (nextRainSize == 0) {
                result[i] = 1;
            } else {
                qsort(nextRain, nextRainSize, sizeof(int), cmp);
                int lakeToDry = -1;
                for (int j = 0; j < nextRainSize; j++) {
                    if (rains[nextRain[j]] > 0) {
                        lakeToDry = rains[nextRain[j]];
                        break;
                  }
}
                if (lakeToDry == -1) {
                    result[i] = 1;
                } else {
                    result[i] = lakeToDry;
                    for (int j = 0; j < fullLakesSize; j++) {
                        if (fullLakes[j] == lakeToDry) {
                            fullLakes[j] = fullLakes[--fullLakesSize];
                            break;
}
}
                    for (int j = 0; j < nextRainSize; j++) {
                        if (rains[nextRain[j]] == lakeToDry) {
                            nextRain[j] = nextRain[--nextRainSize];
                            break;
}
}
}
}
}
}

    *returnSize = rainsSize;
    return result;
}

near thunderBOT Apr 26, 2024, 4:00 PM

#

When your question is answered use !solved to mark the question as resolved.

Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For tips on how to ask a good question use !howto ask.

valid hearth Apr 26, 2024, 4:00 PM

#

Wrong Answer
67/82 cases passed (N/A)
Testcase
[1,2,0,2,3,0,1]
Answer
[]
Expected Answer
[-1,-1,2,-1,-1,1,-1]

wary cobalt Apr 26, 2024, 4:12 PM

#

you should really invest in a formatter

valid hearth Apr 26, 2024, 4:26 PM

#

no

#

it's because I can submit 2000 characters

#

https://pastebin.com/h9DHxzH8

Pastebin

int cmp(const void *a, const void *b) { return *(int *)a - *(int...

Pastebin.com is the number one paste tool since 2002. Pastebin is a website where you can store text online for a set period of time.

wary cobalt Apr 26, 2024, 4:29 PM

#

where is the assignment for the exercise ? how are we supposed to know what it should compute ?

valid hearth Apr 26, 2024, 4:29 PM

#

sorry, my mistake: https://leetcode.com/problems/avoid-flood-in-the-city/description/

woven shadow Apr 26, 2024, 4:34 PM

#

You can save some characters by not casting the result of malloc. In C, pointers are coerced to and from void * except in varargs

valid hearth Apr 26, 2024, 4:43 PM

#

what do you mean?

urban vapor Apr 26, 2024, 5:24 PM

#

valid hearth ```c int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }...

!f

near thunderBOT Apr 26, 2024, 5:24 PM

#


int cmp(const void* a, const void* b) {
  return *(int*)a - *(int*)b;
}

int* avoidFlood(int* rains, int rainsSize, int* returnSize) {
  int* result = (int*)malloc(sizeof(int) * rainsSize);
  int* nextRain = (int*)malloc(sizeof(int) * rainsSize);
  int* fullLakes = (int*)malloc(sizeof(int) * rainsSize);
  int fullLakesSize = 0, nextRainSize = 0;
  memset(result, 0, sizeof(int) * rainsSize);
  memset(nextRain, 0, sizeof(int) * rainsSize);
  memset(fullLakes, 0, sizeof(int) * rainsSize);

  for (int i = 0; i < rainsSize; i++) {
    if (rains[i] > 0) {
      for (int j = 0; j < fullLakesSize; j++) {
        if (fullLakes[j] == rains[i]) {
          *returnSize = 0;
          return NULL;
        }
      }
      fullLakes[fullLakesSize++] = rains[i];
      nextRain[nextRainSize++] = i;
      result[i] = -1;
    } else {
      if (nextRainSize == 0) {
        result[i] = 1;
      } else {
        qsort(nextRain, nextRainSize, sizeof(int), cmp);
        int lakeToDry = -1;
        for (int j = 0; j < nextRainSize; j++) {
          if (rains[nextRain[j]] > 0) {
            lakeToDry = rains[nextRain[j]];
            break;
          }
        }
        if (lakeToDry == -1) {
          result[i] = 1;
        } else {
          result[i] = lakeToDry;
          for (int j = 0; j < fullLakesSize; j++) {
            if (fullLakes[j] == lakeToDry) {
              fullLakes[j] = fullLakes[--fullLakesSize];
              break;
            }
          }
          for (int j = 0; j < nextRainSize; j++) {
            if (rains[nextRain[j]] == lakeToDry) {
              nextRain[j] = nextRain[--nextRainSize];
              break;
            }
          }
        }
      }
    }
  }

  *returnSize = rainsSize;
  return result;
}

apspoliveira

valid hearth Apr 27, 2024, 3:41 PM

#

this still does not solve the problem

sour cypress Apr 28, 2024, 2:24 PM

#

valid hearth what do you mean?

They mean that instead of int *nextRain = (int *)malloc(, you can just do int *nextRain = malloc(, since malloc() returns a void *, which doesn't need explicit casting

#

If you still need to figure out the bug, I recommend pressing "Copy Text" on the below code message, so that you can send it yourself here with main() fixed so that it does compile. (If you edit your message after you've sent it, the bot will keep recompiling and running the updated code.)

You can also paste your code into godbolt.org instead, so you don't have to worry about a character limit.

#

;compile -Wall -Wextra -Werror -Wpedantic -fsanitize=address,undefined -g

#include <stdlib.h>
#include <string.h>

int cmp(const void* a, const void* b) {
  return *(int*)a - *(int*)b;
}

int* avoidFlood(int* rains, int rainsSize, int* returnSize) {
  int* result = malloc(sizeof(int) * rainsSize);
  int* nextRain = malloc(sizeof(int) * rainsSize);
  int* fullLakes = malloc(sizeof(int) * rainsSize);
  int fullLakesSize = 0, nextRainSize = 0;
  memset(result, 0, sizeof(int) * rainsSize);
  memset(nextRain, 0, sizeof(int) * rainsSize);
  memset(fullLakes, 0, sizeof(int) * rainsSize);

  for (int i = 0; i < rainsSize; i++) {
    if (rains[i] > 0) {
      for (int j = 0; j < fullLakesSize; j++) {
        if (fullLakes[j] == rains[i]) {
          *returnSize = 0;
          return NULL;
        }
      }
      fullLakes[fullLakesSize++] = rains[i];
      nextRain[nextRainSize++] = i;
      result[i] = -1;
    } else {
      if (nextRainSize == 0) {
        result[i] = 1;
      } else {
        qsort(nextRain, nextRainSize, sizeof(int), cmp);
        int lakeToDry = -1;
        for (int j = 0; j < nextRainSize; j++) {
          if (rains[nextRain[j]] > 0) {
            lakeToDry = rains[nextRain[j]];
            break;
          }
        }
        if (lakeToDry == -1) {
          result[i] = 1;
        } else {
          result[i] = lakeToDry;
          for (int j = 0; j < fullLakesSize; j++) {
            if (fullLakes[j] == lakeToDry) {
              fullLakes[j] = fullLakes[--fullLakesSize];
              break;
            }
          }
          for (int j = 0; j < nextRainSize; j++) {
            if (rains[nextRain[j]] == lakeToDry) {
              nextRain[j] = nextRain[--nextRainSize];
              break;
            }
          }
        }
      }
    }
  }

  *returnSize = rainsSize;
  return result;
}

int main() {
    avoidFlood();
}

grizzled nicheBOT Apr 28, 2024, 2:33 PM

#

Compiler Output

<source>: In function 'main':
<source>:66:5: error: too few arguments to function 'avoidFlood'
   66 |     avoidFlood();
      |     ^~~~~~~~~~
<source>:8:6: note: declared here
    8 | int* avoidFlood(int* rains, int rainsSize, int* returnSize) {
      |      ^~~~~~~~~~
Build failed

#[1488] Avoid Flood in The City