이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);
const int N=100010;
int n,k,tot;
ii a[N];
main(){
#define task "vim"
//freopen(task".inp","r",stdin);
//freopen(task".out","w",stdout);
cin>>k; int inp; cin>>inp;
forinc(i,1,inp){
char x; int xx; cin>>x>>xx;
char y; int yy; cin>>y>>yy;
if(x==y)
tot+=abs(xx-yy);
else
a[++n]={xx,yy};
}
if(k==1){
vector<int> val;
forinc(i,1,n){
val.push_back(a[i].fi);
val.push_back(a[i].se);
}
sort(all(val));
vector<int> pf(n+n+1);
forinc(i,1,n+n)
pf[i]=pf[i-1] + val[i-1];
int opt=LLONG_MAX;
forinc(i,1,n+n){
opt=min(opt,i*val[i-1] - pf[i] + pf[n+n]-pf[i] - (n+n-i)*val[i-1]);
}
cout<<opt+tot+n<<"\n";
cerr<<opt+tot+n<<"\n";
}
}
컴파일 시 표준 에러 (stderr) 메시지
bridge.cpp:28:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main(){
^
# | 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... |