제출 #158692

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
158692	2019-10-18 12:45:03	solarmagic	문명 (KOI17_civilization)	C++17	0 / 100	1087 ms	258488 KiB

civilization

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int N, M;
int p[100001];
int world[2001][2001];
int dx[] = {0,0,-1,1};
int dy[] = {-1,1,0,0};
int find(int u) {
    if (p[u] == u) return u;
    return p[u] = find(p[u]);
}
void merge(int u, int v) {
    u = find(u);
    v = find(v);
    p[u] = v;
}
bool isIn(int x, int y) { return x > 0 && x <= N && y > 0 && y <= N; }
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    queue<pair<int, int>> q;
    cin >> N >> M;
    for (int i = 1; i <= M; i++) {
        int x, y; cin >> x >> y;
        world[x][y] = i;
        q.push({x,y});
        p[i] = i;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 19
• Subtask 2: 0 / 35
• Subtask 3: 0 / 46