# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7710 | baneling100 | Race (IOI11_race) | C++98 | 891 ms | 37448 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 "race.h"
#include <algorithm>
#include <vector>
#include <queue>
#define INF 0x7fffffff
using namespace std;
typedef pair <int,int> ppair;
static vector <ppair> A[200000];
static vector <ppair> Length;
static vector <int> Eraser;
static int N, K, Die[200000], Check[200000], D[1000001];
static int Num, Center, Ans=INF;
int HowManyNode(int Now) {
int i, j=A[Now].size(), Temp=1;
Check[Now]=1;
for(i=0 ; i<j ; i++)
if(!Die[A[Now][i].first] && !Check[A[Now][i].first])
Temp+=HowManyNode(A[Now][i].first);
Check[Now]=0;
return Temp;
}
int FindCenter(int Now) {
int i, j=A[Now].size(), OK=1, Sum=1, Temp;
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... |