oj.uz

Submission #441374

# Submission time Handle Problem Language Result Execution time Memory
441374 2021-07-05T06:05:10 Z daniel920712 Fountain Parks (IOI21_parks) C++17
15 / 100
 538 ms 31688 KB 
#include "parks.h"
#include <map>
#include <utility>
using namespace std;
map < pair < int , int > , int > all;
vector < int > u,v,a,b;
int Father[200005];
int Find(int here)
{
    if(Father[here]==here) return here;
    Father[here]=Find(Father[here]);
    return Father[here];
}
int construct_roads(vector < int > x, vector < int > y)
{
    int N=x.size(),i,t,aa,bb,ok=1;
    for(i=0;i<N;i++)
    {
        all[make_pair(x[i],y[i])]=i;
        Father[i]=i;
    }
    for(i=0;i<N;i++)
    {
        if(all.find(make_pair(x[i],y[i]+2))!=all.end())
        {
            t=all[make_pair(x[i],y[i]+2)];
            u.push_back(i);
            v.push_back(t);
            if(x[i]==2) a.push_back(1);
            else a.push_back(5);
            b.push_back(y[i]+1);
            aa=Find(i);
            bb=Find(t);
            if(aa!=bb) Father[aa]=bb;
        }
        if(all.find(make_pair(x[i]+2,y[i]))!=all.end())
        {
            t=all[make_pair(x[i]+2,y[i])];
            u.push_back(i);
            v.push_back(t);
            a.push_back(3);
            b.push_back(y[i]+1);
            aa=Find(i);
            bb=Find(t);
            if(aa!=bb) Father[aa]=bb;
        }

    }
    t=Find(0);
    for(i=0;i<N;i++)
    {
        if(t!=Find(i)) ok=0;
    }
    if(ok) build(u,v,a,b);
    return ok;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 159 ms 13848 KB Output is correct
10 Correct 11 ms 1996 KB Output is correct
11 Correct 61 ms 8396 KB Output is correct
12 Correct 17 ms 2712 KB Output is correct
13 Correct 35 ms 5476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 157 ms 13936 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 159 ms 13848 KB Output is correct
10 Correct 11 ms 1996 KB Output is correct
11 Correct 61 ms 8396 KB Output is correct
12 Correct 17 ms 2712 KB Output is correct
13 Correct 35 ms 5476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 157 ms 13936 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 509 ms 31600 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 4 ms 680 KB Output is correct
27 Correct 4 ms 716 KB Output is correct
28 Correct 153 ms 13068 KB Output is correct
29 Correct 271 ms 19416 KB Output is correct
30 Correct 379 ms 25452 KB Output is correct
31 Correct 538 ms 31688 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 193 ms 14076 KB Output is correct
46 Correct 300 ms 19616 KB Output is correct
47 Correct 306 ms 19580 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 159 ms 13848 KB Output is correct
10 Correct 11 ms 1996 KB Output is correct
11 Correct 61 ms 8396 KB Output is correct
12 Correct 17 ms 2712 KB Output is correct
13 Correct 35 ms 5476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 157 ms 13936 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 509 ms 31600 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 4 ms 680 KB Output is correct
27 Correct 4 ms 716 KB Output is correct
28 Correct 153 ms 13068 KB Output is correct
29 Correct 271 ms 19416 KB Output is correct
30 Correct 379 ms 25452 KB Output is correct
31 Correct 538 ms 31688 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 193 ms 14076 KB Output is correct
46 Correct 300 ms 19616 KB Output is correct
47 Correct 306 ms 19580 KB Output is correct
48 Incorrect 0 ms 280 KB Tree (a[2], b[2]) = (3, 3) is not adjacent to edge between u[2]=1 @(4, 2) and v[2]=0 @(6, 2)
49 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 159 ms 13848 KB Output is correct
10 Correct 11 ms 1996 KB Output is correct
11 Correct 61 ms 8396 KB Output is correct
12 Correct 17 ms 2712 KB Output is correct
13 Correct 35 ms 5476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 157 ms 13936 KB Output is correct
17 Incorrect 0 ms 204 KB Tree (a[0], b[0]) = (5, 3) is not adjacent to edge between u[0]=0 @(200000, 2) and v[0]=1 @(200000, 4)
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 159 ms 13848 KB Output is correct
10 Correct 11 ms 1996 KB Output is correct
11 Correct 61 ms 8396 KB Output is correct
12 Correct 17 ms 2712 KB Output is correct
13 Correct 35 ms 5476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 157 ms 13936 KB Output is correct
17 Incorrect 491 ms 26736 KB Tree (a[0], b[0]) = (3, 100003) is not adjacent to edge between u[0]=0 @(82422, 100002) and v[0]=168975 @(82424, 100002)
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 159 ms 13848 KB Output is correct
10 Correct 11 ms 1996 KB Output is correct
11 Correct 61 ms 8396 KB Output is correct
12 Correct 17 ms 2712 KB Output is correct
13 Correct 35 ms 5476 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 157 ms 13936 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 509 ms 31600 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 4 ms 680 KB Output is correct
27 Correct 4 ms 716 KB Output is correct
28 Correct 153 ms 13068 KB Output is correct
29 Correct 271 ms 19416 KB Output is correct
30 Correct 379 ms 25452 KB Output is correct
31 Correct 538 ms 31688 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 193 ms 14076 KB Output is correct
46 Correct 300 ms 19616 KB Output is correct
47 Correct 306 ms 19580 KB Output is correct
48 Incorrect 0 ms 280 KB Tree (a[2], b[2]) = (3, 3) is not adjacent to edge between u[2]=1 @(4, 2) and v[2]=0 @(6, 2)
49 Halted 0 ms 0 KB -