oj.uz

답안 #623174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623174 2022-08-05T09:32:16 Z Hanksburger 분수 공원 (IOI21_parks) C++17
15 / 100
 294 ms 49068 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});
    bool ok=0;
    for (int i=2; i<=2e5; i+=2)
    {
        if (vec[i].empty())
            continue;
        sort(vec[i].begin(), vec[i].end());
        if (ok)
        {
            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==-1)
                    return 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==-1)
                        return 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==-1)
                        return 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==-1)
                            return 0;
                        edge.push_back({vec[i-2][ind].second, vec[i][k].second});
                    }
                }
            }
            else
            {
                if (vec[i-2].empty())
                    return 0;
                if (vec[i-2][0].first==2)
                    edge.push_back({vec[i-2][0].second, vec[i][0].second});
                else if (vec[i-2][0].first==4)
                    edge.push_back({vec[i-2][0].second, vec[i][1].second});
                else
                    edge.push_back({vec[i-2][0].second, vec[i][2].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});
        }
        ok=1;
    }
    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:25: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]
   25 |                 for (int j=0; j<vec[i-2].size(); j++)
      |                               ~^~~~~~~~~~~~~~~~
parks.cpp:42: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]
   42 |                     for (int j=0; j<vec[i-2].size(); j++)
      |                                   ~^~~~~~~~~~~~~~~~
parks.cpp:60: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]
   60 |                     for (int j=0; j<vec[i-2].size(); j++)
      |                                   ~^~~~~~~~~~~~~~~~
parks.cpp:75:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |                         for (int j=0; j<vec[i-2].size(); j++)
      |                                       ~^~~~~~~~~~~~~~~~
parks.cpp:113: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]
  113 |     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 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 136 ms 30620 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 21028 KB Output is correct
