# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39427 | WhipppedCream | Bosses (BOI16_bosses) | C++14 | 943 ms | 2508 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>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vvi vector< vi >
#define vii vector< ii >
#define mp make_pair
#define pb push_back
const int maxn = 5005;
vector<int> adj[maxn];
int n;
int vis2[maxn];
int p[maxn];
int inq[maxn];
ll cost[maxn];
ll solve(int x)
{
memset(vis2, 0, sizeof vis2);
memset(cost, 0, sizeof cost);
memset(p, -1, sizeof p);
vector<int> rev;
queue<int> Q;
Q.push(x);
vis2[x] = 1;
while(!Q.empty())
{
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... |