# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59335 | gusfring | Fortune Telling 2 (JOI14_fortune_telling2) | C++14 | 2392 ms | 148700 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 maxn = 2e5 + 5;
int n,m;
int a[maxn], b[maxn], c[maxn];
int pos[maxn], res[maxn];
vector<int> p[maxn];
int sz;
int limit, tree[maxn*9];
int fen[maxn*3];
map<int,int> mp;
int rec[maxn*3];
void cpidx() {
for(int i=1; i<=n; i++) mp[a[i]], mp[b[i]];
for(int i=1; i<=m; i++) mp[c[i]];
for(auto &it : mp){
it.second = ++sz;
rec[sz] = it.first;
}
for(int i=1; i<=n; i++) a[i] = mp[a[i]], b[i] = mp[b[i]];
for(int i=1; i<=m; i++) c[i] = mp[c[i]];
}
void init(){
limit = 1;
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... |