# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
354302 | CaroLinda | Palembang Bridges (APIO15_bridge) | C++14 | 347 ms | 15316 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 ll long long
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x.size() )
const int MAXN = 1e5+10 ;
using namespace std ;
int N , K ;
long long ans ;
vector<ll> solve(vector< pair<int,int> > v )
{
multiset<int> s[2] ;
ll soma[2] = {0,0} ;
vector<ll> dp( sz(v) , 0 ) ;
s[0].insert( v[0].first ) ; soma[0] = (ll)v[0].first ;
s[1].insert( v[0].second ) ; soma[1] = (ll)v[0].second ;
dp[0] = soma[1] - soma[0] ;
for(int i = 1 ; i < sz(v) ; i++ )
{
for(int e : { v[i].first, v[i].second } )
{
if( e < *s[1].begin() ) s[0].insert(e) , soma[0] += (ll)e ;
else s[1].insert(e) , soma[1] += (ll)e ;
}
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... |