oj.uz

답안 #1058796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058796 2024-08-14T13:53:52 Z LittleOrange 분수 공원 (IOI21_parks) C++17
55 / 100
 2409 ms 73136 KB 
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
struct dsu{
    ll n;
    vector<ll> p;
    dsu(ll N):n(N),p(N,-1){}
    ll g(ll i){
        return p[i]<0?i:p[i]=g(p[i]);
    }
    bool m(ll a, ll b){
        a = g(a);
        b = g(b);
        if(a==b) return false;
        if(p[a]>p[b]) swap(a,b);
        p[a]+=p[b];
        p[b]=a;
        return true;
    }
};
struct obj{
    ll x,y,i;
    bool operator<(const obj &o) const{
        return x!=o.x?x<o.x:y<o.y;
    }
    obj operator+(const obj &o) const{
        return {x+o.x,y+o.y,i};
    }
    obj operator-(const obj &o) const{
        return {x-o.x,y-o.y,i};
    }
    bool operator==(const obj &o) const{
        return x==o.x&&y==o.y;
    }
    bool operator!=(const obj &o) const{
        return x!=o.x||y!=o.y;
    }
    obj turn() const{
        return {y,-x,i};
    }
};
struct pr{
    ll i,c;
    bool operator<(const pr &o) const{
        return c>o.c;
    }
};
using pos = obj;
ostream& operator<<(ostream& o, const pos &p){
    return o << "(" << p.x << "," << p.y << ";" << p.i << ")";
}
pos mid(const pos &a, const pos &b){
    return {(a.x+b.x)/2,(a.y+b.y)/2,0};
}
array<pos,2> mids(const pos &a, const pos &b){
    pos m = mid(a,b);
    array<pos,2> r = {m+(a-m).turn(),m+(b-m).turn()};
    ////cerr << "mids of " << a << " " << b << " -> " << r[0] << " " << r[1] << "\n";
    return r;
}
int construct_roads(std::vector<int> x, std::vector<int> y) {
    mt19937_64 mt(random_device{}());
    ll n = x.size();
    vector<obj> fs = {{0,2,0},{0,-2,0},{2,0,0},{-2,0,0}};
    if (x.size() == 1) {
	    build({}, {}, {}, {});
        return 1;
    }
    ll t0 = time(0);
    while(time(0)<t0+3){
        vector<ll> ans_u,ans_v,ans_a,ans_b;
        vector<obj> a(n);
        for(ll i = 0;i<n;i++){
            a[i] = {x[i],y[i],i};
        }
        //shuffle(ord.begin(),ord.end(),mt);
        sort(a.begin(),a.end());
        dsu d(n);
        vector<pair<pos,pos>> cons;
        vector<pair<pos,pos>> ord;
        for(pos u : a){
            for(pos f : fs){
                pos v = u+f;
                auto it = lower_bound(a.begin(),a.end(),v);
                if (it==a.end()||*it!=v) continue;
                v = *it;
                ord.push_back({u,v});
            }
        }
        shuffle(ord.begin(),ord.end(),mt);
        for(auto [u,v] : ord){
            if(d.m(u.i,v.i)){
                //cerr << "con " << u << " " << v << "\n";
                cons.push_back({u,v});
            }
        }
        if(cons.size()<n-1) return 0;
        vector<pos> v;
        for(auto [p0,p1] : cons){
            for(pos p : mids(p0,p1)) v.push_back(p);
        }
        sort(v.begin(),v.end());
        v.erase(unique(v.begin(),v.end()),v.end());
        ll m = v.size();
        vector<pair<pos,pos>> ops;
        vector<vector<ll>> con(m);
        vector<ll> u(n-1,0);
        for(auto [p0,p1] : cons){
            auto o = mids(p0,p1);
            ll i = lower_bound(v.begin(),v.end(),o[0])-v.begin();
            ll j = lower_bound(v.begin(),v.end(),o[1])-v.begin();
            pair<pos,pos> op = {min(o[0],o[1]),max(o[0],o[1])};
            //cerr << "ops " << op.first << " " << op.second << "\n";
            ops.push_back(op);
            con[i].push_back(j);
            con[j].push_back(i);
        }
        sort(ops.begin(),ops.end());
        vector<ll> um(m,0);
        //shuffle(idl.begin(),idl.end(),mt);
        priority_queue<pr> q;
        for(ll i = 0;i<m;i++) q.push({i,con[i].size()});
        while(!q.empty()){
            auto [i,_] = q.top();q.pop();
            if (um[i]) continue;
            shuffle(con[i].begin(),con[i].end(),mt);
            for(ll j : con[i]){
                pair<pos,pos> op = {min(v[i],v[j]),max(v[i],v[j])};
                //cerr << "test " << op.first << " " << op.second << "\n";
                auto it = lower_bound(ops.begin(),ops.end(),op);
                if (it==ops.end()) {
                    //cerr << "error 1\n";
                    continue;
                }
                //cerr << "got " << (*it).first << " " << (*it).second << "\n";
                if ((*it)!=op) {
                    //cerr << "error 2\n";
                    continue;
                }
                ll idx = it-ops.begin();
                //cerr << "idx= " << idx << "\n";
                if(u[idx]) {
                    //cerr << "error 3\n";
                    continue;
                }
                u[idx] = 1;
                um[i] = 1;
                for(ll z = 0;z<con[j].size();z++) if(con[j][z]==i){
                    con[j].erase(con[j].begin()+z);
                    break;
                }
                q.push({j,con[j].size()});
                pos p = v[i];
                ans_a.push_back(p.x);
                ans_b.push_back(p.y);
                auto os = mids(v[i],v[j]);
                //cerr << "use " << p << " from " << os[0] << " " << os[1] << "\n";
                ll idx1 = (*lower_bound(a.begin(),a.end(),os[0])).i;
                ll idx2 = (*lower_bound(a.begin(),a.end(),os[1])).i;
                ans_u.push_back(idx1);
                ans_v.push_back(idx2);
                break;
            }
        }
        if(ans_u.size()<n-1) continue;
        build(ans_u,ans_v,ans_a,ans_b);
        return 1;
    }
    return 0;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:98:23: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<obj, obj> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'int'} [-Wsign-compare]
   98 |         if(cons.size()<n-1) return 0;
      |            ~~~~~~~~~~~^~~~
