# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855120 | Warinchai | Two Currencies (JOI23_currencies) | C++14 | 758 ms | 147204 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;
int n,m,q;
int dp[100005][20];
int lv[100005];
vector<int>v[100005];
vector<long long>cp[100005];
map<pair<int,int>,int>mp;
vector<long long>vl;
struct pstree{
struct node{
node *l,*r;
long long val;
int cnt;
node(long long x=0){
val=x;
cnt=0;
l=r=NULL;
}
};
typedef node* pnode;
pnode root[100005];
long long getval(pnode x){
return x?x->val:0;
}
long long getcnt(pnode x){
return x?x->cnt:0;
}
void build(int st,int en,pnode &x){
x=new node();
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |