제출 #828506

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
828506		Magikarp4000	분수 공원 (IOI21_parks)	C++17	15 / 100	293 ms	67424 KiB

parks

#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 2e5+5;
int n;
UM<int,int> col[MAXN];
vector<PII> pts,bch;
vector<pair<PII,int>> rds;
vector<int> v[MAXN];
bool z[MAXN];

void add(int a, int b, int idx) {
    rds.PB({{a,b},idx});
    v[a].PB(b);
    v[b].PB(a);
}

void dfs(int s) {
    if (z[s]) return;
    z[s] = 1;
    FORX(u,v[s]) dfs(u);
}

bool cmp(const PII &a, const PII &b) {
    if (a.S == b.S) return a.F < b.F;
    return a.S < b.S;
}

int construct_roads(std::vector<int> X, std::vector<int> Y) {
    n = X.size();
    FOR(i,0,n) pts.PB({X[i],Y[i]});
    FOR(i,0,n) col[X[i]][Y[i]] = i;
    int idx = 0;
    FOR(i,0,n) {
        int x = pts[i].F, y = pts[i].S;        
        if (col[x].count(y+2)) add(i,col[x][y+2],idx++);
        if (col[x+2].count(y)) add(i,col[x+2][y],idx++);
    }
    dfs(0);
    FOR(i,0,n) if (!z[i]) return 0;
    int m = rds.size();
    bch.resize(m);
    FORX(u,rds) {
        int x1 = pts[u.F.F].F, y1 = pts[u.F.F].S, x2 = pts[u.F.S].F, y2 = pts[u.F.S].S, idx = u.S;
        if (x1 == x2) {
            if (x1 == 2) bch[idx] = {1,(y1+y2)/2};
            else bch[idx] = {5,(y1+y2)/2};
        }
        else {
            bch[idx] = {(x1+x2)/2, y1-1};
        }
    }
    vector<int> ru,rv,ra,rb;
    FORX(u,rds) ru.PB(u.F.F), rv.PB(u.F.S);
    FORX(u,bch) ra.PB(u.F), rb.PB(u.S);
    build(ru,rv,ra,rb);
    return 1;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30