이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> ii;
int main()
{
//freopen("i.txt","r",stdin);
int k, n;
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> k >> n;
vector<ii> points;
vector<ii> pairs;
long long forcedDist = 0ll;
for(int i = 0;i < n;i++){
char a, c;
long long b, d;
cin >> a >> b >> c >> d;
if(a == c){
forcedDist += abs(d-b);
}
else{
forcedDist += abs(d-b);
forcedDist++;
if(b > d) swap(b,d);
points.push_back(ii(b,i));
points.push_back(ii(d,i));
pairs.push_back(ii(b,d));
}
}
n = points.size();
sort(points.begin(),points.end());
for(int i = 0;i < n/2;i++){
//cout << pairs[i].first << " " << pairs[i].second << "\n";
}
long long a = 0;
long long b = 1;
long long minVal = 102345678901234567;
for(a = 0;a < n;a++){
for(b = 0;b < n;b++){
long long x = points[a].first;
long long y = points[b].first;
long long val = 0ll;
for(int j = 0;j < pairs.size();j++){
long long p = pairs[j].first;
long long q = pairs[j].second;
if((x <= q)&&(p <= x) || (y <= q)&&(p <= y)) continue;
val += min(min(abs(p-x),abs(p-y)),min(abs(q-x),abs(q-y)));
}
minVal = min(minVal,val);
}
}
if(minVal == 102345678901234567) minVal = 0;
cout << 2ll * minVal + forcedDist;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
bridge.cpp: In function 'int main()':
bridge.cpp:52:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0;j < pairs.size();j++){
~~^~~~~~~~~~~~~~
bridge.cpp:55:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
if((x <= q)&&(p <= x) || (y <= q)&&(p <= y)) continue;
~~~~~~~~^~~~~~~~~~| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |