# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124261 | tutis | Mountains (IOI17_mountains) | C++17 | 857 ms | 235324 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.
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
struct BitSet
{
unsigned long long A[32];
unsigned long long h;
BitSet()
{
h = 0;
fill_n(A, 32, 0ull);
}
bool operator<(const BitSet& o)const
{
if (h != o.h)
return h < o.h;
for (int i = 0; i < 32; i++)
{
if (A[i] != o.A[i])
return A[i] < o.A[i];
}
return false;
}
void set(int i)
{
for (int t = 0; t < 32; t++)
{
if (i < 64)
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... |