Submission #318570

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
318570	2020-11-02 10:51:30	ryangohca	Pilot (NOI19_pilot)	C++17	100 / 100	709 ms	61364 KiB

pilot

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>
#define int long long
#define pii pair<int, int>
using namespace std;
vector<pii> heights;
int g[1000005], sz[1000005], ans[1000005];
bool vis[1000005];
int curr = 0;
int find_set(int n){
    if (g[n] == n) return n;
    else return (g[n] = find_set(g[n]));
}
bool is_same_set(int a, int b){
    return find_set(a) == find_set(b);
}
void merge_set(int a, int b){
    int pa = find_set(a), pb = find_set(b);
    curr -= sz[pa] * (sz[pa] + 1) / 2;
    curr -= sz[pb] * (sz[pb] + 1) / 2;
    sz[pb] += sz[pa];
    g[pa] = pb;
    curr += sz[pb] * (sz[pb] + 1) / 2;
}
int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    for (int i = 0; i < 1000005; i++){
        g[i] = i;
        sz[i] = 1;
        ans[i] = -1;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11