| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1244744 | JoenPoenMan | 자동 인형 (IOI18_doll) | C++20 | 41 ms | 11192 KiB |
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
void create_circuit(int m, vi a) {
int n = a.size();
vvi next(m+1);
next[0].push_back(a[0]);
for(int i = 1; i < n; i++)
{
next[a[i-1]].push_back(a[i]);/* */
}
next[a[n-1]].push_back(0);
vi c(m+1), x, y;
for(int i = 0; i < m + 1; i++)
{
if(next[i].empty())
continue;
if(next[i].size() == 1)
{
c[i] = next[i][0];
continue;
}
int switchindex = -x.size() -1;
c[i] = switchindex;
x.push_back(next[i][0]);
y.push_back(next[i][1]);
}
answer(c, x, y);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
