# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1173991 | HappyCapybara | Detecting Molecules (IOI16_molecules) | C++17 | 39 ms | 10820 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> W;
vector<signed> mstv(multiset<int> ms){
vector<signed> v;
for (int i=0; i<W.size(); i++){
if (ms.find(W[i]) != ms.end()){
ms.erase(ms.find(W[i]));
v.push_back(i);
}
}
return v;
}
vector<signed> find_subset(signed L, signed U, vector<signed> bruh){
int l = L, u = U;
int n = bruh.size();
vector<int> w(n);
for (int i=0; i<n; i++) w[i] = bruh[i];
W = w;
sort(w.begin(), w.end());
int cur = 0;
multiset<int> res;
for (int i=0; i<n; i++){
res.insert(w[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |