# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492727 | Md_yz | Bitaro’s Party (JOI18_bitaro) | C++14 | 1862 ms | 202000 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.
// elahi shokrt
// resad adami be jaee ke be joz khoda nabinad
//bengar ke ta che had ast makan adamiat!
#include<bits/stdc++.h>
using namespace std ;
#define pb push_back
#define all(v) v.begin(),v.end()
#define M '\n'
#define f first
#define s second
typedef long long int lli ;
typedef pair<lli,lli> pll;
const lli mma=1e5+10;
const lli mod = 1e9+7 ;
const lli sq = 110 ;
const lli inf = 1e9 ;
vector<lli> g[mma];
lli n , m , q ;
pll dp[mma][sq+12];
bool seen[mma];
bool seen1[mma];
void benazaretbehtare(lli u , lli i ){
vector<pll> v;
for(int j = 0 ; j <sq ; j++){
v.pb(dp[i][j]);
v.pb(pll(dp[u][j].f+1,dp[u][j].s));
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... |