# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146629 | Bodo171 | Bridges (APIO19_bridges) | C++14 | 3021 ms | 26352 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 <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <map>
#include <cassert>
using namespace std;
const int nmax=100005;
const int buck=250;
struct event
{
int tip,id,c;
}ev,evs[2*nmax+2*buck],niu[2*nmax+2*buck];
bool comp(event unu,event doi)
{
if(unu.c==doi.c) return unu.tip>doi.tip;
return unu.c<doi.c;
}
vector<int> spec,norm,mods;
vector<int> ad[nmax];
map<int,int> act;
int tt[nmax],rg[nmax],mic[nmax],mare[nmax],a[nmax],b[nmax],w[nmax],tip[nmax],wh[nmax],cost[nmax],ap[nmax],ans[nmax],ini[nmax],viz[nmax],ps[2*nmax];
int nxt[2*nmax],ce[2*nmax],cap[2*nmax];
int ops,n,m,q,i,nr,j,sum,lim,tot;
int finds(int x)
{
int y=x,aux;
while(x!=tt[x])
x=tt[x];
while(y!=x)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |