# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463614 | vanic | Mousetrap (CEOI17_mousetrap) | C++14 | 1046 ms | 95684 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 <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn=1e6+5;
vector < int > ms[maxn];
int gore[maxn];
bool bio[maxn];
int dp[maxn];
void dfs(int x, int prosl){
int br=0;
for(int i=0; i<(int)ms[x].size(); i++){
if(bio[ms[x][i]]){
br++;
}
}
dp[x]=ms[x].size()-1-br;
int maksi=0, drugi=0;
for(int i=0; i<(int)ms[x].size(); i++){
if(ms[x][i]!=prosl && !bio[ms[x][i]]){
dfs(ms[x][i], x);
if(dp[ms[x][i]]>maksi){
drugi=maksi;
maksi=dp[ms[x][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... |