# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31427 | chonka | Fortune Telling 2 (JOI14_fortune_telling2) | C++98 | 529 ms | 54196 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<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std ;
#define MAXN 200007
int n , q ;
int a[ MAXN ] ;
int b[ MAXN ] ;
int x[ MAXN ] ;
int lst[ MAXN ] ;
pair < int , int > srt[ MAXN ] ;
vector < pair < int , int > > v ;
class DumbTree {
public :
int tr[ 3 * MAXN ] ;
void init ( int where , int IL , int IR ) {
tr[ where ] = 0 ;
if ( IL == IR ) { return ; }
int mid = ( IL + IR ) / 2 ;
init ( 2 * where , IL , mid ) ;
init ( 2 * where + 1 , mid + 1 , IR ) ;
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... |