# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523499 | knightron0 | 바이오칩 (IZhO12_biochips) | C++14 | 6 ms | 11212 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>
using namespace std;
#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 4e5 + 5;
vector<int> adj[MAXN];
int val[MAXN], timer = 1;
int tin[MAXN], tout[MAXN], et[4*MAXN];
bool iftin[4*MAXN];
void dfs(int s){
tin[s] = timer;
iftin[timer] = true;
et[timer] = s;
timer++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |