# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466654 | cgiosy | Palembang Bridges (APIO15_bridge) | C++17 | 2103 ms | 126576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define clear(X) decltype(X)().swap(X);
using namespace std;
using ll=long long;
struct pii {
int l, r;
bool operator<(pii b) const { return l+r<b.l+b.r; }
};
int main() {
ios::sync_with_stdio(0);cin.tie(0);
int K, N, M=0;
cin>>K>>N;
pii A[N];
ll s=0;
for(int i=0; i<N; i++) {
char a, b;
int l, r;
cin>>a>>l>>b>>r;
if(l>r) swap(l, r);
if(a!=b) A[M++]={l, r};
else s+=r-l;
}
N=M;
s+=N;
if(K==1) {
int *B=(int*)&A;
nth_element(B, B+N, B+N*2);
# | 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... |