oj.uz

답안 #802460

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
802460 2023-08-02T12:22:29 Z SamAnd 분수 공원 (IOI21_parks) C++17
5 / 100
 1118 ms 125844 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define m_p make_pair
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
const int N = 400005;

int n;
vector<int> g[N];

bool c[N];
void dfs(int x)
{
    c[x] = true;
    for (int i = 0; i < g[x].size(); ++i)
    {
        int h = g[x][i];
        if (c[h])
            continue;
        dfs(h);
    }
}

vector<pair<int, int> > rs;
vector<int> gg[N], gi[N];
void dfs(int x, vector<int>& a, vector<int>& b)
{
    c[x] = true;
    for (int i = 0; i < gg[x].size(); ++i)
    {
        int h = gg[x][i];
        if (a[gi[x][i]] == -1)
        {
            a[gi[x][i]] = rs[x].fi;
            b[gi[x][i]] = rs[x].se;
        }
        if (!c[h])
            dfs(h, a, b);
    }
}

int construct_roads(std::vector<int> x, std::vector<int> y) {
    std::vector<int> u, v, a, b;

    n = sz(x);
    vector<pair<int, int> > p;
    map<pair<int, int>, int> mp;
    for (int i = 0; i < n; ++i)
    {
        p.push_back(m_p(x[i], y[i]));
        mp[m_p(x[i], y[i])] = i;
    }

    int z = 0;
    map<pair<int, int>, int> s;
    for (int i = 0; i < n; ++i)
    {
        int x = p[i].fi;
        int y = p[i].se;
        if (mp.find(m_p(x + 2, y)) != mp.end())
        {
            u.push_back(mp[m_p(x, y)]);
            v.push_back(mp[m_p(x + 2, y)]);
            if (s.find(m_p(x + 1, y + 1)) == s.end())
                s[m_p(x + 1, y + 1)] = z++;
            if (s.find(m_p(x + 1, y - 1)) == s.end())
                s[m_p(x + 1, y - 1)] = z++;
            g[u.back()].push_back(v.back());
            g[v.back()].push_back(u.back());
            gg[s[m_p(x + 1, y + 1)]].push_back(s[m_p(x + 1, y - 1)]);
            gg[s[m_p(x + 1, y - 1)]].push_back(s[m_p(x + 1, y + 1)]);
            gi[s[m_p(x + 1, y + 1)]].push_back(sz(u) - 1);
            gi[s[m_p(x + 1, y - 1)]].push_back(sz(u) - 1);
        }
        if (mp.find(m_p(x, y + 2)) != mp.end())
        {
            u.push_back(mp[m_p(x, y)]);
            v.push_back(mp[m_p(x, y + 2)]);
            if (s.find(m_p(x + 1, y + 1)) == s.end())
                s[m_p(x + 1, y + 1)] = z++;
            if (s.find(m_p(x - 1, y + 1)) == s.end())
                s[m_p(x - 1, y + 1)] = z++;
            g[u.back()].push_back(v.back());
            g[v.back()].push_back(u.back());
            gg[s[m_p(x + 1, y + 1)]].push_back(s[m_p(x - 1, y + 1)]);
            gg[s[m_p(x - 1, y + 1)]].push_back(s[m_p(x + 1, y + 1)]);
            gi[s[m_p(x + 1, y + 1)]].push_back(sz(u) - 1);
            gi[s[m_p(x - 1, y + 1)]].push_back(sz(u) - 1);
        }
    }

    rs.assign(sz(s), m_p(0, 0));
    for (auto it = s.begin(); it != s.end(); ++it)
    {
        rs[it->se] = it->fi;
    }

    dfs(0);
    for (int i = 0; i < n; ++i)
    {
        if (!c[i])
            return 0;
    }

    memset(c, false, sizeof c);
    a.assign(sz(u), -1);
    b.assign(sz(u), -1);
    for (int i = 0; i < z; ++i)
    {
        if (!c[i] && sz(g[i]) == 1)
        {
            dfs(i, a, b);
        }
    }
    for (int i = 0; i < z; ++i)
    {
        if (!c[i])
        {
            dfs(i, a, b);
        }
    }

    build(u, v, a, b);
    return 1;
}

/*
4
2 2
4 2
2 4
4 4
*/

Compilation message

parks.cpp: In function 'void dfs(int)':
parks.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0; i < g[x].size(); ++i)
      |                     ~~^~~~~~~~~~~~~
