제출 #241331

#제출 시각아이디문제언어결과실행 시간메모리
241331luciocfMostovi (COI14_mostovi)C++14
10 / 100
255 ms11512 KiB
#include <bits/stdc++.h> #define ff first #define ss second using namespace std; typedef pair<int, int> pii; set<int> st_up, st_down; set<pii> bridge_up, bridge_down; // u < v bool reach_up(int u, int v) { auto it = st_up.lower_bound(u); return (it == st_up.end() || *it >= v); } // u > v bool reach_down(int u, int v) { auto it = st_down.upper_bound(u); if (it == st_down.begin()) return true; --it; return (*it <= v); } bool reach_updown(int u, int v) { auto it = bridge_up.lower_bound({u, -1}); if (it == bridge_up.end()) return false; if (!reach_up(u, it->ff) || (it->ss > v && !reach_down(it->ss, v))) return false; if (it->ss >= v) return true; auto it2 = bridge_down.lower_bound({v, -1}); if (it2 == bridge_down.end() || !reach_down(it2->ff, v)) return false; return (it2->ss >= u && reach_up(u, it2->ss)); } bool reach_downup(int u, int v) { auto it = bridge_down.upper_bound({u, 2e9+10}); if (it == bridge_down.begin()) return false; --it; if (!reach_down(u, it->ff) || (it->ss < v && !reach_up(it->ss, v))) return false; if (it->ss <= v) return true; auto it2 = bridge_up.upper_bound({v, 2e9+10}); if (it2 == bridge_up.begin()) return false; --it2; if (!reach_up(it2->ff, v)) return false; return (it2->ss <= u && reach_down(u, it2->ss)); } int main(void) { int n, m; scanf("%d %d", &n, &m); while (m--) { char op; int u, v; scanf(" %c %d %d", &op, &u, &v); if (op == 'A') { if (u > v) swap(u, v); assert(u <= n && v > n); bridge_up.insert({u, v}); bridge_down.insert({v, u}); } else if (op == 'B') { if (u > v) swap(u, v); if (u <= n) st_up.insert({u, v}); else st_down.insert({v, u}); } else { bool ok; if (u <= n && v <= n) { if (u <= v) ok = reach_up(u, v); else { auto it = bridge_up.lower_bound({u, -1}); if (it == bridge_up.end() || !reach_up(u, it->ff)) ok = false; else ok = reach_downup(it->ss, v); } } else if (u > n && v > n) { if (u >= v) ok = reach_down(u, v); else { auto it = bridge_down.upper_bound({u, 2e9+10}); if (it == bridge_down.begin()) ok = false; else { --it; if (!reach_down(u, it->ff)) ok = false; else ok = reach_updown(it->ss, v); } } } else { if (u < v) ok = reach_updown(u, v); else ok = reach_downup(u, v); } if (ok) printf("DA\n"); else printf("NE\n"); } } }

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

mostovi.cpp: In function 'int main()':
mostovi.cpp:73:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
mostovi.cpp:79:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c %d %d", &op, &u, &v);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...