# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152853 | Segtree | 자동 인형 (IOI18_doll) | C++14 | 0 ms | 0 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<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
void create_circuit(int M,vector<int> A){
vector<int> c(M+1),x,y;
for(int i=0;i<=M;i++){
c[i]=i;
}
ll bef=0;
for(int i=0;i<A.size();i++){
c[bef]=A[i];
bef=A[i];
}
c[bef]=0;
answer(c,x,y);
}/*
int main(){
return 0;
}*/