parks.cpp: In function 'void dfs(int, std::vector<int>&, std::vector<int>&)':
parks.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < gg[x].size(); ++i)
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 28800 KB Output is correct
2 Correct 14 ms 28756 KB Output is correct
3 Correct 13 ms 28372 KB Output is correct
4 Correct 14 ms 28756 KB Output is correct
5 Correct 14 ms 28756 KB Output is correct
6 Correct 14 ms 28400 KB Output is correct
7 Correct 13 ms 28372 KB Output is correct
8 Correct 14 ms 28436 KB Output is correct
9 Correct 461 ms 76616 KB Output is correct
10 Correct 34 ms 33652 KB Output is correct
11 Correct 159 ms 54700 KB Output is correct
12 Correct 43 ms 36164 KB Output is correct
13 Correct 116 ms 47136 KB Output is correct
14 Correct 16 ms 28884 KB Output is correct
15 Correct 17 ms 29184 KB Output is correct
16 Correct 492 ms 74692 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 28800 KB Output is correct
2 Correct 14 ms 28756 KB Output is correct
3 Correct 13 ms 28372 KB Output is correct
4 Correct 14 ms 28756 KB Output is correct
5 Correct 14 ms 28756 KB Output is correct
6 Correct 14 ms 28400 KB Output is correct
7 Correct 13 ms 28372 KB Output is correct
8 Correct 14 ms 28436 KB Output is correct
9 Correct 461 ms 76616 KB Output is correct
10 Correct 34 ms 33652 KB Output is correct
11 Correct 159 ms 54700 KB Output is correct
12 Correct 43 ms 36164 KB Output is correct
13 Correct 116 ms 47136 KB Output is correct
14 Correct 16 ms 28884 KB Output is correct
15 Correct 17 ms 29184 KB Output is correct
16 Correct 492 ms 74692 KB Output is correct
17 Incorrect 14 ms 28868 KB Tree @(3, 3) appears more than once: for edges on positions 1 and 2
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 28800 KB Output is correct
2 Correct 14 ms 28756 KB Output is correct
3 Correct 13 ms 28372 KB Output is correct
4 Correct 14 ms 28756 KB Output is correct
5 Correct 14 ms 28756 KB Output is correct
6 Correct 14 ms 28400 KB Output is correct
7 Correct 13 ms 28372 KB Output is correct
8 Correct 14 ms 28436 KB Output is correct
9 Correct 461 ms 76616 KB Output is correct
10 Correct 34 ms 33652 KB Output is correct
11 Correct 159 ms 54700 KB Output is correct
12 Correct 43 ms 36164 KB Output is correct
13 Correct 116 ms 47136 KB Output is correct
14 Correct 16 ms 28884 KB Output is correct
15 Correct 17 ms 29184 KB Output is correct
16 Correct 492 ms 74692 KB Output is correct
17 Incorrect 14 ms 28868 KB Tree @(3, 3) appears more than once: for edges on positions 1 and 2
18 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 28800 KB Output is correct
2 Correct 14 ms 28756 KB Output is correct
3 Correct 13 ms 28372 KB Output is correct
4 Correct 14 ms 28756 KB Output is correct
5 Correct 14 ms 28756 KB Output is correct
6 Correct 14 ms 28400 KB Output is correct
7 Correct 13 ms 28372 KB Output is correct
8 Correct 14 ms 28436 KB Output is correct
9 Correct 461 ms 76616 KB Output is correct
10 Correct 34 ms 33652 KB Output is correct
11 Correct 159 ms 54700 KB Output is correct
12 Correct 43 ms 36164 KB Output is correct
13 Correct 116 ms 47136 KB Output is correct
14 Correct 16 ms 28884 KB Output is correct
15 Correct 17 ms 29184 KB Output is correct
16 Correct 492 ms 74692 KB Output is correct
17 Incorrect 15 ms 28760 KB Tree @(199999, 3) appears more than once: for edges on positions 0 and 1
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 28800 KB Output is correct
2 Correct 14 ms 28756 KB Output is correct
3 Correct 13 ms 28372 KB Output is correct
4 Correct 14 ms 28756 KB Output is correct
5 Correct 14 ms 28756 KB Output is correct
6 Correct 14 ms 28400 KB Output is correct
7 Correct 13 ms 28372 KB Output is correct
8 Correct 14 ms 28436 KB Output is correct
9 Correct 461 ms 76616 KB Output is correct
10 Correct 34 ms 33652 KB Output is correct
11 Correct 159 ms 54700 KB Output is correct
12 Correct 43 ms 36164 KB Output is correct
13 Correct 116 ms 47136 KB Output is correct
14 Correct 16 ms 28884 KB Output is correct
15 Correct 17 ms 29184 KB Output is correct
16 Correct 492 ms 74692 KB Output is correct
17 Incorrect 1118 ms 125844 KB Tree @(100001, 3) appears more than once: for edges on positions 31819 and 138412
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 28800 KB Output is correct
2 Correct 14 ms 28756 KB Output is correct
3 Correct 13 ms 28372 KB Output is correct
4 Correct 14 ms 28756 KB Output is correct
5 Correct 14 ms 28756 KB Output is correct
6 Correct 14 ms 28400 KB Output is correct
7 Correct 13 ms 28372 KB Output is correct
8 Correct 14 ms 28436 KB Output is correct
9 Correct 461 ms 76616 KB Output is correct
10 Correct 34 ms 33652 KB Output is correct
11 Correct 159 ms 54700 KB Output is correct
12 Correct 43 ms 36164 KB Output is correct
13 Correct 116 ms 47136 KB Output is correct
14 Correct 16 ms 28884 KB Output is correct
15 Correct 17 ms 29184 KB Output is correct
16 Correct 492 ms 74692 KB Output is correct
17 Incorrect 14 ms 28868 KB Tree @(3, 3) appears more than once: for edges on positions 1 and 2
18 Halted 0 ms 0 KB -