Submission #128498

#	Time	Username	Problem	Language	Result	Execution time	Memory
128498		Just_Solve_The_Problem	자동 인형 (IOI18_doll)	C++11	6 / 100	79 ms	5944 KiB

doll

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

using namespace std;

const int maxn = (int)1e5 + 7;

int cnt[maxn];

void create_circuit(int M, vector<int> A) {
  int N = A.size();
  vector<int> C(M + 1);
  vector<int> X, Y;
  C[0] = A[0];
  for (int i = 0; i < N; i++) {
		cnt[A[i]]++;
		int to = ((i + 1 == N) ? 0 : A[i + 1]);
		if (cnt[A[i]] == 1) {
			C[A[i]] = -((int)X.size() + 1);
			X.push_back(C[A[i]]);
			Y.push_back(to);
		} else {
			X[-C[A[i]] - 1] = Y[-C[A[i]] - 1];
			Y[-C[A[i]] - 1] = to;
		}
  }
  answer(C, X, Y);
}
/*
3 6
1 2 3 2 3 1
*/

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 18
• Subtask 6: 0 / 56