oj.uz

답안 #1050806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050806 2024-08-09T14:40:36 Z amine_aroua 분수 공원 (IOI21_parks) C++17
5 / 100
 485 ms 74584 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);
        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 = 2 ; i <= MAX_X ; i+=2)
    {
        assert(comp[i].size() % 2 == 0);
        for(int j = 0 ; j < (int)comp[i].size() ; j+=2)
        {
            if(j > 0)
            {
                assert(comp[i][j] != comp[i][j - 1]);
            }
            for(int val = comp[i][j]+1 ; val < comp[i][j + 1] ;val++)
            {
                assert(!idx.count({i - 2 , val}));
            }
            for(int k = 0 ; k < 2 ; k++)
            {
                int val = comp[i][j + k];
                if(k > 0 && val == comp[i][j])
                    continue;
                if(idx.count({i - 2  ,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);
                    b.push_back(val - 1 + 2 * k);
                }
            }
        }
    }
    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 2 ms 4956 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 205 ms 25960 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 36 ms 16420 KB Output is correct
12 Correct 18 ms 8284 KB Output is correct
13 Correct 27 ms 12496 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5212 KB Output is correct
16 Correct 153 ms 24756 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 205 ms 25960 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 36 ms 16420 KB Output is correct
12 Correct 18 ms 8284 KB Output is correct
13 Correct 27 ms 12496 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5212 KB Output is correct
16 Correct 153 ms 24756 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Runtime error 8 ms 10076 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 205 ms 25960 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 36 ms 16420 KB Output is correct
12 Correct 18 ms 8284 KB Output is correct
13 Correct 27 ms 12496 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5212 KB Output is correct
16 Correct 153 ms 24756 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Runtime error 8 ms 10076 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 205 ms 25960 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 36 ms 16420 KB Output is correct
12 Correct 18 ms 8284 KB Output is correct
13 Correct 27 ms 12496 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5212 KB Output is correct
16 Correct 153 ms 24756 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 3 ms 4952 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 385 ms 50280 KB Output is correct
21 Correct 388 ms 47620 KB Output is correct
22 Correct 485 ms 46964 KB Output is correct
23 Correct 242 ms 41004 KB Output is correct
24 Correct 169 ms 27192 KB Output is correct
25 Correct 237 ms 36480 KB Output is correct
26 Correct 285 ms 34728 KB Output is correct
27 Correct 298 ms 41048 KB Output is correct
28 Correct 256 ms 41004 KB Output is correct
29 Correct 261 ms 43240 KB Output is correct
30 Runtime error 229 ms 74584 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 205 ms 25960 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 36 ms 16420 KB Output is correct
12 Correct 18 ms 8284 KB Output is correct
13 Correct 27 ms 12496 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5212 KB Output is correct
16 Correct 153 ms 24756 KB Output is correct
17 Correct 278 ms 48928 KB Output is correct
18 Runtime error 201 ms 71628 KB Execution killed with signal 6
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 4 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 205 ms 25960 KB Output is correct
10 Correct 7 ms 7260 KB Output is correct
11 Correct 36 ms 16420 KB Output is correct
12 Correct 18 ms 8284 KB Output is correct
13 Correct 27 ms 12496 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 3 ms 5212 KB Output is correct
16 Correct 153 ms 24756 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Runtime error 8 ms 10076 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -