oj.uz

답안 #623182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623182 2022-08-05T09:42:47 Z Hanksburger 분수 공원 (IOI21_parks) C++17
15 / 100
 297 ms 52192 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > vec[200005], edge;
vector<int> adj[200005], U, V, A, B;
map<pair<int, int>, bool> mp;
bool visited[200005];
queue<int> q;
int construct_roads(vector<int> X, vector<int> Y)
{
    int N=X.size();
    for (int i=0; i<N; i++)
        vec[Y[i]].push_back({X[i], i});
    for (int i=2; i<=2e5; i+=2)
    {
        if (vec[i].empty())
            continue;
        sort(vec[i].begin(), vec[i].end());
        if (vec[i].size()==1)
        {
            int ind=-1;
            for (int j=0; j<vec[i-2].size(); j++)
            {
                if (vec[i-2][j].first==vec[i][0].first)
                {
                    ind=j;
                    break;
                }
            }
            if (ind>=0)
                edge.push_back({vec[i-2][ind].second, vec[i][0].second});
        }
        else if (vec[i].size()==2)
        {
            if (vec[i][0].first==2 && vec[i][1].first==4)
            {
                int ind=-1;
                for (int j=0; j<vec[i-2].size(); j++)
                {
                    if (vec[i-2][j].first<=4)
                    {
                        ind=j;
                        break;
                    }
                }
                if (ind>=0)
                {
                    if (vec[i-2][ind].first==2)
                        edge.push_back({vec[i-2][ind].second, vec[i][0].second});
                    else
                        edge.push_back({vec[i-2][ind].second, vec[i][1].second});
                }
            }
            else if (vec[i][0].first==4 && vec[i][1].first==6)
            {
                int ind=-1;
                for (int j=0; j<vec[i-2].size(); j++)
                    if (vec[i-2][j].first>=4)
                        ind=j;
                if (ind>=0)
                {
                    if (vec[i-2][ind].first==4)
                        edge.push_back({vec[i-2][ind].second, vec[i][0].second});
                    else
                        edge.push_back({vec[i-2][ind].second, vec[i][1].second});
                }
            }
            else
            {
                for (int k=0; k<2; k++)
                {
                    int ind=-1;
                    for (int j=0; j<vec[i-2].size(); j++)
                    {
                        if (vec[i-2][j].first==vec[i][k].first)
                        {
                            ind=j;
                            break;
                        }
                    }
                    if (ind>=0)
                        edge.push_back({vec[i-2][ind].second, vec[i][k].second});
                }
            }
        }
        else
        {
            if (vec[i-2].size())
            {
                if (vec[i-2][0].first==2)
                    edge.push_back({vec[i-2][0].second, vec[i][0].second});
                else if (vec[i-2][vec[i-2].size()-1].first==6)
                    edge.push_back({vec[i-2][vec[i-2].size()-1].second, vec[i][2].second});
                else
                    edge.push_back({vec[i-2][0].second, vec[i][1].second});
            }
        }
        if (vec[i].size()==2)
        {
            if (vec[i][0].first+2==vec[i][1].first)
                edge.push_back({vec[i][0].second, vec[i][1].second});
        }
        else if (vec[i].size()==3)
        {
            edge.push_back({vec[i][0].second, vec[i][1].second});
            edge.push_back({vec[i][1].second, vec[i][2].second});
        }
    }
    for (int i=0; i<edge.size(); i++)
    {
        int u=edge[i].first, v=edge[i].second;
        adj[u].push_back(v);
        adj[v].push_back(u);
        U.push_back(u);
        V.push_back(v);
        if (X[u]==X[v])
        {
            if (mp[{X[u]-1, Y[u]+1}])
            {
                A.push_back(X[u]+1);
                B.push_back(Y[u]+1);
                mp[{X[u]+1, Y[u]+1}]=1;
            }
            else
            {
                A.push_back(X[u]-1);
                B.push_back(Y[u]+1);
                mp[{X[u]-1, Y[u]+1}]=1;
            }
        }
        else
        {
            if (mp[{X[u]+1, Y[u]-1}])
            {
                A.push_back(X[u]+1);
                B.push_back(Y[u]+1);
                mp[{X[u]+1, Y[u]+1}]=1;
            }
            else
            {
                A.push_back(X[u]+1);
                B.push_back(Y[u]-1);
                mp[{X[u]+1, Y[u]-1}]=1;
            }
        }
    }
    q.push(0);
    visited[0]=1;
    while (!q.empty())
    {
        int u=q.front();
        q.pop();
        for (int v:adj[u])
        {
            if (!visited[v])
            {
                q.push(v);
                visited[v]=1;
            }
        }
    }
    for (int i=0; i<N; i++)
        if (!visited[i])
            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:22:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |             for (int j=0; j<vec[i-2].size(); j++)
      |                           ~^~~~~~~~~~~~~~~~
parks.cpp:38:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |                 for (int j=0; j<vec[i-2].size(); j++)
      |                               ~^~~~~~~~~~~~~~~~
parks.cpp:57:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |                 for (int j=0; j<vec[i-2].size(); j++)
      |                               ~^~~~~~~~~~~~~~~~
parks.cpp:73:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |                     for (int j=0; j<vec[i-2].size(); j++)
      |                                   ~^~~~~~~~~~~~~~~~
parks.cpp:109:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |     for (int i=0; i<edge.size(); i++)
      |                   ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9696 KB Output is correct
3 Correct 6 ms 9660 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9612 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 127 ms 30680 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 20884 KB Output is correct
12 Correct 21 ms 12876 KB Output is correct
13 Correct 33 ms 17004 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 121 ms 30640 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9696 KB Output is correct
3 Correct 6 ms 9660 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9612 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 127 ms 30680 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 20884 KB Output is correct
12 Correct 21 ms 12876 KB Output is correct
13 Correct 33 ms 17004 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 121 ms 30640 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9696 KB Output is correct
23 Correct 295 ms 48796 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 7 ms 9908 KB Output is correct
26 Correct 7 ms 10068 KB Output is correct
27 Correct 8 ms 10196 KB Output is correct
28 Correct 92 ms 25216 KB Output is correct
29 Correct 155 ms 33040 KB Output is correct
30 Correct 212 ms 41212 KB Output is correct
31 Correct 273 ms 48772 KB Output is correct
32 Correct 6 ms 9684 KB Output is correct
33 Correct 6 ms 9684 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 6 ms 9684 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 6 ms 9688 KB Output is correct
38 Correct 6 ms 9684 KB Output is correct
39 Correct 6 ms 9684 KB Output is correct
40 Correct 5 ms 9656 KB Output is correct
41 Correct 6 ms 9684 KB Output is correct
42 Correct 5 ms 9684 KB Output is correct
43 Correct 6 ms 9940 KB Output is correct
44 Correct 7 ms 10196 KB Output is correct
45 Correct 142 ms 29792 KB Output is correct
46 Correct 182 ms 39444 KB Output is correct
47 Correct 175 ms 39100 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9696 KB Output is correct
3 Correct 6 ms 9660 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9612 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 127 ms 30680 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 20884 KB Output is correct
12 Correct 21 ms 12876 KB Output is correct
13 Correct 33 ms 17004 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 121 ms 30640 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9696 KB Output is correct
23 Correct 295 ms 48796 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 7 ms 9908 KB Output is correct
26 Correct 7 ms 10068 KB Output is correct
27 Correct 8 ms 10196 KB Output is correct
28 Correct 92 ms 25216 KB Output is correct
29 Correct 155 ms 33040 KB Output is correct
30 Correct 212 ms 41212 KB Output is correct
31 Correct 273 ms 48772 KB Output is correct
32 Correct 6 ms 9684 KB Output is correct
33 Correct 6 ms 9684 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 6 ms 9684 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 6 ms 9688 KB Output is correct
38 Correct 6 ms 9684 KB Output is correct
39 Correct 6 ms 9684 KB Output is correct
40 Correct 5 ms 9656 KB Output is correct
41 Correct 6 ms 9684 KB Output is correct
42 Correct 5 ms 9684 KB Output is correct
43 Correct 6 ms 9940 KB Output is correct
44 Correct 7 ms 10196 KB Output is correct
45 Correct 142 ms 29792 KB Output is correct
46 Correct 182 ms 39444 KB Output is correct
47 Correct 175 ms 39100 KB Output is correct
48 Correct 5 ms 9684 KB Output is correct
49 Correct 5 ms 9684 KB Output is correct
50 Correct 5 ms 9684 KB Output is correct
51 Correct 5 ms 9684 KB Output is correct
52 Correct 5 ms 9640 KB Output is correct
53 Correct 6 ms 9580 KB Output is correct
54 Correct 5 ms 9684 KB Output is correct
55 Correct 286 ms 49032 KB Output is correct
56 Correct 5 ms 9684 KB Output is correct
57 Correct 8 ms 9940 KB Output is correct
58 Correct 11 ms 10836 KB Output is correct
59 Correct 11 ms 11220 KB Output is correct
60 Correct 138 ms 29132 KB Output is correct
61 Correct 174 ms 37168 KB Output is correct
62 Correct 218 ms 42332 KB Output is correct
63 Correct 297 ms 49132 KB Output is correct
64 Correct 6 ms 9684 KB Output is correct
65 Correct 6 ms 9684 KB Output is correct
66 Correct 6 ms 9684 KB Output is correct
67 Incorrect 217 ms 39880 KB Solution announced impossible, but it is possible.
68 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9696 KB Output is correct
3 Correct 6 ms 9660 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9612 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 127 ms 30680 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 20884 KB Output is correct
12 Correct 21 ms 12876 KB Output is correct
13 Correct 33 ms 17004 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 121 ms 30640 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 7 ms 9684 KB Output is correct
19 Correct 6 ms 9700 KB Output is correct
20 Incorrect 284 ms 52192 KB Pair u[199994]=722 @(8, 199996) and v[199994]=70454 @(6, 199998) does not form a valid edge (distance != 2)
21 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9696 KB Output is correct
3 Correct 6 ms 9660 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9612 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 127 ms 30680 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 20884 KB Output is correct
12 Correct 21 ms 12876 KB Output is correct
13 Correct 33 ms 17004 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 121 ms 30640 KB Output is correct
17 Incorrect 134 ms 27056 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9696 KB Output is correct
3 Correct 6 ms 9660 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 5 ms 9612 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 127 ms 30680 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 20884 KB Output is correct
12 Correct 21 ms 12876 KB Output is correct
13 Correct 33 ms 17004 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 6 ms 9940 KB Output is correct
16 Correct 121 ms 30640 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 6 ms 9696 KB Output is correct
23 Correct 295 ms 48796 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 7 ms 9908 KB Output is correct
26 Correct 7 ms 10068 KB Output is correct
27 Correct 8 ms 10196 KB Output is correct
28 Correct 92 ms 25216 KB Output is correct
29 Correct 155 ms 33040 KB Output is correct
30 Correct 212 ms 41212 KB Output is correct
31 Correct 273 ms 48772 KB Output is correct
32 Correct 6 ms 9684 KB Output is correct
33 Correct 6 ms 9684 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 6 ms 9684 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 6 ms 9688 KB Output is correct
38 Correct 6 ms 9684 KB Output is correct
39 Correct 6 ms 9684 KB Output is correct
40 Correct 5 ms 9656 KB Output is correct
41 Correct 6 ms 9684 KB Output is correct
42 Correct 5 ms 9684 KB Output is correct
43 Correct 6 ms 9940 KB Output is correct
44 Correct 7 ms 10196 KB Output is correct
45 Correct 142 ms 29792 KB Output is correct
46 Correct 182 ms 39444 KB Output is correct
47 Correct 175 ms 39100 KB Output is correct
48 Correct 5 ms 9684 KB Output is correct
49 Correct 5 ms 9684 KB Output is correct
50 Correct 5 ms 9684 KB Output is correct
51 Correct 5 ms 9684 KB Output is correct
52 Correct 5 ms 9640 KB Output is correct
53 Correct 6 ms 9580 KB Output is correct
54 Correct 5 ms 9684 KB Output is correct
55 Correct 286 ms 49032 KB Output is correct
56 Correct 5 ms 9684 KB Output is correct
57 Correct 8 ms 9940 KB Output is correct
58 Correct 11 ms 10836 KB Output is correct
59 Correct 11 ms 11220 KB Output is correct
60 Correct 138 ms 29132 KB Output is correct
61 Correct 174 ms 37168 KB Output is correct
62 Correct 218 ms 42332 KB Output is correct
63 Correct 297 ms 49132 KB Output is correct
64 Correct 6 ms 9684 KB Output is correct
65 Correct 6 ms 9684 KB Output is correct
66 Correct 6 ms 9684 KB Output is correct
67 Incorrect 217 ms 39880 KB Solution announced impossible, but it is possible.
68 Halted 0 ms 0 KB -