# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
479065 | lollipop | Addk (eJOI21_addk) | C++14 | 459 ms | 11332 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>
#define int long long
#define pb push_back
#define s second
#define f first
using namespace std ;
const int mod = 1000000007 ;
map < int , int > ma ;
const int N = 100005 ;
const int N1 = ( - 1 ) *( INT_MAX ) ;
int node[ 4 * N ] ;
int a[ N ] ;
int node1[ 4 * N ] ;
int a1[ N ] ;
void build( int v , int vl , int vr ){
if( vl == vr ){
node[ v ] = a[ vl ] ;
return ;
}
int vm = ( vl + vr ) / 2 ;
build( v + v , vl , vm ) ;
build( v + v + 1 , vm + 1 , vr ) ;
node[ v ] = node[ v + v ] + node[ v + v + 1 ] ;
}
void build1( int v , int vl , int vr ){
if( vl == vr ){
node1[ v ] = a1[ vl ] ;
return ;
}
int vm = ( vl + vr ) / 2 ;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |