# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
485554 | chungdinh | Paths (BOI18_paths) | C++17 | 430 ms | 61344 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 <iostream>
#include <vector>
#define ll long long
const int N = 5e5 + 5;
const ll MOD = 1e9 + 7;
#define cntbit(x) __builtin_popcount(x)
#define on(b, x) (b & (1 << x))
using namespace std;
int n, m, k;
int c[N];
vector<int> g[N];
ll dp[1 << 5][N];
vector<int> z[100];
int main() {
#ifdef CHUNGDINH
freopen("main.inp", "r", stdin);
#endif // CHUNGDINH
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
cin >> c[i]; c[i]--;
dp[1 << c[i]][i] = 1;
# | 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... |