제출 #1281088

#제출 시각아이디문제언어결과실행 시간메모리
1281088SSKMFFinding Routers (IOI20_routers)C++20
69.65 / 100
2 ms352 KiB
#include "routers.h" #include <bits/stdc++.h> using namespace std; vector <int> find_routers(int lungime , int cantitate , int degeaba) { vector <int> rezultat = {0}; for (int indice = 0 ; indice + 1 < cantitate ; indice++) { int locatie = rezultat[indice]; for (int putere = (1 << 16) ; putere ; putere >>= 1) { if (locatie + putere <= lungime && use_detector(locatie + putere) == indice) { locatie += putere; } } rezultat.push_back(2 * locatie - rezultat[indice]); } 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...