# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
719727 | pashka | Cards (LMIO19_korteles) | C++14 | 456 ms | 252116 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>
#define long long long int
#define DEBUG
using namespace std;
// @author: pashka
const int M = 10000000;
struct hashmap {
long keys[M];
int vals[M];
void clear() {
for (int i = 0; i < M; i++) vals[i] = 0;
}
int hash(long x) {
return (x * 239) % M;
}
int get(long x) {
int i = hash(x);
while (vals[i] != 0) {
if (keys[i] == x) return vals[i];
i++;
if (i == M) i = 0;
}
return 0;
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... |