이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
using ll = long long;
#define f first
#define s second
vector<int> en, st;
int N, K, MN, MX;
ll sum1[100005], sum2[100005];
set<int> posi;
ll one() {
if(st.empty()) return 0;
for(int i=0;i<en.size();i++) sum1[i+1] = sum1[i]+en[i];
for(int i=st.size()-1;i>=0;i--) sum2[i+1] = sum2[i+2]+st[i];
ll ret = 2e9;
for(int p:posi) {
int bef = lower_bound(en.begin(), en.end(), p)-en.begin()-1;
int aft = upper_bound(st.begin(), st.end(), p)-st.begin();
ret = min(ret, ((ll)(bef+1)*(ll)p)-sum1[bef+1]+sum2[aft+1]-(((ll)st.size()-aft)*(ll)p));
}
return 2*ret;
}
ll two() {
if(st.empty()) return 0;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin>>K>>N;
ll ans = 0;
MN = 2e9, MX = -2e9;
for(int i=0;i<N;i++) {
char z1, z2;
int b1, b2;
cin>>z1>>b1>>z2>>b2;
ans += abs(b1-b2);
if(z1!=z2) {
ans++;
st.push_back(min(b1, b2));
en.push_back(max(b1, b2));
MN = min(MN, min(b1, b2));
MX = max(MX, max(b1, b2));
posi.insert(b1);
posi.insert(b2);
}
}
sort(st.begin(), st.end());
sort(en.begin(), en.end());
if(K==1) cout<<ans+one();
else cout<<ans+two();
}
컴파일 시 표준 에러 (stderr) 메시지
bridge.cpp: In function 'll one()':
bridge.cpp:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
15 | for(int i=0;i<en.size();i++) sum1[i+1] = sum1[i]+en[i];
| ~^~~~~~~~~~
bridge.cpp: In function 'll two()':
bridge.cpp:28:1: warning: control reaches end of non-void function [-Wreturn-type]
28 | }
| ^
# | 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... |