oj.uz

Submission #770863

# Submission time Handle Problem Language Result Execution time Memory
770863 2023-07-02T05:07:32 Z marvinthang Fountain Parks (IOI21_parks) C++17
45 / 100
 323 ms 41980 KB 
/*************************************
*    author: marvinthang             *
*    created: 02.07.2023 11:47:17    *
*************************************/

#include "parks.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

struct DisjointSet {
    
    int n, *lab = nullptr;

    DisjointSet(int _n = 0) {
        resize(_n);
    }

    void reset(void) {
        memset(lab, -1, (n + 1) * sizeof(int));
    }

    void resize(int _n) {
         if (lab != nullptr) delete[] lab;
         n = _n;
         lab = new int[n + 1];
         reset();
    }

    int find(int u) {
        assert(u <= n);
        return lab[u] < 0 ? u : lab[u] = find(lab[u]);
    }

    bool connected(int u, int v) { return find(u) == find(v); }
    bool isRoot(int u) { return lab[u] < 0; }
    int size(int u) { return -lab[find(u)]; }

    bool join(int u, int v) {
        if ((u = find(u)) == (v = find(v))) return false;
        if (lab[u] > lab[v]) swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        return true;
    }

};

using DSU = DisjointSet;

int construct_roads(vector <int> x, vector <int> y) {
    int n = x.size();
    map <pair <int, int>, int> id;
    vector <pair <int, int>> p;
    REP(i, n) {
        p.emplace_back(x[i], y[i]);
        id[p.back()] = i;
    }
    sort(ALL(p));
    vector <int> U, V, A, B;
    set <pair <int, int>> used;
    DSU dsu(n);
    auto addEdge = [&] (int u, int v, int a, int b) {
        if (!~u || !~v || !dsu.join(u, v) || !used.insert(make_pair(a, b)).se) return false;
        U.push_back(u);
        V.push_back(v);
        A.push_back(a);
        B.push_back(b);
        return true;
    };
    for (auto [x, y]: p) {
        int a = id[make_pair(x, y)];
        int b = id.count(make_pair(x - 2, y)) ? id[make_pair(x - 2, y)] : -1;
        int c = id.count(make_pair(x, y - 2)) ? id[make_pair(x, y - 2)] : -1;
        if (x + y & 3) {
            addEdge(a, b, x - 1, y - 1);
            addEdge(a, c, x + 1, y - 1);
        } else {
            addEdge(a, c, x - 1, y - 1);
            addEdge(a, b, x - 1, y + 1);
        }
    }
    if (U.size() != n - 1) return 0;
    build(U, V, A, B);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:110:15: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
  110 |         if (x + y & 3) {
      |             ~~^~~
parks.cpp:118:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  118 |     if (U.size() != n - 1) return 0;
      |         ~~~~~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 132 ms 20072 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 55 ms 10900 KB Output is correct
12 Correct 15 ms 3276 KB Output is correct
13 Correct 35 ms 7480 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 144 ms 20112 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 132 ms 20072 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 55 ms 10900 KB Output is correct
12 Correct 15 ms 3276 KB Output is correct
13 Correct 35 ms 7480 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 144 ms 20112 KB Output is correct
17 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 132 ms 20072 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 55 ms 10900 KB Output is correct
12 Correct 15 ms 3276 KB Output is correct
13 Correct 35 ms 7480 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 144 ms 20112 KB Output is correct
17 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 132 ms 20072 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 55 ms 10900 KB Output is correct
12 Correct 15 ms 3276 KB Output is correct
13 Correct 35 ms 7480 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 144 ms 20112 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 287 ms 41920 KB Output is correct
21 Correct 299 ms 41496 KB Output is correct
22 Correct 294 ms 41436 KB Output is correct
23 Correct 237 ms 34916 KB Output is correct
24 Correct 159 ms 20028 KB Output is correct
25 Correct 263 ms 32676 KB Output is correct
26 Correct 216 ms 32620 KB Output is correct
27 Correct 279 ms 39964 KB Output is correct
28 Correct 267 ms 40008 KB Output is correct
29 Correct 294 ms 40048 KB Output is correct
30 Correct 313 ms 39992 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 17 ms 3264 KB Output is correct
33 Correct 85 ms 10504 KB Output is correct
34 Correct 279 ms 41920 KB Output is correct
35 Correct 10 ms 1876 KB Output is correct
36 Correct 65 ms 8596 KB Output is correct
37 Correct 137 ms 16856 KB Output is correct
38 Correct 106 ms 17044 KB Output is correct
39 Correct 151 ms 22956 KB Output is correct
40 Correct 201 ms 30248 KB Output is correct
41 Correct 282 ms 35748 KB Output is correct
42 Correct 323 ms 41980 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 296 KB Output is correct
50 Correct 0 ms 300 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 2 ms 568 KB Output is correct
55 Correct 3 ms 724 KB Output is correct
56 Correct 120 ms 20080 KB Output is correct
57 Correct 209 ms 29716 KB Output is correct
58 Correct 228 ms 29724 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 311 ms 40100 KB Output is correct
63 Correct 289 ms 40136 KB Output is correct
64 Correct 277 ms 39968 KB Output is correct
65 Correct 3 ms 852 KB Output is correct
66 Correct 7 ms 1492 KB Output is correct
67 Correct 123 ms 19956 KB Output is correct
68 Correct 207 ms 30584 KB Output is correct
69 Correct 299 ms 40140 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 132 ms 20072 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 55 ms 10900 KB Output is correct
12 Correct 15 ms 3276 KB Output is correct
13 Correct 35 ms 7480 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 144 ms 20112 KB Output is correct
17 Correct 310 ms 40820 KB Output is correct
18 Correct 299 ms 41140 KB Output is correct
19 Correct 312 ms 41372 KB Output is correct
20 Correct 301 ms 39076 KB Output is correct
21 Correct 259 ms 35288 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 37 ms 6888 KB Output is correct
24 Correct 19 ms 3656 KB Output is correct
25 Correct 88 ms 12360 KB Output is correct
26 Correct 149 ms 20088 KB Output is correct
27 Correct 140 ms 20976 KB Output is correct
28 Correct 179 ms 26336 KB Output is correct
29 Correct 214 ms 32136 KB Output is correct
30 Correct 272 ms 36448 KB Output is correct
31 Correct 310 ms 41960 KB Output is correct
32 Correct 296 ms 40028 KB Output is correct
33 Correct 288 ms 40128 KB Output is correct
34 Correct 4 ms 1108 KB Output is correct
35 Correct 8 ms 1704 KB Output is correct
36 Correct 122 ms 19960 KB Output is correct
37 Correct 212 ms 30536 KB Output is correct
38 Correct 285 ms 40084 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 132 ms 20072 KB Output is correct
10 Correct 9 ms 2308 KB Output is correct
11 Correct 55 ms 10900 KB Output is correct
12 Correct 15 ms 3276 KB Output is correct
13 Correct 35 ms 7480 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 144 ms 20112 KB Output is correct
17 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -