oj.uz

답안 #831630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831630 2023-08-20T11:34:09 Z Minindu206 분수 공원 (IOI21_parks) C++17
15 / 100
 196 ms 42676 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
vector<int> adj[MAXN];
void dfs(int node, vector<int> &vis)
{
    vis[node] = 1;
    for(auto a:adj[node])
        if(!vis[a])
            dfs(a, vis);
}
int construct_roads(vector<int> x, vector<int> y)
{
    int n = x.size();
    vector<vector<int>> ft(10, vector<int>(MAXN, -1));
    for (int i = 0; i < n; i++)
        ft[x[i]][y[i]] = i;
    vector<pair<int, int>> dir{{2, 0}, {-2, 0}, {0, 2}, {0, -2}};
    vector<int> u, v, a, b;
    for(int i=0;i<n;i++)
    {
        for(auto d:dir)
        {
            int cx = x[i] + d.first, cy = y[i] + d.second;
            if(ft[cx][cy] == -1)
                continue;
            adj[i].push_back(ft[cx][cy]);
            if(ft[cx][cy] > i)
            {
                u.push_back(i);
                v.push_back(ft[cx][cy]);
                if(d.second == 0)
                {
                    a.push_back(x[i] + cx >> 1);
                    b.push_back(cy - 1);
                }
                else
                {
                    if(x[i] == 2)
                    {
                        a.push_back(x[i] - 1);
                        b.push_back(y[i] + cy >> 1); 
                    }
                    else
                    {
                        a.push_back(x[i] + 1);
                        b.push_back(y[i] + cy >> 1);
                    }
                }
            }
        }
    }
    vector<int> vis(n, 0);
    dfs(0, vis);
    for(int i=0;i<n;i++)
        if(!vis[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:35:38: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |                     a.push_back(x[i] + cx >> 1);
parks.cpp:43:42: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |                         b.push_back(y[i] + cy >> 1);
parks.cpp:48:42: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |                         b.push_back(y[i] + cy >> 1);

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 13524 KB Output is correct
2 Correct 6 ms 13524 KB Output is correct
3 Correct 5 ms 13524 KB Output is correct
4 Correct 7 ms 13524 KB Output is correct
5 Correct 6 ms 13524 KB Output is correct
6 Correct 6 ms 13524 KB Output is correct
7 Correct 7 ms 13524 KB Output is correct
8 Correct 5 ms 13604 KB Output is correct
9 Correct 62 ms 25548 KB Output is correct
10 Correct 12 ms 14144 KB Output is correct
11 Correct 34 ms 19768 KB Output is correct
12 Correct 12 ms 14692 KB Output is correct
13 Correct 16 ms 16784 KB Output is correct
14 Correct 7 ms 13652 KB Output is correct
15 Correct 7 ms 13652 KB Output is correct
16 Correct 81 ms 24280 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 13524 KB Output is correct
2 Correct 6 ms 13524 KB Output is correct
3 Correct 5 ms 13524 KB Output is correct
4 Correct 7 ms 13524 KB Output is correct
5 Correct 6 ms 13524 KB Output is correct
6 Correct 6 ms 13524 KB Output is correct
7 Correct 7 ms 13524 KB Output is correct
8 Correct 5 ms 13604 KB Output is correct
9 Correct 62 ms 25548 KB Output is correct
10 Correct 12 ms 14144 KB Output is correct
11 Correct 34 ms 19768 KB Output is correct
12 Correct 12 ms 14692 KB Output is correct
13 Correct 16 ms 16784 KB Output is correct
14 Correct 7 ms 13652 KB Output is correct
15 Correct 7 ms 13652 KB Output is correct
16 Correct 81 ms 24280 KB Output is correct
17 Correct 6 ms 13524 KB Output is correct
18 Correct 5 ms 13524 KB Output is correct
19 Correct 6 ms 13524 KB Output is correct
20 Correct 6 ms 13524 KB Output is correct
21 Correct 6 ms 13524 KB Output is correct
22 Correct 6 ms 13524 KB Output is correct
23 Correct 170 ms 42676 KB Output is correct
24 Correct 6 ms 13540 KB Output is correct
25 Correct 7 ms 13652 KB Output is correct
26 Correct 6 ms 13652 KB Output is correct
27 Correct 8 ms 13620 KB Output is correct
28 Correct 77 ms 24960 KB Output is correct
29 Correct 117 ms 30528 KB Output is correct
30 Correct 149 ms 36872 KB Output is correct
31 Correct 196 ms 42148 KB Output is correct
32 Correct 6 ms 13524 KB Output is correct
33 Correct 5 ms 13524 KB Output is correct
34 Correct 5 ms 13524 KB Output is correct
35 Correct 5 ms 13544 KB Output is correct
36 Correct 5 ms 13652 KB Output is correct
37 Correct 5 ms 13524 KB Output is correct
38 Correct 6 ms 13524 KB Output is correct
39 Correct 5 ms 13524 KB Output is correct
40 Correct 6 ms 13524 KB Output is correct
41 Correct 5 ms 13524 KB Output is correct
42 Correct 6 ms 13524 KB Output is correct
43 Correct 5 ms 13652 KB Output is correct
44 Correct 6 ms 13636 KB Output is correct
45 Correct 61 ms 24652 KB Output is correct
46 Correct 94 ms 30464 KB Output is correct
47 Correct 114 ms 30244 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 13524 KB Output is correct
2 Correct 6 ms 13524 KB Output is correct
3 Correct 5 ms 13524 KB Output is correct
4 Correct 7 ms 13524 KB Output is correct
5 Correct 6 ms 13524 KB Output is correct
6 Correct 6 ms 13524 KB Output is correct
7 Correct 7 ms 13524 KB Output is correct
8 Correct 5 ms 13604 KB Output is correct
9 Correct 62 ms 25548 KB Output is correct
10 Correct 12 ms 14144 KB Output is correct
11 Correct 34 ms 19768 KB Output is correct
12 Correct 12 ms 14692 KB Output is correct
13 Correct 16 ms 16784 KB Output is correct
14 Correct 7 ms 13652 KB Output is correct
15 Correct 7 ms 13652 KB Output is correct
16 Correct 81 ms 24280 KB Output is correct
17 Correct 6 ms 13524 KB Output is correct
18 Correct 5 ms 13524 KB Output is correct
19 Correct 6 ms 13524 KB Output is correct
20 Correct 6 ms 13524 KB Output is correct
21 Correct 6 ms 13524 KB Output is correct
22 Correct 6 ms 13524 KB Output is correct
23 Correct 170 ms 42676 KB Output is correct
24 Correct 6 ms 13540 KB Output is correct
25 Correct 7 ms 13652 KB Output is correct
26 Correct 6 ms 13652 KB Output is correct
27 Correct 8 ms 13620 KB Output is correct
28 Correct 77 ms 24960 KB Output is correct
29 Correct 117 ms 30528 KB Output is correct
30 Correct 149 ms 36872 KB Output is correct
31 Correct 196 ms 42148 KB Output is correct
32 Correct 6 ms 13524 KB Output is correct
33 Correct 5 ms 13524 KB Output is correct
34 Correct 5 ms 13524 KB Output is correct
35 Correct 5 ms 13544 KB Output is correct
36 Correct 5 ms 13652 KB Output is correct
37 Correct 5 ms 13524 KB Output is correct
38 Correct 6 ms 13524 KB Output is correct
39 Correct 5 ms 13524 KB Output is correct
40 Correct 6 ms 13524 KB Output is correct
41 Correct 5 ms 13524 KB Output is correct
42 Correct 6 ms 13524 KB Output is correct
43 Correct 5 ms 13652 KB Output is correct
44 Correct 6 ms 13636 KB Output is correct
45 Correct 61 ms 24652 KB Output is correct
46 Correct 94 ms 30464 KB Output is correct
47 Correct 114 ms 30244 KB Output is correct
48 Incorrect 5 ms 13544 KB Tree @(5, 3) appears more than once: for edges on positions 2 and 3
49 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 13524 KB Output is correct
2 Correct 6 ms 13524 KB Output is correct
3 Correct 5 ms 13524 KB Output is correct
4 Correct 7 ms 13524 KB Output is correct
5 Correct 6 ms 13524 KB Output is correct
6 Correct 6 ms 13524 KB Output is correct
7 Correct 7 ms 13524 KB Output is correct
8 Correct 5 ms 13604 KB Output is correct
9 Correct 62 ms 25548 KB Output is correct
10 Correct 12 ms 14144 KB Output is correct
11 Correct 34 ms 19768 KB Output is correct
12 Correct 12 ms 14692 KB Output is correct
13 Correct 16 ms 16784 KB Output is correct
14 Correct 7 ms 13652 KB Output is correct
15 Correct 7 ms 13652 KB Output is correct
16 Correct 81 ms 24280 KB Output is correct
17 Runtime error 16 ms 25852 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 13524 KB Output is correct
2 Correct 6 ms 13524 KB Output is correct
3 Correct 5 ms 13524 KB Output is correct
4 Correct 7 ms 13524 KB Output is correct
5 Correct 6 ms 13524 KB Output is correct
6 Correct 6 ms 13524 KB Output is correct
7 Correct 7 ms 13524 KB Output is correct
8 Correct 5 ms 13604 KB Output is correct
9 Correct 62 ms 25548 KB Output is correct
10 Correct 12 ms 14144 KB Output is correct
11 Correct 34 ms 19768 KB Output is correct
12 Correct 12 ms 14692 KB Output is correct
13 Correct 16 ms 16784 KB Output is correct
14 Correct 7 ms 13652 KB Output is correct
15 Correct 7 ms 13652 KB Output is correct
16 Correct 81 ms 24280 KB Output is correct
17 Runtime error 47 ms 32136 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 13524 KB Output is correct
2 Correct 6 ms 13524 KB Output is correct
3 Correct 5 ms 13524 KB Output is correct
4 Correct 7 ms 13524 KB Output is correct
5 Correct 6 ms 13524 KB Output is correct
6 Correct 6 ms 13524 KB Output is correct
7 Correct 7 ms 13524 KB Output is correct
8 Correct 5 ms 13604 KB Output is correct
9 Correct 62 ms 25548 KB Output is correct
10 Correct 12 ms 14144 KB Output is correct
11 Correct 34 ms 19768 KB Output is correct
12 Correct 12 ms 14692 KB Output is correct
13 Correct 16 ms 16784 KB Output is correct
14 Correct 7 ms 13652 KB Output is correct
15 Correct 7 ms 13652 KB Output is correct
16 Correct 81 ms 24280 KB Output is correct
17 Correct 6 ms 13524 KB Output is correct
18 Correct 5 ms 13524 KB Output is correct
19 Correct 6 ms 13524 KB Output is correct
20 Correct 6 ms 13524 KB Output is correct
21 Correct 6 ms 13524 KB Output is correct
22 Correct 6 ms 13524 KB Output is correct
23 Correct 170 ms 42676 KB Output is correct
24 Correct 6 ms 13540 KB Output is correct
25 Correct 7 ms 13652 KB Output is correct
26 Correct 6 ms 13652 KB Output is correct
27 Correct 8 ms 13620 KB Output is correct
28 Correct 77 ms 24960 KB Output is correct
29 Correct 117 ms 30528 KB Output is correct
30 Correct 149 ms 36872 KB Output is correct
31 Correct 196 ms 42148 KB Output is correct
32 Correct 6 ms 13524 KB Output is correct
33 Correct 5 ms 13524 KB Output is correct
34 Correct 5 ms 13524 KB Output is correct
35 Correct 5 ms 13544 KB Output is correct
36 Correct 5 ms 13652 KB Output is correct
37 Correct 5 ms 13524 KB Output is correct
38 Correct 6 ms 13524 KB Output is correct
39 Correct 5 ms 13524 KB Output is correct
40 Correct 6 ms 13524 KB Output is correct
41 Correct 5 ms 13524 KB Output is correct
42 Correct 6 ms 13524 KB Output is correct
43 Correct 5 ms 13652 KB Output is correct
44 Correct 6 ms 13636 KB Output is correct
45 Correct 61 ms 24652 KB Output is correct
46 Correct 94 ms 30464 KB Output is correct
47 Correct 114 ms 30244 KB Output is correct
48 Incorrect 5 ms 13544 KB Tree @(5, 3) appears more than once: for edges on positions 2 and 3
49 Halted 0 ms 0 KB -