Submission #1755035
Source Code Expand
#include <cstdio> #include <cstring> #include <string> #include <cmath> #include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <vector> using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int, int> PII; typedef vector<int> VI; #define fi first #define se second #define MP make_pair int read() { int v = 0, f = 1; char c = getchar(); while (c < 48 || 57 < c) {if (c == '-') f = -1; c = getchar();} while (48 <= c && c <= 57) v = (v << 3) + v + v + c - 48, c = getchar(); return v * f; } const int N = 1e5 + 10; struct Edge { int nxt, to; } eg[N << 1]; int head[N], en, n, vis[N]; set<int> E[N]; queue<PII> Q; map<PII, int> mp; void setEdge(int u, int v) { eg[++en] = (Edge) {head[u], v}; head[u] = en; } void modify(int u, int v, int p) { if (u > v) swap(u, v); mp[MP(u, v)] += p; } int query(int u, int v) { if (u > v) swap(u, v); return mp[MP(u, v)]; } int main() { n = read(); for (int i = 1; i < n; i++) { int u = read(), v = read(); if (u > v) swap(u, v); mp[MP(u, v)]++; E[u].insert(v); E[v].insert(u); } for (int i = 1; i < n; i++) { int u = read(), v = read(); if (u > v) swap(u, v); modify(u, v, 1); E[u].insert(v); E[v].insert(u); } for (map<PII, int> :: iterator i = mp.begin(); i != mp.end(); i++) if ((*i).se == 2) Q.push((*i).fi); int cnt = 0; while (!Q.empty()) { PII t = Q.front(); cnt++; Q.pop(); int u = t.fi, v = t.se; if (vis[u] || vis[v]) continue; vis[v] = 1; if (E[u].size() < E[v].size()) swap(u, v); E[u].erase(v); modify(u, v, -2); for (set<int> :: iterator i = E[v].begin(); i != E[v].end(); i++) { int p = *i; if (p == u) continue; E[p].erase(v); modify(p, u, query(p, v)); if (query(p, u) == 2) Q.push(MP(p, u)); modify(p, v, -query(p, v)); E[p].insert(u); E[u].insert(p); } } if (cnt == n - 1) puts("YES"); else puts("NO"); }
Submission Info
Submission Time | |
---|---|
Task | E - Blue and Red Tree |
User | Misaka10032 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2368 Byte |
Status | WA |
Exec Time | 489 ms |
Memory | 37760 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1400 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 4 ms | 6400 KB |
in10.txt | AC | 368 ms | 37632 KB |
in11.txt | WA | 463 ms | 34304 KB |
in12.txt | WA | 471 ms | 34432 KB |
in13.txt | WA | 460 ms | 34432 KB |
in14.txt | WA | 460 ms | 34432 KB |
in15.txt | WA | 466 ms | 34432 KB |
in16.txt | WA | 486 ms | 34304 KB |
in17.txt | WA | 456 ms | 34304 KB |
in18.txt | WA | 459 ms | 34432 KB |
in19.txt | WA | 429 ms | 34304 KB |
in2.txt | AC | 4 ms | 6400 KB |
in20.txt | WA | 416 ms | 34304 KB |
in21.txt | AC | 445 ms | 34688 KB |
in22.txt | AC | 477 ms | 34688 KB |
in23.txt | AC | 461 ms | 34688 KB |
in24.txt | AC | 432 ms | 34688 KB |
in25.txt | AC | 483 ms | 34816 KB |
in26.txt | AC | 467 ms | 34432 KB |
in27.txt | WA | 466 ms | 34432 KB |
in28.txt | WA | 471 ms | 34432 KB |
in29.txt | WA | 489 ms | 34432 KB |
in3.txt | AC | 4 ms | 6400 KB |
in30.txt | WA | 430 ms | 36480 KB |
in31.txt | WA | 308 ms | 37632 KB |
in32.txt | WA | 361 ms | 37632 KB |
in33.txt | WA | 345 ms | 37632 KB |
in34.txt | WA | 329 ms | 37632 KB |
in35.txt | WA | 389 ms | 37632 KB |
in36.txt | WA | 339 ms | 37632 KB |
in37.txt | WA | 337 ms | 37632 KB |
in38.txt | WA | 366 ms | 37632 KB |
in39.txt | WA | 332 ms | 37632 KB |
in4.txt | AC | 344 ms | 37632 KB |
in40.txt | WA | 345 ms | 37760 KB |
in41.txt | AC | 371 ms | 37632 KB |
in42.txt | AC | 340 ms | 37632 KB |
in43.txt | AC | 344 ms | 37632 KB |
in44.txt | AC | 324 ms | 37632 KB |
in45.txt | AC | 394 ms | 37632 KB |
in46.txt | AC | 357 ms | 37632 KB |
in47.txt | AC | 367 ms | 37632 KB |
in5.txt | AC | 374 ms | 37632 KB |
in6.txt | AC | 348 ms | 37632 KB |
in7.txt | AC | 375 ms | 37632 KB |
in8.txt | AC | 377 ms | 37632 KB |
in9.txt | AC | 379 ms | 37632 KB |
sample1.txt | AC | 4 ms | 6400 KB |
sample2.txt | WA | 4 ms | 6400 KB |
sample3.txt | AC | 4 ms | 6400 KB |