oj.uz

Submission #970323

# Submission time Handle Problem Language Result Execution time Memory
970323 2024-04-26T11:07:34 Z mychecksedad Fountain Parks (IOI21_parks) C++17
30 / 100
 1041 ms 74404 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n';
#define ll long long int
const int N = 3e5+10;

struct Dsu{
    vector<int> s, p;
    Dsu(int n){
        s.resize(n, 1);
        p.resize(n);
        for(int i = 0; i < n; ++i) p[i] = i;
    }
    int find(int v){
        if(p[v] == v) return v;
        return p[v] = find(p[v]);
    }
    void merge(int a, int b){
        a = find(a);
        b = find(b);
        if(a != b){
            if(s[a] > s[b]) swap(a, b);
            p[a] = b;
            s[b] += s[a];
        }
    }
};
int A[4][2] = {{2, 0}, {0, 2}, {-2, 0}, {0, -2}};
        

int construct_roads(std::vector<int> x, std::vector<int> y) {
    if (x.size() == 1) {
    build({}, {}, {}, {});
        return 1;
    }
    int n = x.size();
    vector<int> u, v, a, b;

    Dsu d(n);
    bool other = 0;
    vector<pair<int, int>> L, R, M;
    for(int i = 0; i < n; ++i){
        if(x[i] == 2) L.pb({y[i], i}); 
        else if(x[i] == 6) R.pb({y[i], i});
        else if(x[i] == 4) M.pb({y[i], i});
        else{
            other = 1;
        }
    }
    if(other){
        map<pair<int, int>, int> m;
        map<pair<int, int>, bool> used;
        for(int i = 0; i < n; ++i) m[{x[i], y[i]}] = i + 1;
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < 4; ++j){
                int nx = A[j][0] + x[i], ny = A[j][1] + y[i];
                int val = m[{nx, ny}];
                if(val != 0){
                    d.merge(val - 1, i);
                    u.pb(i);
                    v.pb(val - 1);
                    int fx = A[j][0] == 0 ? x[i] + 1 : x[i] + A[j][0] / 2;
                    int fy = A[j][1] == 0 ? y[i] + 1 : y[i] + A[j][1] / 2;
                    if(used[{fx, fy}]){
                        if(A[j][0] == 0) fx = x[i] - 1;
                        else fy = y[i] - 1;
                    }
                    a.pb(fx);
                    b.pb(fy);
                    used[{fx, fy}] = 1;
                }
            }
        }
    }else{
        sort(all(L));
        sort(all(R));
        sort(all(M));
        for(int i = 0; i + 1 < L.size(); ++i){
            if(L[i].first < L[i + 1].first - 2) continue;
            u.pb(L[i].second);
            v.pb(L[i + 1].second);
            a.pb(1);
            b.pb(L[i + 1].first + L[i].first>>1);
            d.merge(L[i].second, L[i + 1].second);
        }
        for(int i = 0; i + 1 < R.size(); ++i){
            if(R[i].first < R[i + 1].first - 2) continue;
            u.pb(R[i].second);
            v.pb(R[i + 1].second);
            a.pb(7);
            b.pb(R[i + 1].first + R[i].first>>1);
            d.merge(R[i].second, R[i + 1].second);
        }
        for(int i = 0; i + 1 < M.size(); ++i){
            if(M[i].first < M[i + 1].first - 2) continue;
            u.pb(M[i].second);
            v.pb(M[i + 1].second);
            a.pb((M[i].first/2)%2 == 0 ? 5 : 3);
            b.pb(M[i + 1].first + M[i].first>>1);
            d.merge(M[i].second, M[i + 1].second);
        }

        int p = 0, last = -5;
        for(int i = 0; i < M.size(); ++i){
            while(p < R.size() && R[p].first < M[i].first) ++p;
            if(p < R.size() && R[p].first == M[i].first){
                if(last + 2 == M[i].first) continue;
                last = M[i].first;
                u.pb(R[p].second);
                v.pb(M[i].second);
                a.pb(5);
                b.pb(M[i].first + ((M[i].first/2) % 2 == 0 ? -1 : 1));
                d.merge(R[p].second, M[i].second);
            }
        }
        p = 0, last = -5;
        for(int i = 0; i < M.size(); ++i){
            while(p < L.size() && L[p].first < M[i].first) ++p;
            if(p < L.size() && L[p].first == M[i].first){
                if(last + 2 == M[i].first) continue;
                last = M[i].first;
                u.pb(L[p].second);
                v.pb(M[i].second);
                a.pb(3);
                b.pb(M[i].first + ((M[i].first/2) % 2 == 0 ? 1 : -1));
                d.merge(L[p].second, M[i].second);
            }
        }
    }

    if(d.s[d.find(0)] < n) return 0;
    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:81:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for(int i = 0; i + 1 < L.size(); ++i){
      |                        ~~~~~~^~~~~~~~~~
parks.cpp:86:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   86 |             b.pb(L[i + 1].first + L[i].first>>1);
parks.cpp:89:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(int i = 0; i + 1 < R.size(); ++i){
      |                        ~~~~~~^~~~~~~~~~
parks.cpp:94:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   94 |             b.pb(R[i + 1].first + R[i].first>>1);
parks.cpp:97:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         for(int i = 0; i + 1 < M.size(); ++i){
      |                        ~~~~~~^~~~~~~~~~
parks.cpp:102:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  102 |             b.pb(M[i + 1].first + M[i].first>>1);
parks.cpp:107:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |         for(int i = 0; i < M.size(); ++i){
      |                        ~~^~~~~~~~~~
parks.cpp:108:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |             while(p < R.size() && R[p].first < M[i].first) ++p;
      |                   ~~^~~~~~~~~~
parks.cpp:109:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |             if(p < R.size() && R[p].first == M[i].first){
      |                ~~^~~~~~~~~~
parks.cpp:120:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |         for(int i = 0; i < M.size(); ++i){
      |                        ~~^~~~~~~~~~
parks.cpp:121:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |             while(p < L.size() && L[p].first < M[i].first) ++p;
      |                   ~~^~~~~~~~~~
parks.cpp:122:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |             if(p < L.size() && L[p].first == M[i].first){
      |                ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 1 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 1 ms 388 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 47 ms 8520 KB Output is correct
10 Correct 4 ms 1292 KB Output is correct
11 Correct 24 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3028 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 47 ms 8512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 1 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 1 ms 388 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 47 ms 8520 KB Output is correct
10 Correct 4 ms 1292 KB Output is correct
11 Correct 24 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3028 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 47 ms 8512 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 113 ms 18664 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 544 KB Output is correct
28 Correct 43 ms 7832 KB Output is correct
29 Correct 65 ms 11328 KB Output is correct
30 Correct 108 ms 15448 KB Output is correct
31 Correct 110 ms 18500 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 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 600 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 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 48 ms 8444 KB Output is correct
46 Correct 73 ms 12764 KB Output is correct
47 Correct 71 ms 12608 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory 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 1 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 1 ms 388 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 47 ms 8520 KB Output is correct
10 Correct 4 ms 1292 KB Output is correct
11 Correct 24 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3028 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 47 ms 8512 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 113 ms 18664 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 544 KB Output is correct
28 Correct 43 ms 7832 KB Output is correct
29 Correct 65 ms 11328 KB Output is correct
30 Correct 108 ms 15448 KB Output is correct
31 Correct 110 ms 18500 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 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 600 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 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 48 ms 8444 KB Output is correct
46 Correct 73 ms 12764 KB Output is correct
47 Correct 71 ms 12608 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 800 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 360 KB Output is correct
55 Correct 117 ms 21280 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 3 ms 1116 KB Output is correct
59 Correct 2 ms 860 KB Output is correct
60 Correct 56 ms 9984 KB Output is correct
61 Correct 76 ms 13244 KB Output is correct
62 Correct 101 ms 15868 KB Output is correct
63 Correct 116 ms 19252 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 98 ms 16704 KB Output is correct
68 Correct 97 ms 16636 KB Output is correct
69 Correct 96 ms 16444 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 2 ms 860 KB Output is correct
72 Correct 47 ms 8448 KB Output is correct
73 Correct 75 ms 12728 KB Output is correct
74 Correct 98 ms 16696 KB Output is correct
75 Correct 113 ms 18284 KB Output is correct
76 Correct 96 ms 16704 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 2 ms 1024 KB Output is correct
79 Correct 49 ms 8972 KB Output is correct
80 Correct 77 ms 12864 KB Output is correct
81 Correct 108 ms 17508 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory 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 1 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 1 ms 388 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 47 ms 8520 KB Output is correct
10 Correct 4 ms 1292 KB Output is correct
11 Correct 24 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3028 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 47 ms 8512 KB Output is correct
17 Incorrect 0 ms 348 KB Edge between 1 and 0 appears more than once: appeared on positions 0 and 2
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory 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 1 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 1 ms 388 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 47 ms 8520 KB Output is correct
10 Correct 4 ms 1292 KB Output is correct
11 Correct 24 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3028 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 47 ms 8512 KB Output is correct
17 Incorrect 1041 ms 74404 KB Edge between 171 and 12 appears more than once: appeared on positions 24 and 343
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory 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 1 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 1 ms 388 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 47 ms 8520 KB Output is correct
10 Correct 4 ms 1292 KB Output is correct
11 Correct 24 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3028 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 47 ms 8512 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 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 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 113 ms 18664 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 544 KB Output is correct
28 Correct 43 ms 7832 KB Output is correct
29 Correct 65 ms 11328 KB Output is correct
30 Correct 108 ms 15448 KB Output is correct
31 Correct 110 ms 18500 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 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 600 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 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 48 ms 8444 KB Output is correct
46 Correct 73 ms 12764 KB Output is correct
47 Correct 71 ms 12608 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 800 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 360 KB Output is correct
55 Correct 117 ms 21280 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 3 ms 1116 KB Output is correct
59 Correct 2 ms 860 KB Output is correct
60 Correct 56 ms 9984 KB Output is correct
61 Correct 76 ms 13244 KB Output is correct
62 Correct 101 ms 15868 KB Output is correct
63 Correct 116 ms 19252 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 98 ms 16704 KB Output is correct
68 Correct 97 ms 16636 KB Output is correct
69 Correct 96 ms 16444 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 2 ms 860 KB Output is correct
72 Correct 47 ms 8448 KB Output is correct
73 Correct 75 ms 12728 KB Output is correct
74 Correct 98 ms 16696 KB Output is correct
75 Correct 113 ms 18284 KB Output is correct
76 Correct 96 ms 16704 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 2 ms 1024 KB Output is correct
79 Correct 49 ms 8972 KB Output is correct
80 Correct 77 ms 12864 KB Output is correct
81 Correct 108 ms 17508 KB Output is correct
82 Incorrect 0 ms 348 KB Edge between 1 and 0 appears more than once: appeared on positions 0 and 2
83 Halted 0 ms 0 KB -