oj.uz

답안 #796559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796559 2023-07-28T13:54:49 Z Khizri 분수 공원 (IOI21_parks) C++17
15 / 100
 788 ms 56268 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++;
            }
            if(!st.count({pos1,pos2})){
                idxl.pb(node-1);
                idxr.pb(idx-1);
                posl.pb(pos1);
                posr.pb(pos2);
                st.insert({pos1,pos2});
            }
        }
        if(idx2){
            int pos1=(l+c)/2,pos2=(r+d)/2;
            if(color){
                pos1++;
            }
            else{
                pos1--;
            }
            if(!st.count({pos1,pos2})){
                idxl.pb(node-1);
                idxr.pb(idx2-1);
                posl.pb(pos1);
                posr.pb(pos2);
                st.insert({pos1,pos2});
            }
        }
    }
    build(idxl,idxr,posl,posr);
    return 1;
}
/*
 { g++ parks.cpp grader.cpp } ; if ($?) { .\a.exe }
9
2 2
2 4
2 6
4 2
4 4
4 6
6 2
6 4
6 6
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 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 297 ms 33868 KB Output is correct
10 Correct 17 ms 7892 KB Output is correct
11 Correct 72 ms 20544 KB Output is correct
12 Correct 21 ms 9348 KB Output is correct
13 Correct 19 ms 10052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 233 ms 33880 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 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 297 ms 33868 KB Output is correct
10 Correct 17 ms 7892 KB Output is correct
11 Correct 72 ms 20544 KB Output is correct
12 Correct 21 ms 9348 KB Output is correct
13 Correct 19 ms 10052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 233 ms 33880 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 746 ms 55380 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 4 ms 5272 KB Output is correct
27 Correct 4 ms 5332 KB Output is correct
28 Correct 174 ms 25176 KB Output is correct
29 Correct 402 ms 35168 KB Output is correct
30 Correct 570 ms 45476 KB Output is correct
31 Correct 788 ms 55436 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 4 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4948 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 4 ms 5204 KB Output is correct
44 Correct 4 ms 5332 KB Output is correct
45 Correct 378 ms 31620 KB Output is correct
46 Correct 539 ms 44008 KB Output is correct
47 Correct 461 ms 44104 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 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 297 ms 33868 KB Output is correct
10 Correct 17 ms 7892 KB Output is correct
11 Correct 72 ms 20544 KB Output is correct
12 Correct 21 ms 9348 KB Output is correct
13 Correct 19 ms 10052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 233 ms 33880 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 746 ms 55380 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 4 ms 5272 KB Output is correct
27 Correct 4 ms 5332 KB Output is correct
28 Correct 174 ms 25176 KB Output is correct
29 Correct 402 ms 35168 KB Output is correct
30 Correct 570 ms 45476 KB Output is correct
31 Correct 788 ms 55436 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 4 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4948 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 4 ms 5204 KB Output is correct
44 Correct 4 ms 5332 KB Output is correct
45 Correct 378 ms 31620 KB Output is correct
46 Correct 539 ms 44008 KB Output is correct
47 Correct 461 ms 44104 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 3 ms 4992 KB Output is correct
50 Correct 3 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 2 ms 4948 KB Output is correct
53 Correct 3 ms 4948 KB Output is correct
54 Correct 3 ms 4900 KB Output is correct
55 Incorrect 669 ms 52776 KB Given structure is not connected: There is no path between vertices 0 and 10587
56 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 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 297 ms 33868 KB Output is correct
10 Correct 17 ms 7892 KB Output is correct
11 Correct 72 ms 20544 KB Output is correct
12 Correct 21 ms 9348 KB Output is correct
13 Correct 19 ms 10052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 233 ms 33880 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 621 ms 56268 KB Output is correct
21 Incorrect 194 ms 26160 KB Solution announced impossible, but it is possible.
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 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 297 ms 33868 KB Output is correct
10 Correct 17 ms 7892 KB Output is correct
11 Correct 72 ms 20544 KB Output is correct
12 Correct 21 ms 9348 KB Output is correct
13 Correct 19 ms 10052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 233 ms 33880 KB Output is correct
17 Incorrect 178 ms 26764 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 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 297 ms 33868 KB Output is correct
10 Correct 17 ms 7892 KB Output is correct
11 Correct 72 ms 20544 KB Output is correct
12 Correct 21 ms 9348 KB Output is correct
13 Correct 19 ms 10052 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 233 ms 33880 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 2 ms 4948 KB Output is correct
23 Correct 746 ms 55380 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 4 ms 5332 KB Output is correct
26 Correct 4 ms 5272 KB Output is correct
27 Correct 4 ms 5332 KB Output is correct
28 Correct 174 ms 25176 KB Output is correct
29 Correct 402 ms 35168 KB Output is correct
30 Correct 570 ms 45476 KB Output is correct
31 Correct 788 ms 55436 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 3 ms 4948 KB Output is correct
34 Correct 3 ms 4948 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 4 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4948 KB Output is correct
42 Correct 2 ms 4948 KB Output is correct
43 Correct 4 ms 5204 KB Output is correct
44 Correct 4 ms 5332 KB Output is correct
45 Correct 378 ms 31620 KB Output is correct
46 Correct 539 ms 44008 KB Output is correct
47 Correct 461 ms 44104 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 3 ms 4992 KB Output is correct
50 Correct 3 ms 4948 KB Output is correct
51 Correct 3 ms 4948 KB Output is correct
52 Correct 2 ms 4948 KB Output is correct
53 Correct 3 ms 4948 KB Output is correct
54 Correct 3 ms 4900 KB Output is correct
55 Incorrect 669 ms 52776 KB Given structure is not connected: There is no path between vertices 0 and 10587
56 Halted 0 ms 0 KB -