제출 #1293074

#제출 시각아이디문제언어결과실행 시간메모리
1293074trandaihao5555Detecting Molecules (IOI16_molecules)C++20
100 / 100
48 ms3764 KiB
#include<bits/stdc++.h> //using namespace std; #include "molecules.h" using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { vector<pair<int,int>> a; int n = w.size(); a.resize(n); for (int i=0;i<n;i++) a[i] = make_pair(w[i],i); sort(a.begin(),a.end()); vector<int> res; long long sum = 0; for (int i=0,j=0;i<n;i++) { while (j < n && sum < l) sum += a[j++].first; if (sum < l) return vector<int>(); if (sum <= u) { for (int k=i;k<j;k++) res.push_back(a[k].second); sort(res.begin(),res.end()); return res; } sum -= a[i].first; } return res; } //int main() { // vector<int> tmp = find_subset(15, 17, {6, 8, 8, 7}); // cout << "ok\n"; // for (int x : tmp) cout << x << '\n'; //}

컴파일 시 표준 에러 (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
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...