oj.uz

답안 #1053270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053270 2024-08-11T10:11:42 Z aykhn 분수 공원 (IOI21_parks) C++17
5 / 100
 688 ms 63864 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 259 ms 32128 KB Output is correct
10 Correct 11 ms 3676 KB Output is correct
11 Correct 82 ms 17332 KB Output is correct
12 Correct 17 ms 5464 KB Output is correct
13 Correct 62 ms 13000 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 884 KB Output is correct
16 Correct 265 ms 32112 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 259 ms 32128 KB Output is correct
10 Correct 11 ms 3676 KB Output is correct
11 Correct 82 ms 17332 KB Output is correct
12 Correct 17 ms 5464 KB Output is correct
13 Correct 62 ms 13000 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 884 KB Output is correct
16 Correct 265 ms 32112 KB Output is correct
17 Correct 1 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 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Runtime error 103 ms 33860 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 259 ms 32128 KB Output is correct
10 Correct 11 ms 3676 KB Output is correct
11 Correct 82 ms 17332 KB Output is correct
12 Correct 17 ms 5464 KB Output is correct
13 Correct 62 ms 13000 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 884 KB Output is correct
16 Correct 265 ms 32112 KB Output is correct
17 Correct 1 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 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Runtime error 103 ms 33860 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 259 ms 32128 KB Output is correct
10 Correct 11 ms 3676 KB Output is correct
11 Correct 82 ms 17332 KB Output is correct
12 Correct 17 ms 5464 KB Output is correct
13 Correct 62 ms 13000 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 884 KB Output is correct
16 Correct 265 ms 32112 KB Output is correct
17 Correct 1 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 630 ms 51140 KB Output is correct
21 Runtime error 93 ms 36196 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 259 ms 32128 KB Output is correct
10 Correct 11 ms 3676 KB Output is correct
11 Correct 82 ms 17332 KB Output is correct
12 Correct 17 ms 5464 KB Output is correct
13 Correct 62 ms 13000 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 884 KB Output is correct
16 Correct 265 ms 32112 KB Output is correct
17 Correct 688 ms 63864 KB Output is correct
18 Correct 614 ms 63856 KB Output is correct
19 Runtime error 97 ms 36232 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 259 ms 32128 KB Output is correct
10 Correct 11 ms 3676 KB Output is correct
11 Correct 82 ms 17332 KB Output is correct
12 Correct 17 ms 5464 KB Output is correct
13 Correct 62 ms 13000 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 884 KB Output is correct
16 Correct 265 ms 32112 KB Output is correct
17 Correct 1 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 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Runtime error 103 ms 33860 KB Execution killed with signal 6
24 Halted 0 ms 0 KB -