oj.uz

Submission #879923

# Submission time Handle Problem Language Result Execution time Memory
879923 2023-11-28T10:26:46 Z sleepntsheep Stranded Far From Home (BOI22_island) C++17
0 / 100
 78 ms 6000 KB 
#include <iostream>
#include <utility>
#include <vector>
#include <tuple>
#include <algorithm>

int n, m, s[200000], p[200000], q[200000], r[200000];

int f(int x)
{
    int w = x, f = r[x];
    while (p[w] != w) f |= r[w = p[w]];
    while (p[x] != x) r[x] |= f, x = std::exchange(p[x], w);
    return w;
}

void u_(int x, int y)
{
    if ((x = f(x)) == (y = f(y))) return;
    if (q[x] < s[y]) r[x] = 1;
    q[y] += q[x];
    p[x] = y;
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; ++i) scanf("%d", s+i), p[i] = i, q[i] = s[i];
    std::vector<std::tuple<int, int, int>> e(m);
    for (auto &[w, u, v] : e)
    {
        scanf("%d%d", &u, &v);
        if (s[--u] > s[--v]) std::swap(u, v);
        w = s[v];
    }
    std::sort(e.begin(), e.end());
    for (auto [_, u, v] : e) u_(u, v);
    for (int i = 0; i < n; ++i) f(i), putchar(48+!r[i]);

    return 0;
}

Compilation message

island.cpp: In function 'int main()':
island.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
island.cpp:28:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     for (int i = 0; i < n; ++i) scanf("%d", s+i), p[i] = i, q[i] = s[i];
      |                                 ~~~~~^~~~~~~~~~~
island.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         scanf("%d%d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Incorrect 2 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Incorrect 68 ms 6000 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 67 ms 5968 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 78 ms 5972 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Incorrect 2 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -