제출 #213164

#제출 시각아이디문제언어결과실행 시간메모리
213164SorahISAPalembang Bridges (APIO15_bridge)C++17
0 / 100
5 ms512 KiB
// #pragma GCC target("avx2") #pragma GCC optimize("O3", "unroll-loops") // #include <bits/extc++.h> // using namespace __gnu_pbds; #include <bits/stdc++.h> using namespace std; #define int long long #define double long double // template <typename T> // using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; using pii = pair<int, int>; template<typename T> using prior = priority_queue<T, vector<T>, greater<T>>; template<typename T> using Prior = priority_queue<T>; #define X first #define Y second #define ALL(x) (x).begin(), (x).end() #define eb emplace_back #define pb push_back #define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) #define RANDOM() random_device __rd; \ mt19937 __gen = mt19937(__rd()); \ uniform_int_distribution<int> __dis(0, 1); \ auto rnd = bind(__dis, __gen); const int INF = 1E18; const int mod = 1E9 + 7; struct Citizen { char p, q; int s, t; void Read() { cin >> p >> s >> q >> t; } }; int32_t main() { fastIO(); int k, n, ans = 0; cin >> k >> n; vector<Citizen> v; for (int i = 0; i < n; ++i) { Citizen tmp; tmp.Read(); if (tmp.s > tmp.t) swap(tmp.s, tmp.t); ans += tmp.t - tmp.s; if (tmp.p != tmp.q) ++ans, v.eb(tmp); } n = v.size(); if (k == 1) { vector<int> p; for (int i = 0; i < n; ++i) p.eb(v[i].s), p.eb(v[i].t); sort(ALL(p)); int midP = p[n]; for (int i = 0; i < n; ++i) { if (midP < v[i].s) ans += 2 * (v[i].s - midP); if (v[i].t < midP) ans += 2 * (midP - v[i].t); } cout << ans << "\n"; return 0; } return 0; }

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

bridge.cpp: In function 'int32_t main()':
bridge.cpp:61:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
         for (int i = 0; i < n; ++i) p.eb(v[i].s), p.eb(v[i].t); sort(ALL(p));
         ^~~
bridge.cpp:61:65: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
         for (int i = 0; i < n; ++i) p.eb(v[i].s), p.eb(v[i].t); sort(ALL(p));
                                                                 ^~~~
#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...