oj.uz

Submission #647876

# Submission time Handle Problem Language Result Execution time Memory
647876 2022-10-04T10:54:39 Z ToroTN Flood (IOI07_flood) C++14
54 / 100
 211 ms 19144 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define X first
#define Y second
int n,m,x[100005],y[100005],wall1,wall2,a1,b1,a2,b2,go[100005][4],st,d[100005];
int nxt[100005][4],p[100005],rev[100005],num,val;
//right=0 down=1 left 2 up=3
vector<pair<pair<int,int>,int > > v;
vector<int> g;
set<int> s;
void dfs(int u,int dir)
{
    for(int i=0;i<4;i++)
    {
        int way=(dir+2+i)%4;
        if(go[u][way]!=0&&go[u][way]!=p[u])
        {
            int bug=d[go[u][way]];
            if(bug!=1)
            {
                if(bug==-1)
                {
                    d[go[u][way]]=0;
                    g.pb(go[u][way]);
                    p[go[u][way]]=u;
                    rev[go[u][way]]=nxt[u][way];
                    dfs(go[u][way],way);
                }else if(bug==0)
                {
                    s.erase(nxt[u][way]);
                    num=u;
                    while(1)
                    {
                        if(num==go[u][way]||num==0)
                        {
                            if(num!=0)d[num]=1;
                            break;
                        }
                        s.erase(rev[num]);
                        d[num]=1;
                        int con=p[num];
                        p[num]=0;
                        num=con;
                    }
                }
            }
        }
    }
    d[u]=1;
    p[u]=0;
}
int main()
{
    memset(d,-1,sizeof d);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&x[i],&y[i]);
        v.pb({{x[i],y[i]},i});
    }
    scanf("%d",&m);
    for(int i=1;i<=m;i++)
    {
        s.insert(i);
        scanf("%d%d",&wall1,&wall2);
        a1=x[wall1];
        b1=y[wall1];
        a2=x[wall2];
        b2=y[wall2];
        if(a1>a2)
        {
            swap(a1,a2);
            swap(wall1,wall2);
        }
        if(a1<a2)
        {
            go[wall1][1]=wall2;
            go[wall2][3]=wall1;
            nxt[wall1][1]=i;
            nxt[wall2][3]=i;
        }
        if(b1>b2)
        {
            swap(b1,b2);
            swap(wall1,wall2);
        }
        if(b1<b2)
        {
            go[wall1][0]=wall2;
            go[wall2][2]=wall1;
            nxt[wall1][0]=i;
            nxt[wall2][2]=i;
        }
    }
    sort(v.begin(),v.end());
    for(int i=0;i<(int)v.size();i++)
    {
        st=v[i].Y;
        if(d[st]==-1)
        {
            val=0;
            d[st]=0;
            g.pb(st);
            dfs(st,2);
            for(int j=0;j<(int)g.size();j++)
            {
                d[g[j]]=1;
            }
            g.clear();
        }
    }
    printf("%d\n",(int)s.size());
    for(auto it:s)printf("%d\n",it);
}

Compilation message

flood.cpp: In function 'int main()':
flood.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
flood.cpp:59:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |         scanf("%d%d",&x[i],&y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~
flood.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |     scanf("%d",&m);
      |     ~~~~~^~~~~~~~~
flood.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |         scanf("%d%d",&wall1,&wall2);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Incorrect 1 ms 724 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct

Subtask #4
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Incorrect 1 ms 724 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct

Subtask #7
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3180 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 11196 KB Output is correct

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 10096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 131 ms 15336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 211 ms 19144 KB Output isn't correct
2 Halted 0 ms 0 KB -