제출 #850144

#제출 시각아이디문제언어결과실행 시간메모리
850144QweszPalembang Bridges (APIO15_bridge)C++14
0 / 100
1 ms356 KiB
#include <iostream> #include <vector> #include <algorithm> #include <utility> using namespace std; using ll = long long; ll k, n, dis = 0, lef = 0, rig = 0, out = 0; vector<pair<int, int>> vec; int main(){ cin >> k >> n; for(int i = 0; i < n; i++){ char a, b; int x, y; cin >> a >> x >> b >> y; if(a == b) dis += abs(x - y); else{ dis += abs(x - y) + 1; vec.push_back({min(x, y), 0}); vec.push_back({max(x, y), 1}); rig += min(x, y); } } sort(vec.begin(), vec.end()); //cout << dis << " " << rig << endl; out = dis + 2 * rig; for(int i = 0; i < vec.size(); i++){ if(vec[i].second == 0) rig -= vec[i].first; if(vec[i].second == 1) lef += vec[i].first; out = min(out, dis + 2 * abs(rig - lef)); //cout << out << " " << lef << " " << rig << endl; } cout << out << endl; }

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

bridge.cpp: In function 'int main()':
bridge.cpp:27:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i = 0; i < vec.size(); i++){
      |                    ~~^~~~~~~~~~~~
#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...