oj.uz

Submission #586891

# Submission time Handle Problem Language Result Execution time Memory
586891 2022-06-30T22:35:16 Z Bench0310 Flood (IOI07_flood) C++17
64 / 100
 579 ms 43068 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N=100001;
int tree[4*(N+5)];
array<int,2> points[N];
array<int,3> hot_pos[4*N];

int tmp[N];
int que[4*N];
int qid=0;
int qsz=0;

void ini_queue(){qid=qsz=0;}
void push_queue(int a){que[qsz++]=a;}
int front_queue()
{
    if(qid<qsz) return que[qid++];
    else return -1;
}

void update(int idx,int l,int r,int ql,int qr,int x)
{
    if(ql>qr) return;
    if(l==ql&&r==qr) tree[idx]=x;
    else
    {
        int m=(l+r)/2;
        update(2*idx,l,m,ql,min(qr,m),x);
        update(2*idx+1,m+1,r,max(ql,m+1),qr,x);
    }
}

int query(int idx,int l,int r,int pos)
{
    if(l==r) return tree[idx];
    int m=(l+r)/2;
    if(pos<=m) return max(tree[idx],query(2*idx,l,m,pos));
    else return max(tree[idx],query(2*idx+1,m+1,r,pos));
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    int hot_cnt=0;
    auto add_hot=[&](int x,int y)->int
    {
        hot_cnt++;
        hot_pos[hot_cnt]={x,y,hot_cnt};
        return hot_cnt;
    };
    for(int i=1;i<=n;i++)
    {
        auto &[x,y]=points[i];
        cin >> x >> y;
    }
    //x_compress
    for(int i=1;i<=n;i++) que[i]=i;
    sort(que+1,que+n+1,[&](int a,int b){return (points[a][0]<points[b][0]);});
    int hx=0;
    for(int i=1;i<=n;i++)
    {
        if(i>1&&points[que[i-1]][0]!=points[que[i]][0]) hx++;
        tmp[que[i]]=hx;
    }
    for(int i=1;i<=n;i++) points[i][0]=tmp[i];
    //y_compress
    sort(que+1,que+n+1,[&](int a,int b){return (points[a][1]<points[b][1]);});
    int hy=0;
    for(int i=1;i<=n;i++)
    {
        if(i>1&&points[que[i-1]][1]!=points[que[i]][1]) hy++;
        tmp[que[i]]=hy;
    }
    for(int i=1;i<=n;i++) points[i][1]=tmp[i];
    for(int i=1;i<=n;i++)
    {
        auto &[x,y]=points[i];
        for(int j=0;j<=1;j++) for(int k=0;k<=1;k++) add_hot(x+j,y+k);
    }
    int m;
    cin >> m;
    vector<array<int,2>> walls(m+1,{0,0});
    vector<array<int,2>> wall_hots(m+1,{0,0});
    for(int i=1;i<=m;i++)
    {
        auto &[a,b]=walls[i];
        cin >> a >> b;
        if(points[a]>points[b]) swap(a,b);
        if(points[a][0]==points[b][0]) wall_hots[i]={4*(a-1)+2,4*(a-1)+4};
        else wall_hots[i]={4*(a-1)+3,4*(a-1)+4};
    }
    vector<array<int,2>> vedges;
    auto add_edge=[&](int a,int b)
    {
        vedges.push_back({a,b});
        vedges.push_back({b,a});
    };
    auto process=[&]()
    {
        //extract edges
        fill(tree,tree+4*(N+5),-1);
        vector<array<int,2>> prv(N+1,{-1,-1}); //x,hot_id
        vector<array<int,4>> events; //x,tp,[y,hot_id] or [yl,yr]
        for(int i=1;i<=hot_cnt;i++) events.push_back({hot_pos[i][0],0,hot_pos[i][1],i});
        for(int i=1;i<=m;i++)
        {
            auto [a,b]=walls[i];
            auto [xa,ya]=points[a];
            auto [xb,yb]=points[b];
            if(xa==xb) events.push_back({xa,1,ya+1,yb});
        }
        sort(events.begin(),events.end());
        for(auto [x,tp,yl,yr]:events)
        {
            if(tp==0)
            {
                int w=query(1,0,N,yl);
                auto [px,pid]=prv[yl];
                if(w<px) add_edge(yr,pid);
                prv[yl]={x,yr};
            }
            else update(1,0,N,yl,yr,x);
        }
        //flip coordinates
        for(int i=1;i<=n;i++) swap(points[i][0],points[i][1]);
        for(int i=1;i<=hot_cnt;i++) swap(hot_pos[i][0],hot_pos[i][1]);
    };
    process();
    process();
    vector<int> cc_id(hot_cnt+1,0);
    int cc_cnt=0;
    ini_queue();
    sort(vedges.begin(),vedges.end());
    vector<int> vedges_start(hot_cnt+1,0);
    for(int i=(int)vedges.size()-1;i>=0;i--) vedges_start[vedges[i][0]]=i;
    for(int i=1;i<=hot_cnt;i++)
    {
        if(cc_id[i]!=0) continue;
        cc_cnt++;
        auto add=[&](int a)
        {
            if(cc_id[a]==0)
            {
                cc_id[a]=cc_cnt;
                push_queue(a);
            }
        };
        add(i);
        while(1)
        {
            int a=front_queue();
            if(a==-1) break;
            for(int j=vedges_start[a];j<(int)vedges.size()&&vedges[j][0]==a;j++) add(vedges[j][1]);
        }
    }
    vedges.clear();
    for(int i=1;i<=m;i++)
    {
        auto [a,b]=wall_hots[i];
        vedges.push_back({cc_id[a],cc_id[b]});
        vedges.push_back({cc_id[b],cc_id[a]});
    }
    sort(vedges.begin(),vedges.end());
    for(int i=(int)vedges.size()-1;i>=0;i--) vedges_start[vedges[i][0]]=i;
    vector<int> d(cc_cnt+1,0);
    sort(hot_pos+1,hot_pos+hot_cnt+1);
    ini_queue();
    auto add=[&](int a,int nd)
    {
        if(d[a]==0)
        {
            d[a]=nd;
            push_queue(a);
        }
    };
    for(int i=1;i<=hot_cnt;i++)
    {
        auto [x,y,hot]=hot_pos[i];
        add(cc_id[hot],1);
        while(1)
        {
            int a=front_queue();
            if(a==-1) break;
            for(int j=vedges_start[a];j<(int)vedges.size()&&vedges[j][0]==a;j++) add(vedges[j][1],d[a]+1);
        }
    }
    vector<int> res;
    for(int i=1;i<=m;i++)
    {
        auto [a,b]=wall_hots[i];
        if(d[cc_id[a]]==d[cc_id[b]]) res.push_back(i);
    }
    cout << res.size() << "\n";
    for(int w:res) cout << w << "\n";
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2756 KB Output is correct
2 Correct 4 ms 2884 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
3.0 / 3.0

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

Subtask #7
3.0 / 3.0

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

Subtask #8
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2824 KB Output is correct
2 Correct 4 ms 2884 KB Output is correct

Subtask #9
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 4 ms 2772 KB Output is correct

Subtask #10
9.0 / 9.0

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

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 339 ms 36408 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 370 ms 37744 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 579 ms 42588 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 553 ms 43068 KB Memory limit exceeded
2 Halted 0 ms 0 KB -