# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
250935 | imeimi2000 | City (JOI17_city) | C++17 | 584 ms | 70616 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 "Encoder.h"
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long llong;
static const int MAXN = 2.5e5;
static const double mul = 1.021;
static vector<int> ls;
static void pushElement() {
int x = ls.back();
int y = x * mul;
if (x == y) ++y;
ls.push_back(y);
}
static void init() {
ls.clear();
ls.push_back(1);
while (ls.back() <= MAXN) pushElement();
for (int i = 0; i < 20; ++i) pushElement();
}
static int n;
static vector<int> edge[MAXN];
static int st[MAXN];
static int sz[MAXN];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |