Submission #139409

#TimeUsernameProblemLanguageResultExecution timeMemory
139409LawlietMechanical Doll (IOI18_doll)C++14
2 / 100
41 ms3624 KiB
#include <bits/stdc++.h> #include "doll.h" #define MAX 200010 using namespace std; int N; int tube[MAX]; vector<int> X; vector<int> Y; vector<int> nullVector; vector<int> triggers; /*void answer(vector<int> C, vector<int> xx, vector<int> yy) { for(int g = 0 ; g < C.size() ; g++) printf("%d ",C[g]); printf("\n\n"); for(int g = 0 ; g < X.size() ; g++) printf("%d %d\n",X[g],Y[g]); }*/ void create_circuit(int M, vector<int> A) { N = A.size(); vector<int> aux; aux.push_back( 0 ); //printf("oii\n"); for(int g = 0 ; g < N ; g++) aux.push_back( A[g] ); aux.push_back( 0 ); memset(tube , -1 , sizeof(tube)); for(int g = 1 ; g <= N ; g++) tube[ aux[g - 1] ] = aux[g]; //trigger.push_back( 1 ); for(int g = 0 ; g <= M ; g++) { if(tube[g] == -1) triggers.push_back( 0 ); else triggers.push_back( tube[g] ); } answer( triggers , nullVector , nullVector ); } /*int main() { int nn, mm; scanf("%d %d",&nn,&mm); vector<int> au(nn); for(int g = 0 ; g < nn ; g++) scanf("%d",&au[g]); create_circuit(mm , au); }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...