Submission #800802

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
800802	2023-08-01T21:16:48 Z	biank	Mechanical Doll (IOI18_doll)	C++14	16 / 100	111 ms	15064 KB

doll

#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

#define SIZE(x) (int)x.size()

void create_circuit(int M, vector<int> A) {
	
	int N = SIZE(A);
	vector <int> C(M+1);
	vector <int> X, Y;
	if (M == 1) {
		X.resize(N-1);
		Y.resize(N-1);
		
  C[0] = 1;
  if (N == 1) {
	  C[1] = 0;
	  answer(C,X,Y);
	  return;
	}
	
	if (N == 2) {
		C[1] = -1;
		X[0] = 1;
		Y[0] = 0;
		answer(C,X,Y);
		return;
	}
	
	C[1] = -1;
	X[0] = 1;
	Y[0] = -2;
	
	
	for (int i=1; i<N-2; i++) {
		X[i] = -i;
		Y[i] = -i-2;
		//cerr << X[i] << ' ' << Y[i] << endl;
	}
	
	X[N-2] = -N+2;
	Y[N-2] = 0;
	} else {
	A.push_back(0);
	map <int, vector <int>> next;
	for (int i=0; i<N; i++) {
		next[A[i]].push_back(A[i+1]);
		//Scerr << A[i] << ' ' << A[i+1] << endl;
	}
	
	C[0] = A[0];
	int j = 0;
	for (auto &x:next) {
		int a = x.first;
		vector <int> n = x.second;
		int S = SIZE(n);
		if (S == 1) {
			C[a] = n[0];
			continue;
		}
		if (S == 2) {
			C[a] = --j;
			X.push_back(n[0]);
			Y.push_back(n[1]);
			continue;
		}
		if (S == 4) {
			C[a] = --j;
			X.push_back(--j);
			Y.push_back(--j);
			X.push_back(n[0]);
			Y.push_back(n[2]);
			X.push_back(n[1]);
			Y.push_back(n[3]);
			continue;
		}
		if (S == 3) {
			C[a] = --j;
			X.push_back(--j);
			Y.push_back(--j);
			X.push_back(n[0]);
			Y.push_back(n[1]);
			X.push_back(j+2);
			Y.push_back(n[2]);
		}
	}
	
}
  
  
  /*for (int i=0; i<=M; i++) {
	  cerr << C[i] << " ";
  }
  cerr << endl;*/

  
  answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	36 ms	8376 KB	Output is correct
3	Correct	34 ms	8240 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	7 ms	1372 KB	Output is correct
6	Correct	58 ms	12348 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	36 ms	8376 KB	Output is correct
3	Correct	34 ms	8240 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	7 ms	1372 KB	Output is correct
6	Correct	58 ms	12348 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	62 ms	9972 KB	Output is correct
9	Correct	75 ms	12224 KB	Output is correct
10	Correct	111 ms	15064 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	36 ms	8376 KB	Output is correct
3	Correct	34 ms	8240 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	7 ms	1372 KB	Output is correct
6	Correct	58 ms	12348 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	62 ms	9972 KB	Output is correct
9	Correct	75 ms	12224 KB	Output is correct
10	Correct	111 ms	15064 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	103 ms	12908 KB	Output is correct
15	Correct	55 ms	8388 KB	Output is correct
16	Correct	87 ms	11532 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	103 ms	14996 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct