oj.uz

답안 #796309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796309 2023-07-28T09:09:37 Z Khizri 분수 공원 (IOI21_parks) C++17
5 / 100
 379 ms 56824 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
const int mxn=2e5+5;
int n,x[mxn],y[mxn],p[mxn],sz[mxn];
int ax[4]={1,1,-1,-1};
int ay[4]={-1,1,1,-1};
vector<pii>vt;
map<pii,int>mp;
int fnd(int u){
    if(p[u]==u) return u;
    return p[u]=fnd(p[u]);
}
void Union(int u,int v){
    u=fnd(u);
    v=fnd(v);
    if(u!=v){
        if(sz[u]>sz[v]) swap(u,v);
        sz[u]+=sz[v];
        p[v]=u;
    }
}
bool cmp(pii a,pii b){
    return a.F+a.S<b.F+b.S;
}
int construct_roads(vector<int> xx, vector<int> yy) {
    n=xx.size();
    if(n==1){
        build({},{},{},{});
        return 1;
    }
    for(int i=0;i<n;i++){
        vt.pb({xx[i],yy[i]});
        mp[{xx[i],yy[i]}]=i+1;
        x[i+1]=xx[i];
        y[i+1]=yy[i];
    }
    set<pii>st;
    for(int i=1;i<=n;i++){
        p[i]=i;
        sz[i]=1;
    }
    vector<int>idxl,idxr,posl,posr;
    sort(all(vt),cmp);
    for(int i=1;i<n;i++){
        int l=vt[i].F,r=vt[i].S;
        int a=l-2,b=r;
        int c=l,d=r-2;
        int u=mp[{l,r}];
        int idx=mp[{a,b}];
        int idx2=mp[{c,d}];   
        if(idx){
            int p1=(a+l)/2,p2=(b+r)/2;
            if(p1%2){
                if(!st.count({p1,p2-1})){
                    idxl.pb(u-1);
                    idxr.pb(idx-1);
                    posl.pb(p1);
                    posr.pb(p2-1);
                    Union(u,idx);
                    st.insert({p1,p2-1});
                    continue;
                }
                else if(!st.count({p1,p2+1})){
                    idxl.pb(u-1);
                    idxr.pb(idx-1);
                    posl.pb(p1);
                    posr.pb(p2+1);
                    Union(u,idx);
                    st.insert({p1,p2+1});
                    continue;
                }
            }
            else{
                if(!st.count({p1-1,p2})){
                    idxl.pb(u-1);
                    idxr.pb(idx-1);
                    posl.pb(p1-1);
                    posr.pb(p2);
                    Union(u,idx);
                    st.insert({p1-1,p2});
                    continue;
                }
                else if(!st.count({p1+1,p2})){
                    idxl.pb(u-1);
                    idxr.pb(idx-1);
                    posl.pb(p1+1);
                    posr.pb(p2);
                    Union(u,idx);
                    st.insert({p1+1,p2});
                    continue;
                }
            }
        }
        if(idx2){
            int p1=(c+l)/2,p2=(d+r)/2;
            if(p1%2){
                if(!st.count({p1,p2-1})){
                    idxl.pb(u-1);
                    idxr.pb(idx2-1);
                    posl.pb(p1);
                    posr.pb(p2-1);
                    st.insert({p1,p2-1});
                    Union(u,idx2);
                    continue;
                }
                else if(!st.count({p1,p2+1})){
                    idxl.pb(u-1);
                    idxr.pb(idx2-1);
                    posl.pb(p1);
                    posr.pb(p2+1);
                    Union(u,idx2);
                    st.insert({p1,p2+1});
                    continue;
                }
            }
            else{
                if(!st.count({p1-1,p2})){
                    idxl.pb(u-1);
                    idxr.pb(idx2-1);
                    posl.pb(p1-1);
                    posr.pb(p2);
                    Union(u,idx2);
                    st.insert({p1-1,p2});
                    continue;
                }
                else if(!st.count({p1+1,p2})){
                    idxl.pb(u-1);
                    idxr.pb(idx2-1);
                    posl.pb(p1+1);
                    posr.pb(p2);
                    Union(u,idx2);
                    st.insert({p1+1,p2});
                    continue;
                }
            }
        }
    }
    if(sz[fnd(1)]!=n) return 0;
    build(idxl,idxr,posl,posr);
    return 1;
}
/*
cd "c:\Users\User\Desktop\parks (4)\cpp\" ; if ($?) { g++ parks.cpp grader.cpp -o parks } ; if ($?) { .\a.exe }
5
4 4 
4 6 
6 4
4 2
2 4
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 149 ms 28712 KB Output is correct
10 Correct 13 ms 3240 KB Output is correct
11 Correct 81 ms 15616 KB Output is correct
12 Correct 16 ms 4576 KB Output is correct
13 Correct 42 ms 10828 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 155 ms 28044 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 149 ms 28712 KB Output is correct
10 Correct 13 ms 3240 KB Output is correct
11 Correct 81 ms 15616 KB Output is correct
12 Correct 16 ms 4576 KB Output is correct
13 Correct 42 ms 10828 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 155 ms 28044 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 337 ms 48808 KB Output is correct
24 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
25 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 149 ms 28712 KB Output is correct
10 Correct 13 ms 3240 KB Output is correct
11 Correct 81 ms 15616 KB Output is correct
12 Correct 16 ms 4576 KB Output is correct
13 Correct 42 ms 10828 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 155 ms 28044 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 337 ms 48808 KB Output is correct
24 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
25 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 149 ms 28712 KB Output is correct
10 Correct 13 ms 3240 KB Output is correct
11 Correct 81 ms 15616 KB Output is correct
12 Correct 16 ms 4576 KB Output is correct
13 Correct 42 ms 10828 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 155 ms 28044 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
19 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 149 ms 28712 KB Output is correct
10 Correct 13 ms 3240 KB Output is correct
11 Correct 81 ms 15616 KB Output is correct
12 Correct 16 ms 4576 KB Output is correct
13 Correct 42 ms 10828 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 155 ms 28044 KB Output is correct
17 Correct 379 ms 55452 KB Output is correct
18 Correct 354 ms 56824 KB Output is correct
19 Incorrect 329 ms 39996 KB Solution announced impossible, but it is possible.
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 149 ms 28712 KB Output is correct
10 Correct 13 ms 3240 KB Output is correct
11 Correct 81 ms 15616 KB Output is correct
12 Correct 16 ms 4576 KB Output is correct
13 Correct 42 ms 10828 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 155 ms 28044 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 337 ms 48808 KB Output is correct
24 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
25 Halted 0 ms 0 KB -