oj.uz

답안 #814200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
814200 2023-08-08T06:17:07 Z alvingogo 분수 공원 (IOI21_parks) C++17
30 / 100
 376 ms 30316 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])]=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;
    int lst=0;
    for(auto h:lb){
        int i=h.sc;
        if(lst!=h.fs-2){
            flag=0;
        }
        if(flag){
            if(up[i]>=0){
                ag(up[i],i,3,h.fs-1);
            }
            flag=0;
            lst=h.fs;
            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);
            }
        }
        lst=h.fs;
    }
    build(au,av,aa,ab);
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 0 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 100 ms 14876 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8236 KB Output is correct
12 Correct 12 ms 2712 KB Output is correct
13 Correct 23 ms 5556 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 105 ms 14824 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 0 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 100 ms 14876 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8236 KB Output is correct
12 Correct 12 ms 2712 KB Output is correct
13 Correct 23 ms 5556 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 105 ms 14824 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 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 312 ms 30160 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 94 ms 12376 KB Output is correct
29 Correct 155 ms 18304 KB Output is correct
30 Correct 236 ms 24224 KB Output is correct
31 Correct 319 ms 30128 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 2 ms 572 KB Output is correct
45 Correct 118 ms 15264 KB Output is correct
46 Correct 191 ms 22452 KB Output is correct
47 Correct 220 ms 22468 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 0 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 100 ms 14876 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8236 KB Output is correct
12 Correct 12 ms 2712 KB Output is correct
13 Correct 23 ms 5556 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 105 ms 14824 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 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 312 ms 30160 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 94 ms 12376 KB Output is correct
29 Correct 155 ms 18304 KB Output is correct
30 Correct 236 ms 24224 KB Output is correct
31 Correct 319 ms 30128 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 2 ms 572 KB Output is correct
45 Correct 118 ms 15264 KB Output is correct
46 Correct 191 ms 22452 KB Output is correct
47 Correct 220 ms 22468 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 326 ms 29936 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 6 ms 1236 KB Output is correct
59 Correct 9 ms 1472 KB Output is correct
60 Correct 129 ms 15072 KB Output is correct
61 Correct 196 ms 20316 KB Output is correct
62 Correct 249 ms 24772 KB Output is correct
63 Correct 376 ms 30128 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 255 ms 29344 KB Output is correct
68 Correct 250 ms 29344 KB Output is correct
69 Correct 325 ms 29224 KB Output is correct
70 Correct 3 ms 724 KB Output is correct
71 Correct 6 ms 1108 KB Output is correct
72 Correct 127 ms 15132 KB Output is correct
73 Correct 200 ms 22676 KB Output is correct
74 Correct 352 ms 30076 KB Output is correct
75 Correct 304 ms 30316 KB Output is correct
76 Correct 249 ms 29600 KB Output is correct
77 Correct 3 ms 852 KB Output is correct
78 Correct 6 ms 1336 KB Output is correct
79 Correct 122 ms 15372 KB Output is correct
80 Correct 214 ms 22760 KB Output is correct
81 Correct 297 ms 30028 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 0 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 100 ms 14876 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8236 KB Output is correct
12 Correct 12 ms 2712 KB Output is correct
13 Correct 23 ms 5556 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 105 ms 14824 KB Output is correct
17 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 0 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 100 ms 14876 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8236 KB Output is correct
12 Correct 12 ms 2712 KB Output is correct
13 Correct 23 ms 5556 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 105 ms 14824 KB Output is correct
17 Incorrect 209 ms 20772 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
5 Correct 0 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 100 ms 14876 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8236 KB Output is correct
12 Correct 12 ms 2712 KB Output is correct
13 Correct 23 ms 5556 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 105 ms 14824 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 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 312 ms 30160 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 94 ms 12376 KB Output is correct
29 Correct 155 ms 18304 KB Output is correct
30 Correct 236 ms 24224 KB Output is correct
31 Correct 319 ms 30128 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 2 ms 572 KB Output is correct
45 Correct 118 ms 15264 KB Output is correct
46 Correct 191 ms 22452 KB Output is correct
47 Correct 220 ms 22468 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 326 ms 29936 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 6 ms 1236 KB Output is correct
59 Correct 9 ms 1472 KB Output is correct
60 Correct 129 ms 15072 KB Output is correct
61 Correct 196 ms 20316 KB Output is correct
62 Correct 249 ms 24772 KB Output is correct
63 Correct 376 ms 30128 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 255 ms 29344 KB Output is correct
68 Correct 250 ms 29344 KB Output is correct
69 Correct 325 ms 29224 KB Output is correct
70 Correct 3 ms 724 KB Output is correct
71 Correct 6 ms 1108 KB Output is correct
72 Correct 127 ms 15132 KB Output is correct
73 Correct 200 ms 22676 KB Output is correct
74 Correct 352 ms 30076 KB Output is correct
75 Correct 304 ms 30316 KB Output is correct
76 Correct 249 ms 29600 KB Output is correct
77 Correct 3 ms 852 KB Output is correct
78 Correct 6 ms 1336 KB Output is correct
79 Correct 122 ms 15372 KB Output is correct
80 Correct 214 ms 22760 KB Output is correct
81 Correct 297 ms 30028 KB Output is correct
82 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
83 Halted 0 ms 0 KB -