oj.uz

Submission #441388

# Submission time Handle Problem Language Result Execution time Memory
441388 2021-07-05T06:35:56 Z daniel920712 Fountain Parks (IOI21_parks) C++17
15 / 100
 1463 ms 70388 KB 
#include "parks.h"
#include <map>
#include <utility>
#include <queue>
using namespace std;
map < pair < int , int > , int > all,con;
map < pair < int , int > , pair < int , int > > road;
vector < int > u,v,a,b;
queue < pair < int , int > > BFS;
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,xx,yy;
    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)];
            road[make_pair(x[i],y[i]+1)]=make_pair(i,t);
            con[make_pair(x[i]+1,y[i]+1)]++;
            con[make_pair(x[i]-1,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])];
            road[make_pair(x[i]+1,y[i])]=make_pair(i,t);
            con[make_pair(x[i]+1,y[i]+1)]++;
            con[make_pair(x[i]+1,y[i]-1)]++;
            aa=Find(i);
            bb=Find(t);
            if(aa!=bb) Father[aa]=bb;
        }
    }
    for(auto i:con) if(i.second==1) BFS.push(i.first);
    while(!BFS.empty())
    {
        xx=BFS.front().first;
        yy=BFS.front().second;
        BFS.pop();
        if(con[make_pair(xx,yy)]==0) continue;
        if(road.find(make_pair(xx+1,yy))!=road.end()) aa=xx+1,bb=yy;
        if(road.find(make_pair(xx-1,yy))!=road.end()) aa=xx-1,bb=yy;
        if(road.find(make_pair(xx,yy+1))!=road.end()) aa=xx,bb=yy+1;
        if(road.find(make_pair(xx,yy-1))!=road.end()) aa=xx,bb=yy-1;
        u.push_back(road[make_pair(aa,bb)].first);
        v.push_back(road[make_pair(aa,bb)].second);
        a.push_back(xx);
        b.push_back(yy);
        road.erase(make_pair(aa,bb));
        if(aa%2==0)
        {
            con[make_pair(aa-1,bb)]--;
            con[make_pair(aa+1,bb)]--;

            if(con[make_pair(aa-1,bb)]==1) BFS.push(make_pair(aa-1,bb));
            if(con[make_pair(aa+1,bb)]==1) BFS.push(make_pair(aa+1,bb));
        }
        else
        {
            con[make_pair(aa,bb-1)]--;
            con[make_pair(aa,bb+1)]--;

            if(con[make_pair(aa,bb-1)]==1) BFS.push(make_pair(aa,bb-1));
            if(con[make_pair(aa,bb+1)]==1) BFS.push(make_pair(aa,bb+1));
        }

    }

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

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:77:32: warning: 'bb' may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |             con[make_pair(aa,bb+1)]--;
      |                              ~~^~

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 463 ms 33012 KB Output is correct
10 Correct 37 ms 3864 KB Output is correct
11 Correct 177 ms 18888 KB Output is correct
12 Correct 52 ms 5572 KB Output is correct
13 Correct 137 ms 14172 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 449 ms 33060 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 463 ms 33012 KB Output is correct
10 Correct 37 ms 3864 KB Output is correct
11 Correct 177 ms 18888 KB Output is correct
12 Correct 52 ms 5572 KB Output is correct
13 Correct 137 ms 14172 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 449 ms 33060 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1463 ms 70388 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 9 ms 1168 KB Output is correct
27 Correct 12 ms 1568 KB Output is correct
28 Correct 475 ms 28540 KB Output is correct
29 Correct 785 ms 42348 KB Output is correct
30 Correct 1111 ms 56360 KB Output is correct
31 Correct 1438 ms 70284 KB Output is correct
32 Correct 0 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 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 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 6 ms 716 KB Output is correct
44 Correct 9 ms 972 KB Output is correct
45 Correct 501 ms 28760 KB Output is correct
46 Correct 844 ms 41636 KB Output is correct
47 Correct 800 ms 41852 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 463 ms 33012 KB Output is correct
10 Correct 37 ms 3864 KB Output is correct
11 Correct 177 ms 18888 KB Output is correct
12 Correct 52 ms 5572 KB Output is correct
13 Correct 137 ms 14172 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 449 ms 33060 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1463 ms 70388 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 9 ms 1168 KB Output is correct
27 Correct 12 ms 1568 KB Output is correct
28 Correct 475 ms 28540 KB Output is correct
29 Correct 785 ms 42348 KB Output is correct
30 Correct 1111 ms 56360 KB Output is correct
31 Correct 1438 ms 70284 KB Output is correct
32 Correct 0 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 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 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 6 ms 716 KB Output is correct
44 Correct 9 ms 972 KB Output is correct
45 Correct 501 ms 28760 KB Output is correct
46 Correct 844 ms 41636 KB Output is correct
47 Correct 800 ms 41852 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Incorrect 0 ms 204 KB Solution announced impossible, but it is possible.
52 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 463 ms 33012 KB Output is correct
10 Correct 37 ms 3864 KB Output is correct
11 Correct 177 ms 18888 KB Output is correct
12 Correct 52 ms 5572 KB Output is correct
13 Correct 137 ms 14172 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 449 ms 33060 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 292 KB Output is correct
20 Correct 985 ms 52372 KB Output is correct
21 Correct 1160 ms 52164 KB Output is correct
22 Correct 1074 ms 52032 KB Output is correct
23 Correct 894 ms 56832 KB Output is correct
24 Correct 321 ms 17092 KB Output is correct
25 Correct 1109 ms 61336 KB Output is correct
26 Correct 1072 ms 61224 KB Output is correct
27 Correct 1211 ms 67488 KB Output is correct
28 Correct 1166 ms 67580 KB Output is correct
29 Correct 1222 ms 67200 KB Output is correct
30 Correct 1234 ms 67068 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Incorrect 47 ms 3988 KB Solution announced impossible, but it is possible.
33 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 463 ms 33012 KB Output is correct
10 Correct 37 ms 3864 KB Output is correct
11 Correct 177 ms 18888 KB Output is correct
12 Correct 52 ms 5572 KB Output is correct
13 Correct 137 ms 14172 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 449 ms 33060 KB Output is correct
17 Correct 1086 ms 67080 KB Output is correct
18 Incorrect 1000 ms 61472 KB Solution announced impossible, but it is possible.
19 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 463 ms 33012 KB Output is correct
10 Correct 37 ms 3864 KB Output is correct
11 Correct 177 ms 18888 KB Output is correct
12 Correct 52 ms 5572 KB Output is correct
13 Correct 137 ms 14172 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 449 ms 33060 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1463 ms 70388 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 9 ms 1168 KB Output is correct
27 Correct 12 ms 1568 KB Output is correct
28 Correct 475 ms 28540 KB Output is correct
29 Correct 785 ms 42348 KB Output is correct
30 Correct 1111 ms 56360 KB Output is correct
31 Correct 1438 ms 70284 KB Output is correct
32 Correct 0 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 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 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 6 ms 716 KB Output is correct
44 Correct 9 ms 972 KB Output is correct
45 Correct 501 ms 28760 KB Output is correct
46 Correct 844 ms 41636 KB Output is correct
47 Correct 800 ms 41852 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Incorrect 0 ms 204 KB Solution announced impossible, but it is possible.
52 Halted 0 ms 0 KB -