oj.uz

답안 #814189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
814189 2023-08-08T06:11:58 Z alvingogo 분수 공원 (IOI21_parks) C++17
15 / 100
 351 ms 30476 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[{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({x[p],y[p]+2})!=m.end()){
            int a=m[{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({2,y[p]})!=m.end()){
                int a=m[{2,y[p]}]-1;
                if(dsu.merge(a,p)){
                    l[p]=a;
                }
            }
            if(m.find({6,y[p]})!=m.end()){
                int a=m[{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
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 1 ms 300 KB Output is correct
4 Correct 1 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 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 113 ms 15116 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8424 KB Output is correct
12 Correct 11 ms 2772 KB Output is correct
13 Correct 22 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 114 ms 15280 KB Output is correct

Subtask #2
10.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 1 ms 300 KB Output is correct
4 Correct 1 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 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 113 ms 15116 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8424 KB Output is correct
12 Correct 11 ms 2772 KB Output is correct
13 Correct 22 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 114 ms 15280 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 325 ms 30476 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 564 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 95 ms 12596 KB Output is correct
29 Correct 156 ms 18584 KB Output is correct
30 Correct 233 ms 24504 KB Output is correct
31 Correct 327 ms 30396 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 300 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 296 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 300 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 127 ms 15496 KB Output is correct
46 Correct 200 ms 22652 KB Output is correct
47 Correct 199 ms 22680 KB Output is correct

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 1 ms 300 KB Output is correct
4 Correct 1 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 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 113 ms 15116 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8424 KB Output is correct
12 Correct 11 ms 2772 KB Output is correct
13 Correct 22 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 114 ms 15280 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 325 ms 30476 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 564 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 95 ms 12596 KB Output is correct
29 Correct 156 ms 18584 KB Output is correct
30 Correct 233 ms 24504 KB Output is correct
31 Correct 327 ms 30396 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 300 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 296 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 300 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 127 ms 15496 KB Output is correct
46 Correct 200 ms 22652 KB Output is correct
47 Correct 199 ms 22680 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 300 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 296 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 327 ms 30172 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 2 ms 568 KB Output is correct
58 Correct 6 ms 1364 KB Output is correct
59 Correct 9 ms 1484 KB Output is correct
60 Correct 135 ms 15520 KB Output is correct
61 Correct 185 ms 20568 KB Output is correct
62 Correct 259 ms 25096 KB Output is correct
63 Correct 351 ms 30124 KB Output is correct
64 Correct 1 ms 292 KB Output is correct
65 Correct 0 ms 296 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 271 ms 29604 KB Output is correct
68 Correct 263 ms 29756 KB Output is correct
69 Correct 261 ms 29528 KB Output is correct
70 Correct 3 ms 696 KB Output is correct
71 Correct 6 ms 1236 KB Output is correct
72 Runtime error 96 ms 22856 KB Execution killed with signal 6
73 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 1 ms 300 KB Output is correct
4 Correct 1 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 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 113 ms 15116 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8424 KB Output is correct
12 Correct 11 ms 2772 KB Output is correct
13 Correct 22 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 114 ms 15280 KB Output is correct
17 Incorrect 1 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 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 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 113 ms 15116 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8424 KB Output is correct
12 Correct 11 ms 2772 KB Output is correct
13 Correct 22 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 114 ms 15280 KB Output is correct
17 Incorrect 207 ms 21036 KB Solution announced impossible, but it is possible.
18 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 1 ms 300 KB Output is correct
4 Correct 1 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 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 113 ms 15116 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8424 KB Output is correct
12 Correct 11 ms 2772 KB Output is correct
13 Correct 22 ms 5760 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 114 ms 15280 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 325 ms 30476 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 564 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 95 ms 12596 KB Output is correct
29 Correct 156 ms 18584 KB Output is correct
30 Correct 233 ms 24504 KB Output is correct
31 Correct 327 ms 30396 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 300 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 296 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 300 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 127 ms 15496 KB Output is correct
46 Correct 200 ms 22652 KB Output is correct
47 Correct 199 ms 22680 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 300 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 296 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 327 ms 30172 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 2 ms 568 KB Output is correct
58 Correct 6 ms 1364 KB Output is correct
59 Correct 9 ms 1484 KB Output is correct
60 Correct 135 ms 15520 KB Output is correct
61 Correct 185 ms 20568 KB Output is correct
62 Correct 259 ms 25096 KB Output is correct
63 Correct 351 ms 30124 KB Output is correct
64 Correct 1 ms 292 KB Output is correct
65 Correct 0 ms 296 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 271 ms 29604 KB Output is correct
68 Correct 263 ms 29756 KB Output is correct
69 Correct 261 ms 29528 KB Output is correct
70 Correct 3 ms 696 KB Output is correct
71 Correct 6 ms 1236 KB Output is correct
72 Runtime error 96 ms 22856 KB Execution killed with signal 6
73 Halted 0 ms 0 KB -