# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
884709 | parlimoos | Uzastopni (COCI15_uzastopni) | C++14 | 5 ms | 3812 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.
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define cl clear
#define bg begin
#define lb lower_bound
#define ub upper_bound
#define arr(x) array<int , x>
#define endl '\n'
int n;
int vs[10000];
vector<arr(2)> tr[10000];
bool ls[10000][100];
bool rs[10000][100];
void dfs(int v = 0){
// cout << v << ">>\n" << flush;
for(auto el : tr[v]) dfs(el[1]);
ls[v][vs[v]] = 1 , rs[v][vs[v]] = 1;
arr(2) d = {vs[v] , -1};
int inx1 = int(lb(tr[v].bg() , tr[v].end() , d) - tr[v].bg());
while(inx1 > 0){
inx1--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |