| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1219384 | inesfi | Mechanical Doll (IOI18_doll) | C++20 | 42 ms | 12324 KiB |
#include "doll.h"
#include<bits/stdc++.h>
using namespace std;
const int TAILLEMAXI=100*1000+2;
vector<int> vers[TAILLEMAXI];
vector<int> X,Y,prochain;
void create_circuit(int M,vector<int> A) {
A.push_back(0);
for (int i=0;i<(int)A.size()-1;i++){
vers[A[i]].push_back(A[i+1]);
}
int compt=-1;
prochain.push_back(A[0]);
for (int i=1;i<=M;i++){
if (vers[i].size()==0){
prochain.push_back(0);
}
else if (vers[i].size()==1){
prochain.push_back(vers[i][0]);
}
else if (vers[i].size()==2){
prochain.push_back(compt);
compt--;
X.push_back(vers[i][0]);
Y.push_back(vers[i][1]);
}
}
answer(prochain,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... | ||||
