oj.uz

Submission #1053273

# Submission time Handle Problem Language Result Execution time Memory
1053273 2024-08-11T10:12:26 Z aykhn Fountain Parks (IOI21_parks) C++17
5 / 100
 598 ms 64036 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;

int A[4] = {0, 0, 2, -2};
int B[4] = {2, -2, 0, 0};
array<int, 2> ben[4][2] = {{{-1, 1}, {1, 1}}, {{-1, -1}, {1, -1}}, {{1, 1}, {1, -1}}, {{-1, 1}, {-1, -1}}};

struct DSU
{
    vector<int> e;
    void init(int n)
    {
        e.assign(n, -1);
    }
    int get(int x)
    {
        if (e[x] < 0) return x;
        return e[x] = get(e[x]);
    }
    void unite(int x, int y)
    {
        x = get(x), y = get(y);
        if (x == y) return;
        if (e[x] > e[y]) swap(x, y);
        e[x] += e[y];
        e[y] = x;
    }
};

int construct_roads(vector<int> X, vector<int> Y) 
{
    map<array<int, 2>, int> mp, us;
    for (int i = 0; i < X.size(); i++) mp[{X[i], Y[i]}] = i + 1;
    vector<int> u, v, a, b;
    DSU dsu;
    dsu.init(X.size());
    for (int i = 0; i < X.size(); i++)
    {
        int x = X[i], y = Y[i];
        for (int k = 0; k < 4; k++)
        {
            int x1 = x + A[k], y1 = y + B[k];
            if (!mp[{x1, y1}] || mp[{x1, y1}] < i + 1) continue;
            u.push_back(i), v.push_back(mp[{x1, y1}] - 1);
            dsu.unite(i, mp[{x1, y1}] - 1);
            for (array<int, 2> &j : ben[k])
            {
                int a1 = x + j[0], b1 = y + j[1];
                if (!us[{a1, b1}])
                {
                    a.push_back(a1);
                    b.push_back(b1);
                    us[{a1, b1}] = 1;
                    break;
                }
            }
            // assert(a.size() == u.size());
        }
    }
    for (int i = 0; i < X.size(); i++)
    {
        if (dsu.get(i) != dsu.get(0)) 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:35:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (int i = 0; i < X.size(); i++) mp[{X[i], Y[i]}] = i + 1;
      |                     ~~^~~~~~~~~~
parks.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for (int i = 0; i < X.size(); i++)
      |                     ~~^~~~~~~~~~
parks.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for (int i = 0; i < X.size(); i++)
      |                     ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 223 ms 32080 KB Output is correct
10 Correct 10 ms 3672 KB Output is correct
11 Correct 77 ms 17324 KB Output is correct
12 Correct 16 ms 5464 KB Output is correct
13 Correct 60 ms 12936 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 228 ms 32060 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 223 ms 32080 KB Output is correct
10 Correct 10 ms 3672 KB Output is correct
11 Correct 77 ms 17324 KB Output is correct
12 Correct 16 ms 5464 KB Output is correct
13 Correct 60 ms 12936 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 228 ms 32060 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 562 ms 52496 KB Wrong answer detected in grader
24 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 223 ms 32080 KB Output is correct
10 Correct 10 ms 3672 KB Output is correct
11 Correct 77 ms 17324 KB Output is correct
12 Correct 16 ms 5464 KB Output is correct
13 Correct 60 ms 12936 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 228 ms 32060 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 562 ms 52496 KB Wrong answer detected in grader
24 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 223 ms 32080 KB Output is correct
10 Correct 10 ms 3672 KB Output is correct
11 Correct 77 ms 17324 KB Output is correct
12 Correct 16 ms 5464 KB Output is correct
13 Correct 60 ms 12936 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 228 ms 32060 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 530 ms 51320 KB Output is correct
21 Incorrect 440 ms 45972 KB Wrong answer detected in grader
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 223 ms 32080 KB Output is correct
10 Correct 10 ms 3672 KB Output is correct
11 Correct 77 ms 17324 KB Output is correct
12 Correct 16 ms 5464 KB Output is correct
13 Correct 60 ms 12936 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 228 ms 32060 KB Output is correct
17 Correct 593 ms 63656 KB Output is correct
18 Correct 598 ms 64036 KB Output is correct
19 Incorrect 445 ms 47272 KB Wrong answer detected in grader
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 223 ms 32080 KB Output is correct
10 Correct 10 ms 3672 KB Output is correct
11 Correct 77 ms 17324 KB Output is correct
12 Correct 16 ms 5464 KB Output is correct
13 Correct 60 ms 12936 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 228 ms 32060 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Incorrect 562 ms 52496 KB Wrong answer detected in grader
24 Halted 0 ms 0 KB -