제출 #1147640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147640		cntour	Detecting Molecules (IOI16_molecules)	C++20	100 / 100	56 ms	5192 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    // Create pairs of {weight, index}
    vector<pair<long long, int>> molecules(n);
    for(int i = 0; i < n; i++) {
        molecules[i] = {w[i], i};
    }
    
    // Sort by weight
    sort(molecules.begin(), molecules.end());
    
    // Use two pointers to find a valid range
    int left = 0;
    long long sum = 0;
    
    for(int right = 0; right < n; right++) {
        sum += molecules[right].first;
        
        // If sum becomes too large, remove elements from left
        while(left <= right && sum > u) {
            sum -= molecules[left].first;
            left++;
        }
        
        // Check if current window has valid sum
        if(sum >= l && sum <= u) {
            vector<int> result;
            // Collect indices from the valid window
            for(int i = left; i <= right; i++) {
                result.push_back(molecules[i].second);
            }
            // Sort indices as required
            sort(result.begin(), result.end());
            return result;
        }
    }
    
    // No solution found
    return vector<int>();
}

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