# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
583074 | AlexLuchianov | Bitaro’s Party (JOI18_bitaro) | C++14 | 809 ms | 292984 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 <iostream>
#include <vector>
#include <algorithm>
using ll = long long;
int const nmax = 100000;
int const threshold = 360;
std::vector<int> g[5 + nmax];
int cap[5 + nmax];
std::pair<int, int> dp[5 + nmax][5 + threshold];
std::pair<int,int> aux[5 + threshold * 2];
namespace lowmap{
int frec[5 + nmax];
int timestamp = 1;
void reset() {
++timestamp;
}
bool find(int val) {
return frec[val] == timestamp;
}
void insert(int val) {
frec[val] = timestamp;
}
};
int dpBrut[5 + nmax];
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... |