제출 #1223194

#제출 시각아이디문제언어결과실행 시간메모리
122319412baaterDetecting Molecules (IOI16_molecules)C++20
19 / 100
0 ms328 KiB
#include "molecules.h" #include <valarray> #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<int> ans; vector<number> numbers; 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 small = numbers[0].n; int big = small + 1; for (auto [num, ind] : numbers) { if (num == big) bigCount++; else smallCount++; } vector<int> firstAns; vector<int> secondAns; int buffer = 0; for(int i = 0; i < smallCount; i++) { total += numbers[i].n; firstAns.push_back(numbers[i].index); if(total >= l && total <= u) { return firstAns; } } total = 0; for(int i = smallCount; i < n; i++) { total += numbers[i].n; secondAns.push_back(numbers[i].index); if(total >= l && total <= u) { return secondAns; } } total = 0; firstAns.clear(); secondAns.clear(); for (int i = 0; i < smallCount; i++) { firstAns.push_back(numbers[i].index); total += numbers[i].n; buffer = total; secondAns.clear(); for (int j = smallCount; j < n; j++) { secondAns.push_back(numbers[j].index); total += numbers[j].n; if(total >= l && total <= u) { firstAns.insert(firstAns.end(),secondAns.begin(),secondAns.end()); return firstAns; } } total = buffer; } 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
      |         ^~~~
#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...