# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7697 | baneling100 | Saveit (IOI10_saveit) | C++98 | 368 ms | 11520 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 "grader.h"
#include "encoder.h"
#include <vector>
#include <queue>
using namespace std;
static queue <int> Q;
static vector <int> A[1000];
static int nv, nh, ne, Anc[1000], Check[1000], D[36][1000], Plus, Zero, Minus;
void static MakeAnc(void) {
int i, j, Now;
Q.push(0);
Check[0]=1;
while(!Q.empty()) {
Now=Q.front();
Q.pop();
j=A[Now].size();
for(i=0 ; i<j ; i++)
if(!Check[A[Now][i]]) {
Check[A[Now][i]]=1;
Anc[A[Now][i]]=Now;
Q.push(A[Now][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... |