# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135837 | model_code | Link (CEOI06_link) | C++17 | 450 ms | 47376 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 <cstdio>
#include <vector>
using namespace std;
#ifdef DJGPP
unsigned _stklen = 16*1024*1024;
#endif
#define MAXN 1000000
const int inf = 1000000000;
int n, k;
int link[MAXN];
int dead[MAXN];
vector<int> adj[MAXN];
vector< vector<int> > ciklusi;
int result = 0;
void nadji_cikluse() {
vector<int> bio( n, 0 );
int time = 0;
for( int i = 0; i < n; ++i ) {
if( bio[i] ) continue;
int a, b;
bio[i] = ++time;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |