# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680537 | adilet_321 | Bitaro the Brave (JOI19_ho_t1) | C++14 | 255 ms | 154772 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>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#define ll long long
#define FOR(i,a) for (long long i=0;i<a;i++)
#define FORN(i,a) for (long long i=1;i<=a;i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
using namespace std;
/*
ll bin1(ll a,ll b){
if (b==0)return 1;
if (b==1)return a;
if (b&1)return bin(a,b-1)*a;
c=bin(a,b/2);
return c*c;
}
ll bin2(ll a,ll b){
ll res=1;
while(b){
if(b&1){
res*=a;
}
a*=a;
b/=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... |