# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
489643 | Killer2501 | The short shank; Redemption (BOI21_prison) | C++17 | 1577 ms | 250252 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 <algorithm>
#include <numeric>
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#define pll pair<int, int>
#define task "test"
#define fi first
#define se second
using namespace std;
using ll = int;
const int N = 2e6+15;
const ll mod = 998244353;
const ll base = 350;
const ll inf = 1e9;
ll m, n, t, k,ans, tong, a[N], b[N], c[N], d[N], in[N], out[N], cnt, pos[N];
vector<ll> adj[N];
stack<ll> kq;
pll seg[N];
ll pw(ll k, ll n)
{
ll total = 1;
for(; n; n >>= 1)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |