| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 317592 | ThaiBaHung | Fortune Telling 2 (JOI14_fortune_telling2) | C++14 | 681 ms | 54868 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;
const int N = 5e5 + 3;
int n, k;
struct ok2
{
long long A;
long long B;
int cs;
};
ok2 a[N];
int pos[N][3];
int b[N];
int pos2[N];
vector < pair < int, int > > num;
pair < int, int > roirac[N];
struct ok
{
int lo;
int hi;
int pos;
int cnt;
};
ok Node[4 * N], Sum[4 * N];
void build(int id, int l, int r, ok Node[])
{
Node[id].lo = l; Node[id].hi = r;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||