oj.uz

답안 #814197

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
814197 2023-08-08T06:16:22 Z alvingogo 분수 공원 (IOI21_parks) C++17
15 / 100
 323 ms 30220 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(flag){
            if(up[i]>=0){
                ag(up[i],i,3,h.fs-1);
            }
            assert(l[h.fs]>=0 && r[h.fs]>=0 && up[h.fs]>=0);
            flag=0;
            lst=h.sc;
            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.sc;
    }
    build(au,av,aa,ab);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:86:9: warning: variable 'lst' set but not used [-Wunused-but-set-variable]
   86 |     int lst=0;
      |         ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 105 ms 14880 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8268 KB Output is correct
12 Correct 10 ms 2772 KB Output is correct
13 Correct 22 ms 5448 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 106 ms 14900 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 105 ms 14880 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8268 KB Output is correct
12 Correct 10 ms 2772 KB Output is correct
13 Correct 22 ms 5448 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 106 ms 14900 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 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 307 ms 30116 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 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 109 ms 12416 KB Output is correct
29 Correct 166 ms 18344 KB Output is correct
30 Correct 257 ms 24180 KB Output is correct
31 Correct 323 ms 30220 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 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 596 KB Output is correct
45 Correct 120 ms 15268 KB Output is correct
46 Correct 215 ms 22488 KB Output is correct
47 Correct 207 ms 22448 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 105 ms 14880 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8268 KB Output is correct
12 Correct 10 ms 2772 KB Output is correct
13 Correct 22 ms 5448 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 106 ms 14900 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 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 307 ms 30116 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 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 109 ms 12416 KB Output is correct
29 Correct 166 ms 18344 KB Output is correct
30 Correct 257 ms 24180 KB Output is correct
31 Correct 323 ms 30220 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 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 596 KB Output is correct
45 Correct 120 ms 15268 KB Output is correct
46 Correct 215 ms 22488 KB Output is correct
47 Correct 207 ms 22448 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Runtime error 1 ms 340 KB Execution killed with signal 6
52 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 105 ms 14880 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8268 KB Output is correct
12 Correct 10 ms 2772 KB Output is correct
13 Correct 22 ms 5448 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 106 ms 14900 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 1 ms 212 KB Output is correct
2 Correct 1 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 105 ms 14880 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8268 KB Output is correct
12 Correct 10 ms 2772 KB Output is correct
13 Correct 22 ms 5448 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 106 ms 14900 KB Output is correct
17 Incorrect 187 ms 20692 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 1 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 105 ms 14880 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 40 ms 8268 KB Output is correct
12 Correct 10 ms 2772 KB Output is correct
13 Correct 22 ms 5448 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 106 ms 14900 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 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 307 ms 30116 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 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 109 ms 12416 KB Output is correct
29 Correct 166 ms 18344 KB Output is correct
30 Correct 257 ms 24180 KB Output is correct
31 Correct 323 ms 30220 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 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 596 KB Output is correct
45 Correct 120 ms 15268 KB Output is correct
46 Correct 215 ms 22488 KB Output is correct
47 Correct 207 ms 22448 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Runtime error 1 ms 340 KB Execution killed with signal 6
52 Halted 0 ms 0 KB -