#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
const int MAX = 1e5+10;
vector<int> g[MAX], ans, ansx, ansy;
int out[MAX], x[MAX], y[MAX];
int qtdS, n;
int New()
{
int ret = -(++qtdS);
return ret;
}
void Build(int v,vector<int> ord)
{
int k = - v - 1;
int grau = ord.size();
if( grau == 2 )
{
x[k] = ord[0];
y[k] = ord[1];
return;
}
vector<int> first, second;
if(grau % 2)
{
first.push_back( v ), second.push_back(ord[0]);
for(int i=1;i<grau;i++)
{
int prox = ord[i];
if(i%2) first.push_back(prox);
else second.push_back(prox);
}
}
else
{
for(int i=0;i<grau;i++)
{
int prox = ord[i];
if(i%2) second.push_back(prox);
else first.push_back(prox);
}
}
int n1 = New(), n2 = New();
x[k] = n1; y[k] = n2;
Build(n1,first); Build(n2,second);
return;
}
void SetSwitch(int v)
{
int grau = g[v].size();
if(grau == 0){ out[v] = 0; return; }
if(grau == 1){ out[v] = g[v][0]; return; }
out[v] = New() ;
Build( out[v], g[v] );
return;
}
void create_circuit(int M, vector<int> A)
{
n = A.size();
g[0].push_back(A[0]);
for(int i=0;i<n-1;i++)
{
g[A[i]].push_back(A[i+1]);
}
g[A[n-1]].push_back(0);
for(int i=0;i<=M;i++)
{
SetSwitch( i );
}
for(int i=0;i<=M;i++) ans.push_back(out[i]);
for(int i=0;i<qtdS;i++) ansx.push_back(x[i]), ansy.push_back(y[i]);
answer(ans,ansx,ansy);
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2636 KB |
Output is correct |
2 |
Correct |
40 ms |
6852 KB |
Output is correct |
3 |
Correct |
31 ms |
6296 KB |
Output is correct |
4 |
Correct |
2 ms |
2576 KB |
Output is correct |
5 |
Correct |
14 ms |
4292 KB |
Output is correct |
6 |
Correct |
54 ms |
8132 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2636 KB |
Output is correct |
2 |
Correct |
40 ms |
6852 KB |
Output is correct |
3 |
Correct |
31 ms |
6296 KB |
Output is correct |
4 |
Correct |
2 ms |
2576 KB |
Output is correct |
5 |
Correct |
14 ms |
4292 KB |
Output is correct |
6 |
Correct |
54 ms |
8132 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
60 ms |
9584 KB |
Output is correct |
9 |
Correct |
77 ms |
9440 KB |
Output is correct |
10 |
Correct |
135 ms |
12356 KB |
Output is correct |
11 |
Correct |
2 ms |
2636 KB |
Output is correct |
12 |
Correct |
3 ms |
2636 KB |
Output is correct |
13 |
Correct |
3 ms |
2636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2636 KB |
Output is correct |
2 |
Correct |
40 ms |
6852 KB |
Output is correct |
3 |
Correct |
31 ms |
6296 KB |
Output is correct |
4 |
Correct |
2 ms |
2576 KB |
Output is correct |
5 |
Correct |
14 ms |
4292 KB |
Output is correct |
6 |
Correct |
54 ms |
8132 KB |
Output is correct |
7 |
Correct |
3 ms |
2636 KB |
Output is correct |
8 |
Correct |
60 ms |
9584 KB |
Output is correct |
9 |
Correct |
77 ms |
9440 KB |
Output is correct |
10 |
Correct |
135 ms |
12356 KB |
Output is correct |
11 |
Correct |
2 ms |
2636 KB |
Output is correct |
12 |
Correct |
3 ms |
2636 KB |
Output is correct |
13 |
Correct |
3 ms |
2636 KB |
Output is correct |
14 |
Incorrect |
124 ms |
14528 KB |
wrong motion |
15 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
2636 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
3 ms |
2640 KB |
Output is partially correct |
2 |
Incorrect |
98 ms |
9384 KB |
wrong motion |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
3 ms |
2640 KB |
Output is partially correct |
2 |
Incorrect |
98 ms |
9384 KB |
wrong motion |
3 |
Halted |
0 ms |
0 KB |
- |