제출 #1309414

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309414		husseinjuanda	Detecting Molecules (IOI16_molecules)	C++20	100 / 100	34 ms	5176 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> find_subset(int l, int r, std::vector<int> w){
    vector<pair<int, int>> w1;
    for(int i = 0; i < w.size(); i++){
        w1.push_back({w[i], i});
    }
    vector<int> ori_w = w;
    sort(w1.begin(), w1.end());
    vector<bool> vis(w.size());
    deque<int> d;
    long long sum = 0;
    for(int i = 0; i < w.size(); i++){
        w[i] = w1[i].first;
        if(sum+w[i] >= l && sum+w[i] <= r){
            sum += w[i];
            d.push_back(w1[i].second);
            break;
        }
        if(sum+w[i] >= l) break;
        vis[i] = true;
        sum += w[i];
        d.push_back(w1[i].second);
    }
    for(int i = 0; i < w.size(); i++){
        w[i] = w1[i].first;
    }
    if(sum >= l && sum <= r){
        vector<int> ns;
        while(d.size() > 0){
            ns.push_back(d.back());
            d.pop_back();
        }
        return ns;
    }
    for(int i = w.size()-1; i >= 0; i--){
        if(vis[i]) break;
        sum += w[i];
        d.push_back(w1[i].second);
        sum -= ori_w[d.front()];
        d.pop_front();
        if(sum >= l && sum <= r){
            break;
        }
    }
    vector<int> ns(0);
    if(!(sum >= l && sum <= r)){
        return ns;
    }
    while(d.size() > 0){
        ns.push_back(d.back());
        d.pop_back();
    }
    return ns;
}

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