제출 #1223223

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

molecules

#include "molecules.h"
#include <iostream>
#include <vector>

using namespace std;

struct number {
    int n;
    int index;
    bool operator<(const number& other) const {
        return n < other.n;
    }
};


vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<number> numbers;
    vector<int> ans;
    int total = 0;
    for (int i = 0; i < w.size(); i++) {
        number num;
        num.n = w[i];
        num.index = i;
        numbers.push_back(num);
    }
    sort(numbers.begin(),numbers.end());
    int bigCount = 0, smallCount = 0;
    int big = numbers[n-1].n, small = numbers[0].n;
    for (auto [num, ind] : numbers) {
        if (num == big) bigCount++;
        if (num == small) smallCount++;
    }
    vector<int> ans1;
    vector<int> ans2;

    for(int i = 0; i < n; i++) {
        ans.push_back(numbers[i].index);
        total += numbers[i].n;
        if (l <= total && total <= u) {
            return ans;
        }
    }

    if (total < l) return vector<int>(0);

    int i = n-1;
    total = 0;
    while (total <= u) {
        total += numbers[i].n;
        ans1.push_back(numbers[i].index);
        if (total >= l && total <= u) {
            return ans1;
        }
        i--;
    }

    int lower = 0;

    while (lower < n) {
        if(ans1.size() > 0) {
            total -= w[ans1.back()];
            ans1.pop_back();
        }
        ans2.push_back(numbers[lower].index);
        total += numbers[lower].index;
        lower++;
        if (total >= l && total <= u) {
            ans1.insert(ans1.end(),ans2.begin(),ans2.end());
            return ans1;
        }
    }

    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: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31