oj.uz

답안 #1050741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050741 2024-08-09T13:48:36 Z amine_aroua 분수 공원 (IOI21_parks) C++17
5 / 100
 256 ms 51880 KB 
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
vector<bool> vis;
const int MAX_X = 200000;
void dfs(int i)
{
    if(vis[i])
        return;
    vis[i] = 1;
    for(auto j : adj[i])
    {
        dfs(j);
    }
}
int mn , mx , cur_x;
void dfs_comp(int i , vector<int> &y)
{
    if(vis[i])
        return ;
    vis[i] = 1;
    mn = min(mn , y[i]);
    mx = max(mx , y[i]);
    for(auto j : adj[i])
    {
        dfs_comp(j , y);
    }
}
void add_edge(int u , int v)
{
    adj[u].push_back(v);
    adj[v].push_back(u);
}
int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n= (int)x.size();
    adj.assign(n , {});
    vis.assign(n , 0);
    vector<int> u , v , a , b;
    map<pair<int, int> , int> idx;
    
    for(int i = 0 ; i <n ; i++)
    {
        idx[{x[i] , y[i]}] = i;
    }
    for(int i = 0 ; i < n ;i++)
    {
        if(idx.count({x[i] , y[i] + 2}))
        {
            u.push_back(i);
            v.push_back(idx[{x[i] , y[i] + 2}]);
            add_edge(u.back() , v.back());
            b.push_back(y[i] + 1);
            a.push_back(x[i] - 1);
        }
    }
    vector<vector<int>> comp(MAX_X + 1);
    for(int i = 0 ; i < n ;i++)
    {
        if(vis[i])
            continue;
        cur_x = x[i];
        mn = 1e9;
        mx = -1e9;
        dfs_comp(i , y);
        comp[cur_x].push_back(mn);
        if(mx != mn)
            comp[cur_x].push_back(mx);
    }
    for(int i = 2  ;i <= MAX_X ; i+=2)
    {
        sort(comp[i].begin() , comp[i].end());
    }
    for(int i = 4 ; i <= MAX_X ; i+=2)
    {
        for(int j = 0 ; j < (int)comp[i].size() ; j++)
        {
            int val = comp[i][j];
            if(binary_search(comp[i - 2].begin() , comp[i - 2].end() , val))
            {
                u.push_back(idx[{i,val}]);
                v.push_back(idx[{i - 2 , val}]);
                add_edge(u.back() , v.back());
                a.push_back(i - 1);
                if(j % 2 == 0)
                    b.push_back(val - 1);
                else
                    b.push_back(val + 1);
            }
        }
    }
    vis.assign(n , 0);
    dfs(0);
    for(int i = 0 ; i < n ; i++)
    {
        if(!vis[i])
        {
            return 0;
        }
    }
    build(u , v , a , b);
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 110 ms 26636 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 38 ms 16932 KB Output is correct
12 Correct 9 ms 8280 KB Output is correct
13 Correct 21 ms 13000 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5468 KB Output is correct
16 Correct 103 ms 25492 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 110 ms 26636 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 38 ms 16932 KB Output is correct
12 Correct 9 ms 8280 KB Output is correct
13 Correct 21 ms 13000 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5468 KB Output is correct
16 Correct 103 ms 25492 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 2 ms 4956 KB Output is correct
23 Correct 251 ms 48404 KB Output is correct
24 Correct 2 ms 4956 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 5468 KB Output is correct
27 Correct 3 ms 5724 KB Output is correct
28 Correct 76 ms 22492 KB Output is correct
29 Correct 122 ms 30648 KB Output is correct
30 Correct 187 ms 40104 KB Output is correct
31 Correct 247 ms 48564 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 2 ms 4952 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 2 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4952 KB Output is correct
39 Correct 1 ms 4956 KB Output is correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 2 ms 4956 KB Output is correct
42 Correct 2 ms 4956 KB Output is correct
43 Correct 2 ms 5212 KB Output is correct
44 Correct 3 ms 5468 KB Output is correct
45 Incorrect 92 ms 21940 KB Solution announced impossible, but it is possible.
46 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 110 ms 26636 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 38 ms 16932 KB Output is correct
12 Correct 9 ms 8280 KB Output is correct
13 Correct 21 ms 13000 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5468 KB Output is correct
16 Correct 103 ms 25492 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 2 ms 4956 KB Output is correct
23 Correct 251 ms 48404 KB Output is correct
24 Correct 2 ms 4956 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 5468 KB Output is correct
27 Correct 3 ms 5724 KB Output is correct
28 Correct 76 ms 22492 KB Output is correct
29 Correct 122 ms 30648 KB Output is correct
30 Correct 187 ms 40104 KB Output is correct
31 Correct 247 ms 48564 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 2 ms 4952 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 2 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4952 KB Output is correct
39 Correct 1 ms 4956 KB Output is correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 2 ms 4956 KB Output is correct
42 Correct 2 ms 4956 KB Output is correct
43 Correct 2 ms 5212 KB Output is correct
44 Correct 3 ms 5468 KB Output is correct
45 Incorrect 92 ms 21940 KB Solution announced impossible, but it is possible.
46 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 110 ms 26636 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 38 ms 16932 KB Output is correct
12 Correct 9 ms 8280 KB Output is correct
13 Correct 21 ms 13000 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5468 KB Output is correct
16 Correct 103 ms 25492 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 246 ms 51880 KB Output is correct
21 Incorrect 246 ms 48808 KB Tree @(5, 11) appears more than once: for edges on positions 31719 and 99999
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 110 ms 26636 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 38 ms 16932 KB Output is correct
12 Correct 9 ms 8280 KB Output is correct
13 Correct 21 ms 13000 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5468 KB Output is correct
16 Correct 103 ms 25492 KB Output is correct
17 Correct 256 ms 50224 KB Output is correct
18 Correct 238 ms 49568 KB Output is correct
19 Incorrect 220 ms 43824 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 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4952 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 110 ms 26636 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 38 ms 16932 KB Output is correct
12 Correct 9 ms 8280 KB Output is correct
13 Correct 21 ms 13000 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 5468 KB Output is correct
16 Correct 103 ms 25492 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 2 ms 4956 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 2 ms 4956 KB Output is correct
23 Correct 251 ms 48404 KB Output is correct
24 Correct 2 ms 4956 KB Output is correct
25 Correct 2 ms 5212 KB Output is correct
26 Correct 2 ms 5468 KB Output is correct
27 Correct 3 ms 5724 KB Output is correct
28 Correct 76 ms 22492 KB Output is correct
29 Correct 122 ms 30648 KB Output is correct
30 Correct 187 ms 40104 KB Output is correct
31 Correct 247 ms 48564 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 2 ms 4952 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 2 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4952 KB Output is correct
39 Correct 1 ms 4956 KB Output is correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 2 ms 4956 KB Output is correct
42 Correct 2 ms 4956 KB Output is correct
43 Correct 2 ms 5212 KB Output is correct
44 Correct 3 ms 5468 KB Output is correct
45 Incorrect 92 ms 21940 KB Solution announced impossible, but it is possible.
46 Halted 0 ms 0 KB -