# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636244 | amirhoseinfar1385 | Subtree (INOI20_subtree) | C++17 | 139 ms | 25164 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;
long long n,m;
vector<vector<long long>>adj;
vector<long long>par;
vector<long long>vaz;
vector<long long>res,resa[2][2],we;
vector<bool>vis;
long long mod=1e9+7;
void solvef(long long u){
if(we[u]!=0){
vaz[u]=1;
}
vis[u]=1;
vector<long long>adja;
for(int i=0;i<adj[u].size();i++){
if(vis[adj[u][i]]==0){
adja.push_back(adj[u][i]);
}
}
adj[u]=adja;
long long counta=0;
adja.clear();
for(int i=0;i<adj[u].size();i++){
counta++;
we[adj[u][i]]++;
}
for(int i=0;i<adj[u].size();i++){
if(vis[adj[u][i]]==0){
we[adj[u][i]]--;
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... |