# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161990 | nvmdava | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 635 ms | 55140 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 ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define N 200005
#define INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007LL
int s[N][2];
int t[N];
vector<int> seg[N << 2];
void build(int id, int l, int r){
if(l == r){
seg[id].push_back(t[l]);
return;
}
int i1 = 0, i2 = 0, id1 = id << 1, id2 = id << 1 | 1, s1, s2;
int m = (l + r) >> 1;
build(id1, l, m);
build(id2, m + 1, r);
s1 = seg[id1].size();
s2 = seg[id2].size();
while(i1 != s1 && i2 != s2){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |