oj.uz

답안 #814193

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
814193 2023-08-08T06:14:08 Z alvingogo 분수 공원 (IOI21_parks) C++17
0 / 100
 0 ms 212 KB 
#include "parks.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

struct DSU{
    vector<int> bo,ss;
    void init(int x){
        bo.resize(x);
        ss.resize(x,1);
        iota(bo.begin(),bo.end(),0);
    }  
    int find(int x){
        return bo[x]==x?x:bo[x]=find(bo[x]);
    }
    int merge(int x,int y){
        x=find(x);
        y=find(y);
        if(x==y){
            return 0;
        }
        bo[x]=y;
        ss[y]+=ss[x];
        return 1;
    }
}dsu;
vector<int> au,av,aa,ab;
void ag(int a,int b,int c,int d){
    au.push_back(a);
    av.push_back(b);
    aa.push_back(c);
    ab.push_back(d);
}
int construct_roads(vector<int> x, vector<int> y) {
    if (x.size() == 1) {
	    build({}, {}, {}, {});
        return 1;
    }
    map<pair<int,int>,int> m;
    int n=x.size();
    for(int i=0;i<n;i++){
        m[pair<int,int>(x[i],y[i]+2)]=i+1;
    }
    dsu.init(n);
    vector<int> up(n,-1),l(n,-1),r(n,-1);
    vector<pair<int,int> > lb;
    for(int p=0;p<n;p++){
        if(m.find(pair<int,int>(x[p],y[p]+2))!=m.end()){
            int a=m[pair<int,int>(x[p],y[p]+2)]-1;
            dsu.merge(a,p);
            if(x[p]==2){
                ag(a,p,1,y[p]+1);
            }
            else if(x[p]==6){
                ag(a,p,7,y[p]+1);
            }
            else{
                up[a]=p;
            }
        }
    }
    for(int p=0;p<n;p++){
        if(x[p]==4){
            lb.push_back({y[p],p});
            if(m.find(pair<int,int>(2,y[p]))!=m.end()){
                int a=m[pair<int,int>(2,y[p])]-1;
                if(dsu.merge(a,p)){
                    l[p]=a;
                }
            }
            if(m.find(pair<int,int>(6,y[p]))!=m.end()){
                int a=m[pair<int,int>(6,y[p])]-1;
                if(dsu.merge(a,p)){
                    r[p]=a;
                }
            }
        }
    }
    if(dsu.ss[dsu.find(0)]!=n){
        return 0;
    }
    sort(lb.begin(),lb.end());
    int flag=0;
    for(auto h:lb){
        int i=h.sc;
        if(flag){
            if(up[i]>=0){
                ag(up[i],i,3,h.fs-1);
            }
            assert(l[i]<0 && r[i]<0);
            flag=0;
            continue;
        }
        if(up[i]>=0){
            if(l[i]>=0 && r[i]>=0){
                ag(l[i],i,3,h.fs-1);
                ag(up[i],i,5,h.fs-1);
                ag(r[i],i,5,h.fs+1);
                flag=1;
            }
            else if(l[i]>=0){
                ag(l[i],i,3,h.fs-1);
                ag(up[i],i,5,h.fs-1);
            }
            else if(r[i]>=0){
                ag(r[i],i,5,h.fs-1);
                ag(up[i],i,3,h.fs-1);
            }
            else{
                ag(up[i],i,3,h.fs-1);
            }
        }
        else{
            if(l[i]>=0){
                ag(l[i],i,3,h.fs-1);
            }
            if(r[i]>=0){
                ag(r[i],i,5,h.fs-1);
            }
        }
    }
    build(au,av,aa,ab);
    return 1;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
3 Halted 0 ms 0 KB -