# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
719871 | ThegeekKnight16 | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 1037 ms | 206608 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>
using namespace std;
#define int long long
const int border = 1e9 + 10;
vector<int> minTmp, qnt, e, d;
int create()
{
minTmp.push_back(LONG_LONG_MAX);
qnt.push_back(0);
e.push_back(0);
d.push_back(0);
return qnt.size()-1;
}
void copy(int pos, int novo)
{
minTmp[novo] = minTmp[pos];
qnt[novo] = qnt[pos];
e[novo] = e[pos];
d[novo] = d[pos];
}
int update(int pos, int ini, int fim, int id, int val)
{
if (id < ini || id > fim) return pos;
int novo = create();
copy(pos, novo);
if (ini == fim)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |