# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229650 | nvmdava | Palembang Bridges (APIO15_bridge) | C++17 | 309 ms | 14504 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 ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define N 100005
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
vector<pair<int, int> > v;
ll tmp;
multiset<int>::iterator it;
multiset<int> in;
ll sum, all;
ll pr[N], su[N];
int n;
void wtf(ll* ans){
all = sum = 0;
in.clear();
in.insert(-1);
it = in.begin();
int i = 1;
for(auto& x : v){
all += x.ff;
in.insert(x.ff);
in.insert(x.ss);
# | 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... |