#include "doll.h"
#include <vector>
#define sz(A) int(size(A))
using namespace std;
vector<int> adj[200005];
void create_circuit(int M, vector<int> A) {
for(int i = 0; i < sz(A)-1; i++){
adj[A[i]].push_back(A[i+1]);
}
adj[A[sz(A)-1]].push_back(0);
vector<int> C(M+1);
C[0] = A[0];
vector<int> X,Y;
for(int i = 1; i <= M; i++){
if(sz(adj[i]) == 0) continue;
if(sz(adj[i]) == 1){
C[i] = adj[i][0];
continue;
}
if(sz(adj[i]) == 2){
C[i] = -(sz(X)+1);
X.push_back(adj[i][0]);
Y.push_back(adj[i][1]);
continue;
}
if(sz(adj[i]) == 3){
int fir = -(sz(X)+1),
sec = -(sz(X)+2),
thi = -(sz(X)+3);
C[i] = fir;
X.push_back(sec);
Y.push_back(thi);
X.push_back(adj[i][0]);
Y.push_back(fir);
X.push_back(adj[i][1]);
Y.push_back(adj[i][2]);
continue;
}
if(sz(adj[i]) == 4){
int fir = -(sz(X)+1),
sec = -(sz(X)+2),
thi = -(sz(X)+3);
C[i] = fir;
X.push_back(sec);
Y.push_back(thi);
X.push_back(adj[i][0]);
Y.push_back(adj[i][2]);
X.push_back(adj[i][1]);
Y.push_back(adj[i][3]);
continue;
}
}
answer(C,X,Y);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4940 KB |
Output is correct |
2 |
Correct |
39 ms |
8720 KB |
Output is correct |
3 |
Correct |
37 ms |
8268 KB |
Output is correct |
4 |
Correct |
4 ms |
4940 KB |
Output is correct |
5 |
Correct |
15 ms |
6092 KB |
Output is correct |
6 |
Correct |
59 ms |
9992 KB |
Output is correct |
7 |
Correct |
4 ms |
4940 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4940 KB |
Output is correct |
2 |
Correct |
39 ms |
8720 KB |
Output is correct |
3 |
Correct |
37 ms |
8268 KB |
Output is correct |
4 |
Correct |
4 ms |
4940 KB |
Output is correct |
5 |
Correct |
15 ms |
6092 KB |
Output is correct |
6 |
Correct |
59 ms |
9992 KB |
Output is correct |
7 |
Correct |
4 ms |
4940 KB |
Output is correct |
8 |
Correct |
63 ms |
10348 KB |
Output is correct |
9 |
Correct |
69 ms |
10972 KB |
Output is correct |
10 |
Correct |
90 ms |
13368 KB |
Output is correct |
11 |
Correct |
3 ms |
4940 KB |
Output is correct |
12 |
Correct |
5 ms |
4940 KB |
Output is correct |
13 |
Correct |
5 ms |
4940 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4940 KB |
Output is correct |
2 |
Correct |
39 ms |
8720 KB |
Output is correct |
3 |
Correct |
37 ms |
8268 KB |
Output is correct |
4 |
Correct |
4 ms |
4940 KB |
Output is correct |
5 |
Correct |
15 ms |
6092 KB |
Output is correct |
6 |
Correct |
59 ms |
9992 KB |
Output is correct |
7 |
Correct |
4 ms |
4940 KB |
Output is correct |
8 |
Correct |
63 ms |
10348 KB |
Output is correct |
9 |
Correct |
69 ms |
10972 KB |
Output is correct |
10 |
Correct |
90 ms |
13368 KB |
Output is correct |
11 |
Correct |
3 ms |
4940 KB |
Output is correct |
12 |
Correct |
5 ms |
4940 KB |
Output is correct |
13 |
Correct |
5 ms |
4940 KB |
Output is correct |
14 |
Correct |
109 ms |
14060 KB |
Output is correct |
15 |
Correct |
70 ms |
9704 KB |
Output is correct |
16 |
Correct |
90 ms |
12304 KB |
Output is correct |
17 |
Correct |
4 ms |
4940 KB |
Output is correct |
18 |
Correct |
5 ms |
4940 KB |
Output is correct |
19 |
Correct |
4 ms |
4940 KB |
Output is correct |
20 |
Correct |
105 ms |
13488 KB |
Output is correct |
21 |
Correct |
5 ms |
4940 KB |
Output is correct |
22 |
Correct |
4 ms |
4948 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
4940 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
4940 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
4940 KB |
wrong motion |
2 |
Halted |
0 ms |
0 KB |
- |