제출 #1322446

#제출 시각아이디문제언어결과실행 시간메모리
1322446aaaaaaaaPalembang Bridges (APIO15_bridge)C++20
22 / 100
31 ms3776 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int inf = 1e9; signed main(){ ios::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); int n, m, ans = 0; cin >> n >> m; char s1, s2; int x, y; vector<pair<int, int>> v; vector<int> alx; for(int i = 1; i <= m; ++i){ cin >> s1 >> x >> s2 >> y; if(s1 == s2){ ans += abs(x - y); }else{ v.push_back({min(x, y), max(x, y)}); alx.push_back(x); alx.push_back(y); ++ans; } } sort(alx.begin(), alx.end()); int mid = alx[alx.size() / 2]; for(auto it : alx){ ans += abs(it - mid); } cout << ans << "\n"; return 0; }
#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...