# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104420 | CaroLinda | Dreaming (IOI13_dreaming) | C++14 | 30 ms | 3108 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>
#include "dreaming.h"
#define MAXN 10005
#define lp(i,a,b) for(int i = a ; i < b ; i++)
#define pb push_back
#define pii pair<int,int>
#define ff first
#define ss second
const int inf = 1e9 + 5 ;
using namespace std;
//declaration crap
int N , M , L;
int radio1, radio2 ;
int d[MAXN] ;
int dd[4][MAXN] ;
bool marc[MAXN] ;
vector<pii> adj[MAXN] ;
void attribution(int x)
{lp(i,0,N) dd[x][i] = d[i] ;}
void bfs(int S )
{
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |