oj.uz

Submission #441392

# Submission time Handle Problem Language Result Execution time Memory
441392 2021-07-05T06:40:33 Z daniel920712 Fountain Parks (IOI21_parks) C++17
5 / 100
 3500 ms 67036 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,how=0;
    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())
        {
            how++;
            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())
        {
            how++;
            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(ok)
    {
        if(how!=N-1) while(1);
    }
    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:79:32: warning: 'bb' may be used uninitialized in this function [-Wmaybe-uninitialized]
   79 |             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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 465 ms 33028 KB Output is correct
10 Correct 27 ms 3908 KB Output is correct
11 Correct 178 ms 18896 KB Output is correct
12 Correct 46 ms 5584 KB Output is correct
13 Correct 129 ms 14168 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 447 ms 33004 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 465 ms 33028 KB Output is correct
10 Correct 27 ms 3908 KB Output is correct
11 Correct 178 ms 18896 KB Output is correct
12 Correct 46 ms 5584 KB Output is correct
13 Correct 129 ms 14168 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 447 ms 33004 KB Output is correct
17 Execution timed out 3562 ms 204 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 465 ms 33028 KB Output is correct
10 Correct 27 ms 3908 KB Output is correct
11 Correct 178 ms 18896 KB Output is correct
12 Correct 46 ms 5584 KB Output is correct
13 Correct 129 ms 14168 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 447 ms 33004 KB Output is correct
17 Execution timed out 3562 ms 204 KB Time limit exceeded
18 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 465 ms 33028 KB Output is correct
10 Correct 27 ms 3908 KB Output is correct
11 Correct 178 ms 18896 KB Output is correct
12 Correct 46 ms 5584 KB Output is correct
13 Correct 129 ms 14168 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 447 ms 33004 KB Output is correct
17 Correct 1 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 1097 ms 51768 KB Output is correct
21 Correct 1160 ms 51620 KB Output is correct
22 Correct 1084 ms 51548 KB Output is correct
23 Correct 980 ms 56472 KB Output is correct
24 Correct 326 ms 16704 KB Output is correct
25 Correct 1120 ms 60780 KB Output is correct
26 Correct 1115 ms 60680 KB Output is correct
27 Correct 1158 ms 67036 KB Output is correct
28 Correct 1291 ms 67012 KB Output is correct
29 Correct 1319 ms 66688 KB Output is correct
30 Correct 1259 ms 66520 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 46 ms 3852 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 465 ms 33028 KB Output is correct
10 Correct 27 ms 3908 KB Output is correct
11 Correct 178 ms 18896 KB Output is correct
12 Correct 46 ms 5584 KB Output is correct
13 Correct 129 ms 14168 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 447 ms 33004 KB Output is correct
17 Execution timed out 3537 ms 60868 KB Time limit exceeded
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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 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 465 ms 33028 KB Output is correct
10 Correct 27 ms 3908 KB Output is correct
11 Correct 178 ms 18896 KB Output is correct
12 Correct 46 ms 5584 KB Output is correct
13 Correct 129 ms 14168 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 4 ms 844 KB Output is correct
16 Correct 447 ms 33004 KB Output is correct
17 Execution timed out 3562 ms 204 KB Time limit exceeded
18 Halted 0 ms 0 KB -