# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
280958 | ChrisT | Palembang Bridges (APIO15_bridge) | C++17 | 697 ms | 20044 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename t>
using pbds = tree<t,null_type,less<t>,rb_tree_tag,tree_order_statistics_node_update>;
#define lc ind<<1
#define rc ind<<1|1
const int MN = 2e5 + 5;
vector<int> xs;
int getx (int x) {return lower_bound(xs.begin(),xs.end(),x) - xs.begin() + 1;}
long long bit[MN];
void update (int i, int v) {
for (;i<MN;i+=i&-i)
bit[i]+=v;
}
long long query (int i) {
long long ret = 0;
for (;i;i^=i&-i)
ret += bit[i];
return ret;
}
int main () {
int k,n; long long add = 0, ans = 8e18;
scanf ("%d %d",&k,&n); vector<pair<int,int>> v = {{-1,-1}};
for (int i = 1; i <= n; i++) {
char c1, c2; int a,b;
scanf (" %c %d %c %d",&c1,&a,&c2,&b);
if (a > b) swap(a,b);
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... |