제출 #706548

#제출 시각아이디문제언어결과실행 시간메모리
706548becaidoJail (JOI22_jail)C++17
5 / 100
42 ms1712 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx,popcnt,sse4,abm") #include <bits/stdc++.h> using namespace std; #ifdef WAIMAI #define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE) void dout() {cout << '\n';} template<typename T, typename...U> void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);} #else #define debug(...) 7122 #endif #define ll long long #define Waimai ios::sync_with_stdio(false), cin.tie(0) #define FOR(x,a,b) for (int x = a, I = b; x <= I; x++) #define pb emplace_back #define F first #define S second const int SIZE = 12e4 + 5; int n, m; tuple<int, int, int> p[SIZE]; void solve() { cin >> n; FOR (i, 2, n) { int a, b; cin >> a >> b; } cin >> m; FOR (i, 1, m) { int l, r; cin >> l >> r; p[i] = {min(l, r), max(l, r), l > r}; } sort(p + 1, p + m + 1); int last = 0, t; FOR (i, 1, m) { auto [l, r, ty] = p[i]; if (r <= last) { cout << "No\n"; return; } if (l <= last && ty != t) { cout << "No\n"; return; } last = r; t = ty; } cout << "Yes\n"; } int main() { Waimai; int tt; cin >> tt; while (tt--) solve(); }

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

jail.cpp: In function 'void solve()':
jail.cpp:47:23: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |         if (l <= last && ty != t) {
      |             ~~~~~~~~~~^~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...