# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830135 | MohamedAhmed04 | Designated Cities (JOI19_designated_cities) | C++14 | 1635 ms | 52720 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 MAX = 2e5 + 10 ;
int arr[MAX] ;
int n , q ;
vector< vector< pair<int , int> > >adj(MAX) ;
long long ans[MAX] ;
int mark[MAX] ;
int sz[MAX] ;
int cursrc , cursz ;
long long curcost ;
pair<long long , int>tree[4 * MAX] ;
long long lazy[4 * MAX] ;
int id[MAX] ;
long long val3[MAX] ;
void build(int node , int l , int r)
{
if(l == r)
{
tree[node] = {val3[id[l]] , l} , lazy[node] = 0 ;
return ;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |