oj.uz

답안 #623213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623213 2022-08-05T10:33:54 Z Hanksburger 분수 공원 (IOI21_parks) C++17
15 / 100
 543 ms 69668 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[200005], X, Y, U, V, A, B;
vector<pair<int, int> > edge;
map<pair<int, int>, bool> mp;
map<pair<int, int>, int> p;
bool visited[200005];
queue<int> q;
bool cmp(pair<int, int> u, pair<int, int> v)
{
    if (X[u.first]!=X[v.first] || X[u.second]!=X[v.second])
        return (X[u.first]<X[v.first] || X[u.second]<X[v.second]);
    return Y[u.first]<Y[v.first];
}
int construct_roads(vector<int> x, vector<int> y)
{
    int N=x.size();
    for (int i=0; i<N; i++)
    {
        X.push_back(x[i]);
        Y.push_back(y[i]);
        p[{X[i], Y[i]}]=i+1;
    }
    for (auto itr=p.begin(); itr!=p.end(); itr++)
    {
        int ind=itr->second-1;
        if (p.count({X[ind]-2, Y[ind]}))
            edge.push_back({p[{X[ind]-2, Y[ind]}]-1, ind});
        if (p.count({X[ind], Y[ind]-2}))
            edge.push_back({p[{X[ind], Y[ind]-2}]-1, ind});
    }
    sort(edge.begin(), edge.end(), cmp);
    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 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
                return 0;
        }
        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 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
                return 0;
        }
    }
    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:34: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]
   34 |     for (int i=0; i<edge.size(); i++)
      |                   ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 187 ms 29916 KB Output is correct
10 Correct 14 ms 7508 KB Output is correct
11 Correct 78 ms 18384 KB Output is correct
12 Correct 21 ms 8824 KB Output is correct
13 Correct 57 ms 14144 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 179 ms 29988 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 187 ms 29916 KB Output is correct
10 Correct 14 ms 7508 KB Output is correct
11 Correct 78 ms 18384 KB Output is correct
12 Correct 21 ms 8824 KB Output is correct
13 Correct 57 ms 14144 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 179 ms 29988 KB Output is correct
17 Correct 4 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 543 ms 69668 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 6 ms 5716 KB Output is correct
27 Correct 7 ms 5972 KB Output is correct
28 Correct 180 ms 30364 KB Output is correct
29 Correct 290 ms 43484 KB Output is correct
30 Correct 422 ms 56036 KB Output is correct
31 Correct 540 ms 69620 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 2 ms 4900 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5332 KB Output is correct
44 Correct 5 ms 5588 KB Output is correct
45 Correct 205 ms 29956 KB Output is correct
46 Correct 283 ms 41572 KB Output is correct
47 Correct 293 ms 41668 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 187 ms 29916 KB Output is correct
10 Correct 14 ms 7508 KB Output is correct
11 Correct 78 ms 18384 KB Output is correct
12 Correct 21 ms 8824 KB Output is correct
13 Correct 57 ms 14144 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 179 ms 29988 KB Output is correct
17 Correct 4 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 543 ms 69668 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 6 ms 5716 KB Output is correct
27 Correct 7 ms 5972 KB Output is correct
28 Correct 180 ms 30364 KB Output is correct
29 Correct 290 ms 43484 KB Output is correct
30 Correct 422 ms 56036 KB Output is correct
31 Correct 540 ms 69620 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 2 ms 4900 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5332 KB Output is correct
44 Correct 5 ms 5588 KB Output is correct
45 Correct 205 ms 29956 KB Output is correct
46 Correct 283 ms 41572 KB Output is correct
47 Correct 293 ms 41668 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 3 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 2 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Incorrect 3 ms 4948 KB Solution announced impossible, but it is possible.
54 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 187 ms 29916 KB Output is correct
10 Correct 14 ms 7508 KB Output is correct
11 Correct 78 ms 18384 KB Output is correct
12 Correct 21 ms 8824 KB Output is correct
13 Correct 57 ms 14144 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 179 ms 29988 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 422 ms 56028 KB Output is correct
21 Correct 423 ms 55840 KB Output is correct
22 Correct 431 ms 55768 KB Output is correct
23 Correct 349 ms 48040 KB Output is correct
24 Correct 163 ms 22172 KB Output is correct
25 Correct 370 ms 46168 KB Output is correct
26 Correct 321 ms 46084 KB Output is correct
27 Correct 410 ms 55116 KB Output is correct
28 Correct 472 ms 55056 KB Output is correct
29 Correct 474 ms 55052 KB Output is correct
30 Correct 430 ms 55108 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Incorrect 13 ms 6356 KB Solution announced impossible, but it is possible.
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 187 ms 29916 KB Output is correct
10 Correct 14 ms 7508 KB Output is correct
11 Correct 78 ms 18384 KB Output is correct
12 Correct 21 ms 8824 KB Output is correct
13 Correct 57 ms 14144 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 179 ms 29988 KB Output is correct
17 Correct 441 ms 55548 KB Output is correct
18 Correct 436 ms 55620 KB Output is correct
19 Incorrect 347 ms 45944 KB Solution announced impossible, but it is possible.
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 187 ms 29916 KB Output is correct
10 Correct 14 ms 7508 KB Output is correct
11 Correct 78 ms 18384 KB Output is correct
12 Correct 21 ms 8824 KB Output is correct
13 Correct 57 ms 14144 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 179 ms 29988 KB Output is correct
17 Correct 4 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 543 ms 69668 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 6 ms 5716 KB Output is correct
27 Correct 7 ms 5972 KB Output is correct
28 Correct 180 ms 30364 KB Output is correct
29 Correct 290 ms 43484 KB Output is correct
30 Correct 422 ms 56036 KB Output is correct
31 Correct 540 ms 69620 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 2 ms 4900 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4948 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 4 ms 5332 KB Output is correct
44 Correct 5 ms 5588 KB Output is correct
45 Correct 205 ms 29956 KB Output is correct
46 Correct 283 ms 41572 KB Output is correct
47 Correct 293 ms 41668 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 3 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 2 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Incorrect 3 ms 4948 KB Solution announced impossible, but it is possible.
54 Halted 0 ms 0 KB -