제출 #1327607

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1327607		AzeTurk810	Detecting Molecules (IOI16_molecules)	C++20	100 / 100	42 ms	5264 KiB

molecules

/*
Telebe of Adicto && Mamedov yani AzeTurk810
I see humans but no humanity
Problem: $(PROBLEM)
Contest: $(CONTEST)
Judge: $(JUDGE)
URL: $(URL)
Memory Limit: $(MEMLIM)
Time Limit: $(TIMELIM)
Start: $(DATE)
*/
#include "molecules.h"
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
#define ll int64_t

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    vector<ll> prefix(n + 1);
    prefix[0] = 0;
    set<ll> st;
    st.insert(0);
    vector<ll> ord(n);
    // cerr << "alinir" << endl;
    for (int i = 0; i < n; i++) {
        ord[i] = i;
    }
    sort(ord.begin() , ord.end() ,[&] (int i , int j){
            return w[i] < w[j];
            });
    for (int i = 1; i <= n; i++) {
        prefix[i] = prefix[i - 1] + w[ord[i - 1]];
    }
    // cerr << "sa" << '\n';
    for (int i = 1; i <= n; i++) {
        ll mi = prefix[i];
        ll mx = prefix[n] - prefix[n - i];
        if(mi > u || mx < l)
            continue;
        for (int j = 0; j < n - i + 1; j++) {
            if(prefix[i + j] - prefix[j] >= l && prefix[i + j] - prefix[j] <= u) {
                vector<int> ans;
                for (int k = 0; k < i; k++) {
                    ans.push_back(ord[j + k]);
                }
                return  ans;
            }
        }
    }
    return std::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: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31