Submission #970317

#	Time	Username	Problem	Language	Result	Execution time	Memory
970317		mychecksedad	Fountain Parks (IOI21_parks)	C++17	30 / 100	129 ms	21048 KiB

parks

#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 (stderr)

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 / 5
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30