# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243629 | groeneprof | Split the Attractions (IOI19_split) | C++14 | 172 ms | 28024 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 "split.h"
#include <bits/stdc++.h>
#define P(a) do{if(debug)cout<<a<<endl;} while(false);
#define H(a) P(#a<<": "<<a);
using namespace std;
const int inf = 2e9;
const bool debug = 0 ;
vector<vector<int> > graph;
vector<bool> vis1,vis2;
vector<int> ts,mi,res,size;
int t = 0;
int va,vb,vc;
int a,b,c;
int na = 0, nb = 0, nc = 0;
int n;
bool bol = false;
void dfs2(int u, int& mints);
void dfs3(int u);
int dfs(int u){
if(vis1[u]) return 0;
if(ts[u]!=-1) return inf;
ts[u] = t++;
mi[u] = ts[u];
vis1[u] = true;
vector<int> cs;
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... |