제출 #450447

#제출 시각아이디문제언어결과실행 시간메모리
450447mjhmjh1104Joker (BOI20_joker)C++17
41 / 100
1393 ms9392 KiB
#include <cstdio> #include <vector> #include <utility> using namespace std; int uf[200006], sz[200006], ds[200006], y[200]; int _find(int x) { if (uf[x] == -1) return x; return _find(uf[x]); } int _dist(int x) { if (uf[x] == -1) return 0; return ds[x] + _dist(uf[x]); } bool _merge(int x, int y) { int a = _dist(x), b = _dist(y); x = _find(x), y = _find(y); if (x != y) { if (sz[x] > sz[y]) { uf[y] = x, sz[x] += sz[y]; if ((a + b) % 2 == 0) ds[y]++; } else { uf[x] = y, sz[y] += sz[x]; if ((a + b) % 2 == 0) ds[x]++; } return true; } return false; } int n, m, q; vector<pair<int, int>> edges; int main() { scanf("%d%d%d", &n, &m, &q); for (int i = 0; i < m; i++) { int u, v; scanf("%d%d", &u, &v); u--, v--; edges.push_back({ u, v }); } for (int c = 0; c < 200; c++) { for (int i = 0; i < n; i++) uf[i] = -1, sz[i] = 1, ds[i] = 0; int x = -1; for (int i = 0; i < c; i++) if (!_merge(edges[i].first, edges[i].second) && (_dist(edges[i].first) + _dist(edges[i].second) + 1) % 2) { x = m; break; } if (x == -1) for (int i = m - 1; i >= c; i--) if (!_merge(edges[i].first, edges[i].second) && (_dist(edges[i].first) + _dist(edges[i].second) + 1) % 2) { x = i; break; } y[c] = x; } for (int i = 0; i < q; i++) { int l, r; scanf("%d%d", &l, &r); l--, r--; if (r < y[l]) puts("YES"); else puts("NO"); } }

컴파일 시 표준 에러 (stderr) 메시지

Joker.cpp: In function 'int main()':
Joker.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     scanf("%d%d%d", &n, &m, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         scanf("%d%d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~
Joker.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         scanf("%d%d", &l, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...