# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1062690 | nvujica | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 2396 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "molecules.h"
#define ll long long
using namespace std;
const int maxn = 5e5 + 100;
int n;
unsigned ll bio[maxn / 64];
unsigned ll bio2[maxn / 64];
int kada[maxn];
vector<int> find_subset(int l, int u, vector<int> w) {
n = w.size();
memset(kada, -1, sizeof kada);
// for(int j = 63; j >= 0; j--){
// if(bio[0] && (1LL << j)) cout << 1;
// else cout << 0;
// }
// cout << endl;
bio[0] = (1LL << 63);
// cout << "prije ";
// for(int j = 63; j >= 0; j--){
// if(bio[0] & (1LL << j)) cout << 1;
# | 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... |