Submission #1281093

#TimeUsernameProblemLanguageResultExecution timeMemory
1281093SSKMFFinding Routers (IOI20_routers)C++20
100 / 100
2 ms376 KiB
#include "routers.h" #include <bits/stdc++.h> using namespace std; inline void Divide (const int stanga , const int dreapta , const int inceput , const int sfarsit , vector <int>& capat) { if (stanga > dreapta) { return; } if (inceput == sfarsit) { capat[stanga] = inceput; return; } const int mijloc = (inceput + sfarsit) >> 1; const int raspuns = use_detector(mijloc); Divide(stanga , raspuns , inceput , mijloc , capat); Divide(raspuns + 1 , dreapta , mijloc + 1 , sfarsit , capat); } vector <int> find_routers (int lungime , int cantitate , int limita) { vector <int> rezultat(cantitate); Divide(1 , cantitate - 1 , 1 , lungime , rezultat); for (int indice = 1 ; indice < cantitate ; indice++) { rezultat[indice] += rezultat[indice] - rezultat[indice - 1] - 2; } return rezultat; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...