oj.uz

답안 #623198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623198 2022-08-05T10:15:33 Z Hanksburger 분수 공원 (IOI21_parks) C++17
15 / 100
 547 ms 69752 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
            {
                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: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 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 174 ms 29876 KB Output is correct
10 Correct 13 ms 7508 KB Output is correct
11 Correct 91 ms 18404 KB Output is correct
12 Correct 23 ms 8728 KB Output is correct
13 Correct 49 ms 14032 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 185 ms 29868 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 174 ms 29876 KB Output is correct
10 Correct 13 ms 7508 KB Output is correct
11 Correct 91 ms 18404 KB Output is correct
12 Correct 23 ms 8728 KB Output is correct
13 Correct 49 ms 14032 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 185 ms 29868 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 4 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 525 ms 69752 KB Output is correct
24 Correct 3 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 5976 KB Output is correct
28 Correct 188 ms 30324 KB Output is correct
29 Correct 282 ms 43780 KB Output is correct
30 Correct 401 ms 56032 KB Output is correct
31 Correct 547 ms 69636 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4952 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 4 ms 5396 KB Output is correct
44 Correct 5 ms 5588 KB Output is correct
45 Correct 196 ms 29964 KB Output is correct
46 Correct 277 ms 41492 KB Output is correct
47 Correct 288 ms 41536 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 174 ms 29876 KB Output is correct
10 Correct 13 ms 7508 KB Output is correct
11 Correct 91 ms 18404 KB Output is correct
12 Correct 23 ms 8728 KB Output is correct
13 Correct 49 ms 14032 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 185 ms 29868 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 4 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 525 ms 69752 KB Output is correct
24 Correct 3 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 5976 KB Output is correct
28 Correct 188 ms 30324 KB Output is correct
29 Correct 282 ms 43780 KB Output is correct
30 Correct 401 ms 56032 KB Output is correct
31 Correct 547 ms 69636 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4952 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 4 ms 5396 KB Output is correct
44 Correct 5 ms 5588 KB Output is correct
45 Correct 196 ms 29964 KB Output is correct
46 Correct 277 ms 41492 KB Output is correct
47 Correct 288 ms 41536 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Incorrect 3 ms 4948 KB Tree @(5, 5) appears more than once: for edges on positions 4 and 6
54 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 174 ms 29876 KB Output is correct
10 Correct 13 ms 7508 KB Output is correct
11 Correct 91 ms 18404 KB Output is correct
12 Correct 23 ms 8728 KB Output is correct
13 Correct 49 ms 14032 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 185 ms 29868 KB Output is correct
17 Correct 3 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 428 ms 56040 KB Output is correct
21 Correct 449 ms 55792 KB Output is correct
22 Correct 459 ms 55820 KB Output is correct
23 Correct 336 ms 48032 KB Output is correct
24 Correct 194 ms 22216 KB Output is correct
25 Correct 377 ms 46032 KB Output is correct
26 Correct 313 ms 46052 KB Output is correct
27 Correct 436 ms 55016 KB Output is correct
28 Correct 497 ms 55116 KB Output is correct
29 Correct 452 ms 55056 KB Output is correct
30 Correct 430 ms 55156 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Incorrect 24 ms 8640 KB Tree @(185725, 20413) appears more than once: for edges on positions 631 and 647
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 174 ms 29876 KB Output is correct
10 Correct 13 ms 7508 KB Output is correct
11 Correct 91 ms 18404 KB Output is correct
12 Correct 23 ms 8728 KB Output is correct
13 Correct 49 ms 14032 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 185 ms 29868 KB Output is correct
17 Correct 485 ms 55440 KB Output is correct
18 Correct 443 ms 55744 KB Output is correct
19 Incorrect 455 ms 55760 KB Tree @(100001, 50003) appears more than once: for edges on positions 199994 and 199995
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 174 ms 29876 KB Output is correct
10 Correct 13 ms 7508 KB Output is correct
11 Correct 91 ms 18404 KB Output is correct
12 Correct 23 ms 8728 KB Output is correct
13 Correct 49 ms 14032 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 4 ms 5332 KB Output is correct
16 Correct 185 ms 29868 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 4 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 525 ms 69752 KB Output is correct
24 Correct 3 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 5976 KB Output is correct
28 Correct 188 ms 30324 KB Output is correct
29 Correct 282 ms 43780 KB Output is correct
30 Correct 401 ms 56032 KB Output is correct
31 Correct 547 ms 69636 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4952 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 4 ms 5396 KB Output is correct
44 Correct 5 ms 5588 KB Output is correct
45 Correct 196 ms 29964 KB Output is correct
46 Correct 277 ms 41492 KB Output is correct
47 Correct 288 ms 41536 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 2 ms 4948 KB Output is correct
50 Correct 2 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Incorrect 3 ms 4948 KB Tree @(5, 5) appears more than once: for edges on positions 4 and 6
54 Halted 0 ms 0 KB -