Ultraviolet A 1455, a1455

Ultraviolet A 1455, a1455

Link: Ultraviolet A 1455-Kingdom

N more cities on the plane, there was no two-way road connection between the cities at the beginning, and a command was required to be executed once.

• Road a B: connecting A two-way road between City A and City B
• Line C: ask how many states and the total number of cities a horizontal line with y = C passes through.
  If a Unicom component is regarded as a state, C must be a real number of 0.5 in the decimal part.

Solution: The line segment tree maintains the number of upper states and cities in each location, and checks which cities belong to the same State and records the upper and lower states. Each time you create a new road, you must maintain the line segment tree according to the y coordinate ranges of the two States.

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 1e6;const int maxp = 1e5+5;#define lson(x) ((x)<<1)#define rson(x) (((x)<<1)+1)struct Node {    int l, r, nc, nz;    void set (int l, int r, int nc, int nz) {        this->l = l;        this->r = r;        this->nc = nc;        this->nz = nz;    }}node[maxn * 4 + 5];struct Segment {    int l, r;    Segment (int l = 0, int r = 0) {        this->l = l;        this->r = r;    }}s[maxp];void add_node(int u, int vc, int vz) {    /*    if (node[u].l == node[u].r && node[u].l == 1)        printf("solve before:%d %d %d %d!\n", node[u].nc, node[u].nz, vc, vz);        */    node[u].nc += vc;    node[u].nz += vz;}void pushup(int u) {    node[u].set(node[lson(u)].l, node[rson(u)].r, 0, 0);}void pushdown(int u) {    add_node(lson(u), node[u].nc, node[u].nz);    add_node(rson(u), node[u].nc, node[u].nz);    node[u].nc = node[u].nz = 0;}void build_segTree (int u, int l, int r) {    if (l == r) {        node[u].set(l, r, 0, 0);        return;    }    int mid = (l + r) / 2;    build_segTree(lson(u), l, mid);    build_segTree(rson(u), mid + 1, r);    pushup(u);}void insert_segTree (int u, int l, int r, int vc, int vz) {    if (l <= node[u].l && node[u].r <= r) {        add_node(u, vc, vz);        return;    }    pushdown(u);    int mid = (node[u].l + node[u].r) / 2;    if (l <= mid)        insert_segTree(lson(u), l, r, vc, vz);    if (r > mid)        insert_segTree(rson(u), l, r, vc, vz);}Segment query_segTree (int u, int x) {    if (node[u].l == x && node[u].r == x)        return Segment(node[u].nc, node[u].nz);    pushdown(u);    int mid = (node[u].l + node[u].r) / 2;    if (x <= mid)        return query_segTree(lson(u), x);    else        return query_segTree(rson(u), x);}int f[maxp], d[maxp];void init () {    build_segTree (1, 0, maxn);    int n, x, y;    scanf("%d", &n);    for (int i = 0; i < n; i++) {        f[i] = i;        d[i] = 1;        scanf("%d%d", &x, &y);        s[i].l = s[i].r = y;    }}void change (int r, int l, int vc, int vz) {    if (r < l)        return;    insert_segTree (1, l, r, vc, vz);}int getfar (int x) {    return x == f[x] ? x : f[x] = getfar(f[x]);}void link (int u, int v) {    int x = getfar(u);    int y = getfar(v);    if (x == y)        return;    if (s[x].l > s[y].l)        swap(x, y);    //printf("%d %d %d %d!!!\n", s[x].l, s[x].r, s[y].l, s[y].r);    int root = 1048576;    if (s[y].l >= s[x].r) {        change(s[y].l - 1, s[x].r, 0, 1);        change(s[y].r - 1, s[x].r, d[x], 0);    } else if (s[y].r <= s[x].r) {        change(s[y].r - 1, s[y].l, 0, -1);        change(s[x].r - 1, s[y].r, d[y], 0);    } else {        change(s[x].r - 1, s[y].l, 0, -1);        change(s[y].r - 1, s[x].r, d[x], 0);    }    //printf("fuck:%d %d\n", node[root].nc, node[root].nz);    change(s[y].l - 1, s[x].l, d[y], 0);    s[y].l = min(s[x].l, s[y].l);    s[y].r = max(s[x].r, s[y].r);    f[x] = y;    d[y] += d[x];}void solve () {    int n, x, y;    double q;    char order[10];    scanf("%d", &n);    for (int i = 0; i < n; i++) {        scanf("%s", order);        if (strcmp(order, "road") == 0) {            scanf("%d%d", &x, &y);            link(x, y);        } else {            scanf("%lf", &q);            Segment ans = query_segTree(1, (int)q);            printf("%d %d\n", ans.r, ans.l);        }    }}int main () {    int cas;    scanf("%d", &cas);    while (cas--) {        init();        solve();    }    return 0;}

What is the population distribution in Sri Lanka?

Save (????????) /Zone (????????????????????????????) Name: COK population, k㎡, provincial capital, and major urban population: 15th, 361,1853, 684 Colombo Colombo112, 234,289699 Colombo
Mount Lavinia
Moratuwa
Scott Kotte642, 163
209,787
177,190
115,826 Gampaha122, 066,0961, 387 Gampaha
Negombo9, 438
121,933 Kalutara37, 081 Central Province Central22, Hangzhou, 598 Kandy Kandy211, 272,4631, 674 Kandy110, 049 Matale22442, 4271,993 Matale36, 352 Nuwara healthcare, Nuwara healthcare, Nuwara Eliya25, 049 Southern Province Southern32, 277,1455, 0831,741 Galle Galle31990, 444 gallegalle90, 5391,652, 934 Matara32761, 2361,283 Matara42, 756 hybrid, 3702,609 Hambantota11, 213 Northern42, 277,1455, 444 jafna Jaffna Jaffna41490, 6211,025 jafna Jaffna118, 224 Kiri noqi district region, 2631,279 Kilinochchi Mannar43151, 5771,996 Mannar wavuniya district, 8351,967 Vavuniya53, 237 mulla Wu District, 6672,617 Mullathivu Eastern Province Eastern51, Hangzhou, 94910, 472 Batticaloa batticlo district, 4472,854 Batticaloa78, 480 Ampara52589, 3444,415 Ampara17, Ampara17, 965 pavilions in Mali, 1582,727 pavilions in Mali Trincomalee44, 313 northwestern province North region 62, 888, 816 kurungala611, 452,4, kuruningrad kurunega611, Kurunegala kurungala28, 337 putalam district, 3423,072 putalam Puttalam40, 967 North Central71, Beijing, 94910, 472 Anuradhapura arourpur district, 4667,179 Anuradhapura, 632 polonawo district, 1973,293 polonawawo Polonnaruwa Uva81, 170,7288, 500 Badulla Badulla81774, 5552,861 Badulla Badulla40, 920 Monaragala82396, 1735,639 Monaragala sabermuvo ...... remaining full text>