Submission #800784

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
800784	2023-08-01T20:42:46 Z	biank	Mechanical Doll (IOI18_doll)	C++14	6 / 100	126 ms	19004 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;
		}
		C[a] = --j;
		for (int i=0; i<S-2; i++) {
			X.push_back(n[i]);
			Y.push_back(--j);
		}
		X.push_back(n[S-2]);
		Y.push_back(n[S-1]);
	}
	
	
  
  
  /*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	48 ms	9176 KB	Output is correct
3	Correct	34 ms	8764 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	7 ms	1364 KB	Output is correct
6	Correct	55 ms	13108 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	48 ms	9176 KB	Output is correct
3	Correct	34 ms	8764 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	7 ms	1364 KB	Output is correct
6	Correct	55 ms	13108 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	63 ms	11312 KB	Output is correct
9	Correct	71 ms	14204 KB	Output is correct
10	Correct	126 ms	19004 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	296 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	48 ms	9176 KB	Output is correct
3	Correct	34 ms	8764 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	7 ms	1364 KB	Output is correct
6	Correct	55 ms	13108 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	63 ms	11312 KB	Output is correct
9	Correct	71 ms	14204 KB	Output is correct
10	Correct	126 ms	19004 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	296 KB	Output is correct
14	Incorrect	96 ms	14564 KB	wrong motion
15	Halted	0 ms	0 KB	-