parks.cpp:123:52: warning: narrowing conversion of '(& con.std::vector<std::vector<int> >::operator[](((std::vector<std::vector<int> >::size_type)i)))->std::vector<int>::size()' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'll' {aka 'int'} [-Wnarrowing]
  123 |         for(ll i = 0;i<m;i++) q.push({i,con[i].size()});
      |                                         ~~~~~~~~~~~^~
parks.cpp:149:31: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |                 for(ll z = 0;z<con[j].size();z++) if(con[j][z]==i){
      |                              ~^~~~~~~~~~~~~~
parks.cpp:153:38: warning: narrowing conversion of '(& con.std::vector<std::vector<int> >::operator[](((std::vector<std::vector<int> >::size_type)j)))->std::vector<int>::size()' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'll' {aka 'int'} [-Wnarrowing]
  153 |                 q.push({j,con[j].size()});
      |                           ~~~~~~~~~~~^~
parks.cpp:166:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'int'} [-Wsign-compare]
  166 |         if(ans_u.size()<n-1) continue;
      |            ~~~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 149 ms 35064 KB Output is correct
10 Correct 12 ms 3800 KB Output is correct
11 Correct 71 ms 18368 KB Output is correct
12 Correct 20 ms 5332 KB Output is correct
13 Correct 14 ms 6352 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 146 ms 35616 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 149 ms 35064 KB Output is correct
10 Correct 12 ms 3800 KB Output is correct
11 Correct 71 ms 18368 KB Output is correct
12 Correct 20 ms 5332 KB Output is correct
13 Correct 14 ms 6352 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 146 ms 35616 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 314 ms 64140 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 1 ms 1052 KB Output is correct
27 Correct 2 ms 1052 KB Output is correct
28 Correct 118 ms 26028 KB Output is correct
29 Correct 176 ms 37304 KB Output is correct
30 Correct 248 ms 55484 KB Output is correct
31 Correct 304 ms 67716 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 796 KB Output is correct
45 Correct 170 ms 33156 KB Output is correct
46 Correct 232 ms 49552 KB Output is correct
47 Correct 240 ms 51872 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 149 ms 35064 KB Output is correct
10 Correct 12 ms 3800 KB Output is correct
11 Correct 71 ms 18368 KB Output is correct
12 Correct 20 ms 5332 KB Output is correct
13 Correct 14 ms 6352 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 146 ms 35616 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 314 ms 64140 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 1 ms 1052 KB Output is correct
27 Correct 2 ms 1052 KB Output is correct
28 Correct 118 ms 26028 KB Output is correct
29 Correct 176 ms 37304 KB Output is correct
30 Correct 248 ms 55484 KB Output is correct
31 Correct 304 ms 67716 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 796 KB Output is correct
45 Correct 170 ms 33156 KB Output is correct
46 Correct 232 ms 49552 KB Output is correct
47 Correct 240 ms 51872 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Incorrect 2409 ms 71236 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 149 ms 35064 KB Output is correct
10 Correct 12 ms 3800 KB Output is correct
11 Correct 71 ms 18368 KB Output is correct
12 Correct 20 ms 5332 KB Output is correct
13 Correct 14 ms 6352 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 146 ms 35616 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 282 ms 58168 KB Output is correct
21 Correct 299 ms 57004 KB Output is correct
22 Correct 315 ms 60468 KB Output is correct
23 Correct 321 ms 63292 KB Output is correct
24 Correct 66 ms 6696 KB Output is correct
25 Correct 94 ms 28484 KB Output is correct
26 Correct 80 ms 28568 KB Output is correct
27 Correct 397 ms 69632 KB Output is correct
28 Correct 387 ms 70728 KB Output is correct
29 Correct 374 ms 71016 KB Output is correct
30 Correct 371 ms 72508 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 19 ms 4660 KB Output is correct
33 Correct 31 ms 3420 KB Output is correct
34 Correct 306 ms 60912 KB Output is correct
35 Correct 5 ms 1748 KB Output is correct
36 Correct 27 ms 6860 KB Output is correct
37 Correct 43 ms 14532 KB Output is correct
38 Correct 122 ms 26864 KB Output is correct
39 Correct 165 ms 32440 KB Output is correct
40 Correct 232 ms 44724 KB Output is correct
41 Correct 278 ms 53088 KB Output is correct
42 Correct 330 ms 61624 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 2 ms 796 KB Output is correct
56 Correct 146 ms 32792 KB Output is correct
57 Correct 232 ms 48052 KB Output is correct
58 Correct 221 ms 45832 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 385 ms 72248 KB Output is correct
63 Correct 326 ms 70836 KB Output is correct
64 Correct 334 ms 71900 KB Output is correct
65 Correct 2 ms 860 KB Output is correct
66 Correct 3 ms 1372 KB Output is correct
67 Correct 145 ms 30900 KB Output is correct
68 Correct 233 ms 50228 KB Output is correct
69 Correct 346 ms 66740 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 149 ms 35064 KB Output is correct
10 Correct 12 ms 3800 KB Output is correct
11 Correct 71 ms 18368 KB Output is correct
12 Correct 20 ms 5332 KB Output is correct
13 Correct 14 ms 6352 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 146 ms 35616 KB Output is correct
17 Correct 354 ms 71508 KB Output is correct
18 Correct 371 ms 73136 KB Output is correct
19 Correct 297 ms 59992 KB Output is correct
20 Correct 325 ms 63924 KB Output is correct
21 Correct 322 ms 60852 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 48 ms 9416 KB Output is correct
24 Correct 9 ms 3284 KB Output is correct
25 Correct 31 ms 11344 KB Output is correct
26 Correct 54 ms 17860 KB Output is correct
27 Correct 157 ms 31060 KB Output is correct
28 Correct 208 ms 37964 KB Output is correct
29 Correct 237 ms 48048 KB Output is correct
30 Correct 292 ms 58804 KB Output is correct
31 Correct 365 ms 61360 KB Output is correct
32 Correct 349 ms 65748 KB Output is correct
33 Correct 342 ms 71024 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct
35 Correct 4 ms 1748 KB Output is correct
36 Correct 151 ms 31136 KB Output is correct
37 Correct 255 ms 53048 KB Output is correct
38 Correct 352 ms 66704 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 149 ms 35064 KB Output is correct
10 Correct 12 ms 3800 KB Output is correct
11 Correct 71 ms 18368 KB Output is correct
12 Correct 20 ms 5332 KB Output is correct
13 Correct 14 ms 6352 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 146 ms 35616 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 314 ms 64140 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 1 ms 1052 KB Output is correct
27 Correct 2 ms 1052 KB Output is correct
28 Correct 118 ms 26028 KB Output is correct
29 Correct 176 ms 37304 KB Output is correct
30 Correct 248 ms 55484 KB Output is correct
31 Correct 304 ms 67716 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 796 KB Output is correct
45 Correct 170 ms 33156 KB Output is correct
46 Correct 232 ms 49552 KB Output is correct
47 Correct 240 ms 51872 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Incorrect 2409 ms 71236 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -