oj.uz

답안 #796509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796509 2023-07-28T13:00:28 Z Khizri 분수 공원 (IOI21_parks) C++17
5 / 100
 344 ms 49736 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<pair<pii,int>>vt;
map<pii,int>mp;
vector<int>adj[mxn];
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(pair<pii,int> a,pair<pii,int> b){
    return a.F.S<b.F.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]},i+1});
        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));
    for(int i=1;i<n;i++){
        if(abs(vt[i].F.F-vt[i-1].F.F)+abs(vt[i].F.S-vt[i-1].F.S)==2){
            Union(vt[i-1].S,vt[i].S);
        }
    }
    sort(all(vt),cmp);
    for(int i=1;i<n;i++){
        if(abs(vt[i].F.F-vt[i-1].F.F)+abs(vt[i].F.S-vt[i-1].F.S)==2){
            Union(vt[i-1].S,vt[i].S);
        }
    }
    if(sz[fnd(1)]!=n) return 0;
    for(int i=1;i<=n;i++){
        int l=x[i],r=y[i];
        int node=mp[{l,r}];
        int a=l+2,b=r;
        int c=l,d=r+2;
        int color=((l+r)/2)%2;
        int idx=mp[{a,b}];
        int idx2=mp[{c,d}];
        if(idx){
            int pos1=(l+a)/2,pos2=(r+b)/2;
            if(color){
                pos2++;
            }
            else{
                pos2--;
            }
            idxl.pb(node-1);
            idxr.pb(idx-1);
            posl.pb(pos1);
            posr.pb(pos2);
        }
        if(idx2){
            int pos1=(l+c)/2,pos2=(r+d)/2;
            if(color){
                pos1--;
            }
            else{
                pos1++;
            }
            idxl.pb(node-1);
            idxr.pb(idx2-1);
            posl.pb(pos1);
            posr.pb(pos2);
        }
    }
    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 3 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5008 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 164 ms 29952 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 59 ms 18428 KB Output is correct
12 Correct 16 ms 8788 KB Output is correct
13 Correct 21 ms 10320 KB Output is correct
14 Correct 3 ms 5016 KB Output is correct
15 Correct 5 ms 5164 KB Output is correct
16 Correct 166 ms 29940 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5008 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 164 ms 29952 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 59 ms 18428 KB Output is correct
12 Correct 16 ms 8788 KB Output is correct
13 Correct 21 ms 10320 KB Output is correct
14 Correct 3 ms 5016 KB Output is correct
15 Correct 5 ms 5164 KB Output is correct
16 Correct 166 ms 29940 KB Output is correct
17 Incorrect 2 ms 4948 KB Tree @(3, 3) appears more than once: for edges on positions 1 and 3
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5008 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 164 ms 29952 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 59 ms 18428 KB Output is correct
12 Correct 16 ms 8788 KB Output is correct
13 Correct 21 ms 10320 KB Output is correct
14 Correct 3 ms 5016 KB Output is correct
15 Correct 5 ms 5164 KB Output is correct
16 Correct 166 ms 29940 KB Output is correct
17 Incorrect 2 ms 4948 KB Tree @(3, 3) appears more than once: for edges on positions 1 and 3
18 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5008 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 164 ms 29952 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 59 ms 18428 KB Output is correct
12 Correct 16 ms 8788 KB Output is correct
13 Correct 21 ms 10320 KB Output is correct
14 Correct 3 ms 5016 KB Output is correct
15 Correct 5 ms 5164 KB Output is correct
16 Correct 166 ms 29940 KB Output is correct
17 Correct 2 ms 4916 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 344 ms 49736 KB Output is correct
21 Incorrect 149 ms 28432 KB Solution announced impossible, but it is possible.
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5008 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 164 ms 29952 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 59 ms 18428 KB Output is correct
12 Correct 16 ms 8788 KB Output is correct
13 Correct 21 ms 10320 KB Output is correct
14 Correct 3 ms 5016 KB Output is correct
15 Correct 5 ms 5164 KB Output is correct
16 Correct 166 ms 29940 KB Output is correct
17 Incorrect 156 ms 28808 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5004 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 5008 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 164 ms 29952 KB Output is correct
10 Correct 13 ms 7636 KB Output is correct
11 Correct 59 ms 18428 KB Output is correct
12 Correct 16 ms 8788 KB Output is correct
13 Correct 21 ms 10320 KB Output is correct
14 Correct 3 ms 5016 KB Output is correct
15 Correct 5 ms 5164 KB Output is correct
16 Correct 166 ms 29940 KB Output is correct
17 Incorrect 2 ms 4948 KB Tree @(3, 3) appears more than once: for edges on positions 1 and 3
18 Halted 0 ms 0 KB -