# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100175 | TadijaSebez | Palembang Bridges (APIO15_bridge) | C++11 | 475 ms | 14960 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>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
const int N=100050;
const ll inf=9e18;
int l[N],r[N];
ll dp[N][2];
int main()
{
int k,n;
scanf("%i %i",&k,&n);
char a,b;
ll all=0;
vector<int> work;
for(int i=1;i<=n;i++)
{
scanf("\n%c %i %c %i",&a,&l[i],&b,&r[i]);
if(a!=b)
{
if(l[i]>r[i]) swap(l[i],r[i]);
work.pb(i);
}
else all+=abs(l[i]-r[i]);
}
if(work.empty()) return 0*printf("%lld\n",all);
sort(work.begin(),work.end(),[&](int x, int y){ return l[x]+r[x]<l[y]+r[y];});
for(int k=0;k<=1;k++)
{
Compilation message (stderr)
# | 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... |