# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
735692 | Mister_HDS | Bitaro’s Party (JOI18_bitaro) | C++14 | 2066 ms | 155628 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>
#define ll long long
#define endl "\n"
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
const int MAX = (int)1e5 + 10;
const double PI = acos(-1);
vector<int> adj[MAX];
vector<int> par[MAX];
vector<pair<int, int>> shits[MAX];
int frq[MAX];
bool removed[MAX];
int sqrt_n = 115;
void build(queue<int> q, vector<int> ind)
{
while (!q.empty())
{
int curNode = q.front();
q.pop();
for (auto node : adj[curNode])
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... |