이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll
int n, k;
int s[100010], t[100010];
char p[100010], q[100010];
vector<int> pts;
int get_1(){
pts.clear();
int s0=0;
for(int i=1; i<=n; i++){
if(p[i]==q[i]){
s0+=abs(s[i]-t[i]);
}
else{
pts.pb(s[i]);
pts.pb(t[i]);
}
}
sort(pts.begin(), pts.end());
int res=1e18;
int s1=0, s2=0;
int k1=0, k2=0;
for(int x:pts){
s2+=x;
}
k2=pts.size();
for(int i=0; i<((int)pts.size()); i++){
k2--; k1++;
s1+=pts[i], s2-=pts[i];
res=min(res, pts[i]*k1-s1+s2-pts[i]*k2+s0+(((int)pts.size())/2));
/*
if(pts[i]*k1-s1+s2-pts[i]*k2+s0==20){
cout<<(i+1)<<"\n";
}
*/
}
return res;
}
int get_2(){
return 0;
}
int32_t main(){
INIT
cin>>k>>n;
for(int i=1; i<=n; i++){
cin>>p[i]>>s[i]>>q[i]>>t[i];
}
if(k==1){
cout<<get_1()<<"\n";
}
else{
return -1;
}
return 0;
}
# | 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... |