제출 #1326080

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326080		SSKMF	Detecting Molecules (IOI16_molecules)	C++20	9 / 100	0 ms	332 KiB

molecules

#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());
    
    int 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);
}

컴파일 시 표준 에러 (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
      |         ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31