# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784601 | MohamedAliSaidane | Two Currencies (JOI23_currencies) | C++14 | 1893 ms | 54892 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;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()
const int nax = 1e5 + 4;
int n, m, q, k = 1;
vector<pii> adj[nax];
vector<pair<ll,int>> checkp;
vector<ll> st, lazy;
int eul[nax], ed[nax], sp[nax][20], d[nax], head[nax];
int S[nax], T[nax], C[nax];
ll X[nax], Y[nax];
int cureul = -1;
void propagate(int p, int l, int r)
{
if(lazy[p] != 0)
{
if(l != r)
{
# | 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... |