Submission #152956

#TimeUsernameProblemLanguageResultExecution timeMemory
152956Ruxandra985popa (BOI18_popa)C++14
0 / 100
31 ms376 KiB
#include <cstdio> #include "popa.h" /// radem glumim dar dc iau runtime int solve (int N , int *Left , int *Right){ /// return root int i,lant,root,bgn,ed,eda; int tt[1010]; for (i=0;i<N;i++){ tt[i] = Left[i] = Right[i] = -1; /// reset all } /// separam in lanturi lant = 1; bgn = ed = 0; eda = -1; /// cel de care poti lipi for (i=1;i<N;i++){ /// n - 1 if (query(bgn , i , i , i)){ /// i apartine lantului curent ed = i; tt[i-1] = i; } else { /// incepem alt lant if ( lant != 1 ){ /// vedem cum il unim if (query(eda , ed , eda , eda)){ tt[ed] = eda; /// unesti intervalele astea } else { /// daca nu pot cu aia , il fac pe ed[i] radacina tt[root] = ed; root = ed; ed--; } } else root = ed; lant++; eda = ed; bgn = ed = i; } } if ( lant != 1 ){ /// vedem cum il unim if (query(eda , ed , eda , eda)){ tt[ed] = eda; /// unesti intervalele astea } else { /// daca nu pot cu aia , il fac pe ed[i] radacina tt[root] = ed; root = ed; ed--; } } else root = ed; /// uniunile dintre lanturi se fac clar la nivelul lui ed /// pentru ca au indici consecutivi in s return root; }

Compilation message (stderr)

popa.cpp: In function 'int solve(int, int*, int*)':
popa.cpp:7:9: warning: variable 'tt' set but not used [-Wunused-but-set-variable]
     int tt[1010];
         ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...