Submission #7107081
Source Code Expand
#include <iostream> #include <cstdlib> #include <vector> #include <stack> #include <string> #include <climits> #include <algorithm> #include <functional> #include <string.h> #include <numeric> #include <math.h> #define LOOP(N) for(int i=0; i<(N); ++i) #define REP(i, N) for(int i=0; i<(N); ++i) #define FOR(i, start, end) for(int i=(start); i<(end); ++i) #define ALL(a) (a).begin(),(a).end() using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using Graph = vector< vector<int> >; void sayYes() {cout << "Yes" << endl;} void sayNo() {cout << "No" << endl;} int getRoot(vector<int> &lines, int v) { int i; for (i=v; lines[i]!=i; i=lines[i]); return i; } int main() { int N, Q; cin >> N >> Q; vector<int> lines(N); REP(i, N) lines[i] = i; int p, a, b; REP(i, Q) { cin >> p >> a >> b; // conbine if (p == 0) { lines[max(a, b)] = min(a, b); } // judge if (p == 1) { lines[a] = getRoot(lines, a); lines[b] = getRoot(lines, b); if (lines[a] == lines[b]) sayYes(); else sayNo(); // cout << lines[a] << " " << lines[b] << endl; } } }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | scientistb |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1308 Byte |
Status | WA |
Exec Time | 468 ms |
Memory | 1280 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_01.txt |
All | 00_sample_01.txt, subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_01_18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
subtask_01_01.txt | AC | 272 ms | 640 KB |
subtask_01_02.txt | AC | 1 ms | 640 KB |
subtask_01_03.txt | AC | 406 ms | 1024 KB |
subtask_01_04.txt | AC | 457 ms | 1280 KB |
subtask_01_05.txt | AC | 24 ms | 256 KB |
subtask_01_06.txt | AC | 26 ms | 640 KB |
subtask_01_07.txt | AC | 434 ms | 768 KB |
subtask_01_08.txt | AC | 463 ms | 1280 KB |
subtask_01_09.txt | AC | 1 ms | 256 KB |
subtask_01_10.txt | AC | 1 ms | 640 KB |
subtask_01_11.txt | AC | 412 ms | 896 KB |
subtask_01_12.txt | AC | 468 ms | 1280 KB |
subtask_01_13.txt | AC | 354 ms | 768 KB |
subtask_01_14.txt | AC | 2 ms | 640 KB |
subtask_01_15.txt | AC | 418 ms | 896 KB |
subtask_01_16.txt | AC | 458 ms | 1280 KB |
subtask_01_17.txt | AC | 312 ms | 896 KB |
subtask_01_18.txt | WA | 365 ms | 896 KB |