# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1026801 | nisanduu | 자동 인형 (IOI18_doll) | C++14 | 0 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void create_circuit(int M, std::vector<int> A) {
int N = A.size();
ll inf = 1e9;
std::vector<int> C(M + 1,inf);
map<int,int> mp;
vector<int> X,Y;
vector<int> unused;
int sz = A.size();
int crMinus = -1;
C[0] = crMinus;
X.push_back(A[0]);
Y.push_back(crMinus);
crMinus--;
vector<int> tmp = A;
tmp.push_back(0);
for(int i=0;i<(tmp.size()-1);i++){
if(mp[tmp[i]]){
Y[mp[tmp[i]]] = tmp[i+1];
C[tmp[i]] = tmp[i+1];
}else{
C[tmp[i]] = crMinus;
X.push_back(tmp[i+1]);
Y.push_back(crMinus);
mp[tmp[i]] = i;
crMinus--;
}
}
for(int i=0;i<(M+1);i++){
if(C[i]==inf){
unused.push_back(i);
}
}
sz = unused.size();
for(int i=0;i<(sz-1);i++){
C[unused[i]] = unused[i+1];
}
if(sz>0){
C[unused[sz-1]] = -1;
X.push_back(0);
Y.push_back(-1);
}
//std::vector<int> X(N), Y(N);
answer(C, X, Y);
}
Compilation message (stderr)
# | 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... |