# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
808646 | PanosPask | Amusement Park (CEOI19_amusementpark) | C++14 | 1358 ms | 1364 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 pb push_back
#define CHECK_BIT(val, pos) (val & (1 << pos))
using namespace std;
const int MOD = 998244353;
const int INV2 = 499122177;
typedef long long ll;
int N, M;
vector<int> adj_list;
// dp[s]: # of ways to construct a DAG in our graph, by directing some of the edges
vector<int> dp;
vector<bool> isgood;
void add(int& a, int b)
{
a += b;
if (a > MOD)
a -= MOD;
}
void subtract(int& a, int b)
{
a -= b;
if (a < 0)
a += MOD;
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... |