# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481997 | pooyashams | Tug of War (BOI15_tug) | C++17 | 195 ms | 17888 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 <bitset>
using namespace std;
typedef long long ll;
const int maxn = 12e4+10;
bitset<maxn> dp;
vector<int> G[maxn];
int lfts[maxn];
int rits[maxn];
int strn[maxn];
set<int> conts[maxn];
bool vis[maxn];
int dfs(int v)
{
vis[v] = true;
# | 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... |