# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1667 | ainta | Synchronization (JOI13_synchronization) | C++98 | 4494 ms | 16032 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<stdio.h>
#include<algorithm>
using namespace std;
int N,M,QQ,P[200001],c,S[100001],Count[200001],T[1001],E2[200001][2],Q[200001];
int s[200001],l[200001],num[200001],End[200001],Save[100001],ord[200001];
struct stack{
int a,b;
}st[200001];
struct Edge{
int x,y,z;
bool operator <(const Edge &p)const{
return x!=p.x?x<p.x:y<p.y;
}
}E[400001];
bool connect[100001],v[200001];
void DFS()
{
int i,top=0,C=0;
st[++top].a=1,st[top].b=s[1],num[1]=++C;
v[1]=true;
while(1){
while(top){
while(st[top].b!=l[st[top].a]&&v[E[st[top].b].y])st[top].b++;
if(st[top].b!=l[st[top].a])break;
End[st[top].a]=C;
top--;
# | 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... |