# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
6070 | ainta | 우호 조약 체결 (JOI14_friends) | C++98 | 172 ms | 17544 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>
#include<vector>
#define N_ 100010
using namespace std;
int n, m, C[N_], par[N_];
long long C2[N_];
vector<int>E[N_], F[N_];
bool v[N_];
int SCC[N_], ord[N_], cnt;
int find(int a)
{
if(a==par[a])return a;
return par[a] = find(par[a]);
}
void DFS(int a)
{
v[a] = true;
int i;
for(i=0;i<E[a].size();i++){
if(!v[E[a][i]]){
DFS(E[a][i]);
}
}
ord[++cnt] = a;
}
void DFS2(int a)
{
int i;
C[cnt]++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |