Submission #1326082

#TimeUsernameProblemLanguageResultExecution timeMemory
1326082SSKMFDetecting Molecules (IOI16_molecules)C++20
100 / 100
33 ms3740 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; vector <int> find_subset (int minim , int maxim , vector <int> sir) { vector < pair <int , int> > copie(sir.size()); for (int indice = 0 ; indice < (int)sir.size() ; indice++) { copie[indice] = {sir[indice] , indice}; } sort(copie.begin() , copie.end()); int64_t suma = 0; for (int lungime = 1 , stanga = -1 , dreapta = (int)copie.size() ; lungime <= (int)copie.size() ; lungime++) { suma += copie[--dreapta].first; while (suma > maxim && dreapta < (int)copie.size()) { suma += copie[++stanga].first - copie[dreapta++].first; } if (suma > maxim) { break; } if (suma >= minim) { vector <int> rezultat; for (int indice = 0 ; indice <= stanga ; indice++) { rezultat.push_back(copie[indice].second); } for (int indice = dreapta ; indice < (int)copie.size() ; indice++) { rezultat.push_back(copie[indice].second); } return rezultat; } } return vector <int> (0); }

Compilation message (stderr)

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...