12 Correct 20 ms 12892 KB Output is correct
13 Correct 19 ms 12104 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 120 ms 30740 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 136 ms 30620 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 21028 KB Output is correct
12 Correct 20 ms 12892 KB Output is correct
13 Correct 19 ms 12104 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 120 ms 30740 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9696 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 274 ms 48828 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 6 ms 9856 KB Output is correct
26 Correct 6 ms 9812 KB Output is correct
27 Correct 6 ms 9760 KB Output is correct
28 Correct 95 ms 25304 KB Output is correct
29 Correct 160 ms 33012 KB Output is correct
30 Correct 231 ms 41208 KB Output is correct
31 Correct 294 ms 48848 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9596 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 5 ms 9668 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 6 ms 9612 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 6 ms 9684 KB Output is correct
41 Correct 5 ms 9684 KB Output is correct
42 Correct 7 ms 9684 KB Output is correct
43 Correct 6 ms 9684 KB Output is correct
44 Correct 8 ms 9796 KB Output is correct
45 Correct 126 ms 29788 KB Output is correct
46 Correct 185 ms 39352 KB Output is correct
47 Correct 192 ms 39088 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 136 ms 30620 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 21028 KB Output is correct
12 Correct 20 ms 12892 KB Output is correct
13 Correct 19 ms 12104 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 120 ms 30740 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9696 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 274 ms 48828 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 6 ms 9856 KB Output is correct
26 Correct 6 ms 9812 KB Output is correct
27 Correct 6 ms 9760 KB Output is correct
28 Correct 95 ms 25304 KB Output is correct
29 Correct 160 ms 33012 KB Output is correct
30 Correct 231 ms 41208 KB Output is correct
31 Correct 294 ms 48848 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9596 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 5 ms 9668 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 6 ms 9612 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 6 ms 9684 KB Output is correct
41 Correct 5 ms 9684 KB Output is correct
42 Correct 7 ms 9684 KB Output is correct
43 Correct 6 ms 9684 KB Output is correct
44 Correct 8 ms 9796 KB Output is correct
45 Correct 126 ms 29788 KB Output is correct
46 Correct 185 ms 39352 KB Output is correct
47 Correct 192 ms 39088 KB Output is correct
48 Correct 5 ms 9684 KB Output is correct
49 Correct 6 ms 9684 KB Output is correct
50 Correct 6 ms 9684 KB Output is correct
51 Correct 6 ms 9684 KB Output is correct
52 Correct 6 ms 9684 KB Output is correct
53 Correct 6 ms 9684 KB Output is correct
54 Correct 5 ms 9684 KB Output is correct
55 Correct 271 ms 49068 KB Output is correct
56 Correct 5 ms 9684 KB Output is correct
57 Correct 7 ms 9940 KB Output is correct
58 Correct 11 ms 10836 KB Output is correct
59 Correct 9 ms 10068 KB Output is correct
60 Correct 122 ms 29160 KB Output is correct
61 Correct 196 ms 37140 KB Output is correct
62 Correct 217 ms 42408 KB Output is correct
63 Correct 271 ms 49040 KB Output is correct
64 Correct 5 ms 9684 KB Output is correct
65 Correct 5 ms 9684 KB Output is correct
66 Correct 5 ms 9580 KB Output is correct
67 Incorrect 229 ms 39868 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 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 136 ms 30620 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 21028 KB Output is correct
12 Correct 20 ms 12892 KB Output is correct
13 Correct 19 ms 12104 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 120 ms 30740 KB Output is correct
17 Correct 6 ms 9684 KB Output is correct
18 Incorrect 6 ms 9684 KB Solution announced impossible, but it is possible.
19 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 136 ms 30620 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 21028 KB Output is correct
12 Correct 20 ms 12892 KB Output is correct
13 Correct 19 ms 12104 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 120 ms 30740 KB Output is correct
17 Incorrect 139 ms 26988 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 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 136 ms 30620 KB Output is correct
10 Correct 14 ms 11860 KB Output is correct
11 Correct 54 ms 21028 KB Output is correct
12 Correct 20 ms 12892 KB Output is correct
13 Correct 19 ms 12104 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 120 ms 30740 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 6 ms 9696 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 274 ms 48828 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 6 ms 9856 KB Output is correct
26 Correct 6 ms 9812 KB Output is correct
27 Correct 6 ms 9760 KB Output is correct
28 Correct 95 ms 25304 KB Output is correct
29 Correct 160 ms 33012 KB Output is correct
30 Correct 231 ms 41208 KB Output is correct
31 Correct 294 ms 48848 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 5 ms 9596 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 5 ms 9668 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 6 ms 9612 KB Output is correct
39 Correct 5 ms 9684 KB Output is correct
40 Correct 6 ms 9684 KB Output is correct
41 Correct 5 ms 9684 KB Output is correct
42 Correct 7 ms 9684 KB Output is correct
43 Correct 6 ms 9684 KB Output is correct
44 Correct 8 ms 9796 KB Output is correct
45 Correct 126 ms 29788 KB Output is correct
46 Correct 185 ms 39352 KB Output is correct
47 Correct 192 ms 39088 KB Output is correct
48 Correct 5 ms 9684 KB Output is correct
49 Correct 6 ms 9684 KB Output is correct
50 Correct 6 ms 9684 KB Output is correct
51 Correct 6 ms 9684 KB Output is correct
52 Correct 6 ms 9684 KB Output is correct
53 Correct 6 ms 9684 KB Output is correct
54 Correct 5 ms 9684 KB Output is correct
55 Correct 271 ms 49068 KB Output is correct
56 Correct 5 ms 9684 KB Output is correct
57 Correct 7 ms 9940 KB Output is correct
58 Correct 11 ms 10836 KB Output is correct
59 Correct 9 ms 10068 KB Output is correct
60 Correct 122 ms 29160 KB Output is correct
61 Correct 196 ms 37140 KB Output is correct
62 Correct 217 ms 42408 KB Output is correct
63 Correct 271 ms 49040 KB Output is correct
64 Correct 5 ms 9684 KB Output is correct
65 Correct 5 ms 9684 KB Output is correct
66 Correct 5 ms 9580 KB Output is correct
67 Incorrect 229 ms 39868 KB Solution announced impossible, but it is possible.
68 Halted 0 ms 0 KB -