oj.uz

Submission #970317

# Submission time Handle Problem Language Result Execution time Memory
970317 2024-04-26T10:55:59 Z mychecksedad Fountain Parks (IOI21_parks) C++17
30 / 100
 129 ms 21048 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 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);

    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 M.pb({y[i], i});
    }
    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:52: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]
   52 |     for(int i = 0; i + 1 < L.size(); ++i){
      |                    ~~~~~~^~~~~~~~~~
parks.cpp:57:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |         b.pb(L[i + 1].first + L[i].first>>1);
parks.cpp:60: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]
   60 |     for(int i = 0; i + 1 < R.size(); ++i){
      |                    ~~~~~~^~~~~~~~~~
parks.cpp:65:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |         b.pb(R[i + 1].first + R[i].first>>1);
parks.cpp:68: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]
   68 |     for(int i = 0; i + 1 < M.size(); ++i){
      |                    ~~~~~~^~~~~~~~~~
parks.cpp:73:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |         b.pb(M[i + 1].first + M[i].first>>1);
parks.cpp:78:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(int i = 0; i < M.size(); ++i){
      |                    ~~^~~~~~~~~~
parks.cpp:79:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         while(p < R.size() && R[p].first < M[i].first) ++p;
      |               ~~^~~~~~~~~~
parks.cpp:80:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         if(p < R.size() && R[p].first == M[i].first){
      |            ~~^~~~~~~~~~
parks.cpp:91:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for(int i = 0; i < M.size(); ++i){
      |                    ~~^~~~~~~~~~
parks.cpp:92:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         while(p < L.size() && L[p].first < M[i].first) ++p;
      |               ~~^~~~~~~~~~
parks.cpp:93:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 49 ms 8572 KB Output is correct
10 Correct 4 ms 1288 KB Output is correct
11 Correct 22 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 49 ms 8656 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 49 ms 8572 KB Output is correct
10 Correct 4 ms 1288 KB Output is correct
11 Correct 22 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 49 ms 8656 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 123 ms 18544 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 604 KB Output is correct
28 Correct 44 ms 7892 KB Output is correct
29 Correct 67 ms 11324 KB Output is correct
30 Correct 91 ms 15504 KB Output is correct
31 Correct 129 ms 18880 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 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 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 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 54 ms 8436 KB Output is correct
46 Correct 77 ms 12660 KB Output is correct
47 Correct 87 ms 12608 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 49 ms 8572 KB Output is correct
10 Correct 4 ms 1288 KB Output is correct
11 Correct 22 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 49 ms 8656 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 123 ms 18544 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 604 KB Output is correct
28 Correct 44 ms 7892 KB Output is correct
29 Correct 67 ms 11324 KB Output is correct
30 Correct 91 ms 15504 KB Output is correct
31 Correct 129 ms 18880 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 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 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 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 54 ms 8436 KB Output is correct
46 Correct 77 ms 12660 KB Output is correct
47 Correct 87 ms 12608 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 440 KB Output is correct
50 Correct 1 ms 348 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 348 KB Output is correct
55 Correct 120 ms 20900 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 4 ms 1116 KB Output is correct
59 Correct 3 ms 1368 KB Output is correct
60 Correct 62 ms 11012 KB Output is correct
61 Correct 89 ms 14288 KB Output is correct
62 Correct 97 ms 17468 KB Output is correct
63 Correct 120 ms 21044 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 1 ms 604 KB Output is correct
67 Correct 99 ms 18388 KB Output is correct
68 Correct 100 ms 18172 KB Output is correct
69 Correct 99 ms 18236 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 2 ms 860 KB Output is correct
72 Correct 48 ms 9264 KB Output is correct
73 Correct 87 ms 13596 KB Output is correct
74 Correct 109 ms 18240 KB Output is correct
75 Correct 117 ms 19908 KB Output is correct
76 Correct 100 ms 18236 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 2 ms 1116 KB Output is correct
79 Correct 51 ms 9820 KB Output is correct
80 Correct 80 ms 14396 KB Output is correct
81 Correct 112 ms 18980 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 49 ms 8572 KB Output is correct
10 Correct 4 ms 1288 KB Output is correct
11 Correct 22 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 49 ms 8656 KB Output is correct
17 Incorrect 0 ms 348 KB b[0] = 2 is not an odd integer
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 49 ms 8572 KB Output is correct
10 Correct 4 ms 1288 KB Output is correct
11 Correct 22 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 49 ms 8656 KB Output is correct
17 Incorrect 58 ms 21048 KB Wrong answer detected in grader
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 49 ms 8572 KB Output is correct
10 Correct 4 ms 1288 KB Output is correct
11 Correct 22 ms 4820 KB Output is correct
12 Correct 6 ms 1764 KB Output is correct
13 Correct 8 ms 3024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 49 ms 8656 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 123 ms 18544 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 604 KB Output is correct
28 Correct 44 ms 7892 KB Output is correct
29 Correct 67 ms 11324 KB Output is correct
30 Correct 91 ms 15504 KB Output is correct
31 Correct 129 ms 18880 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 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 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 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 54 ms 8436 KB Output is correct
46 Correct 77 ms 12660 KB Output is correct
47 Correct 87 ms 12608 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 440 KB Output is correct
50 Correct 1 ms 348 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 348 KB Output is correct
55 Correct 120 ms 20900 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 4 ms 1116 KB Output is correct
59 Correct 3 ms 1368 KB Output is correct
60 Correct 62 ms 11012 KB Output is correct
61 Correct 89 ms 14288 KB Output is correct
62 Correct 97 ms 17468 KB Output is correct
63 Correct 120 ms 21044 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 1 ms 604 KB Output is correct
67 Correct 99 ms 18388 KB Output is correct
68 Correct 100 ms 18172 KB Output is correct
69 Correct 99 ms 18236 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 2 ms 860 KB Output is correct
72 Correct 48 ms 9264 KB Output is correct
73 Correct 87 ms 13596 KB Output is correct
74 Correct 109 ms 18240 KB Output is correct
75 Correct 117 ms 19908 KB Output is correct
76 Correct 100 ms 18236 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 2 ms 1116 KB Output is correct
79 Correct 51 ms 9820 KB Output is correct
80 Correct 80 ms 14396 KB Output is correct
81 Correct 112 ms 18980 KB Output is correct
82 Incorrect 0 ms 348 KB b[0] = 2 is not an odd integer
83 Halted 0 ms 0 KB -