# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567458 | shahriarkhan | Crayfish scrivener (IOI12_scrivener) | C++14 | 510 ms | 246968 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 MX = 1e6 + 5 ;
int od = 0 ;
string s = "" ;
struct Node
{
int left = 0 , right = 0 , sum = 0 ;
} emp ;
struct psegtree
{
int cur = 0 , cnt = 0 , N ;
vector<Node> T ;
vector<int> root ;
void init(int n , int m)
{
N = n ;
T = vector<Node> (20*n + 5 , emp) ;
root = vector<int> (m + 5 , 0) ;
}
int _update(int node , int low , int high , int idx , int val)
# | 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... |