# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568473 | mircea_007 | T-Covering (eJOI19_covering) | C++17 | 48 ms | 21028 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.
// This program was written on 19.05.2022
// for problem covering
// by Mircea Rebengiuc
#include <stdio.h>
#include <ctype.h>
#include <stdlib.h>// exit()
#include <vector>
#define MAXSIZE 1000000
#define INF 2000000000
static inline int max( int a, int b ){ return a > b ? a : b; }
static inline int min( int a, int b ){ return a < b ? a : b; }
int cost[MAXSIZE];
char is_special[MAXSIZE];
int comp[MAXSIZE];
int n, m;
int current_comp;
char delta[MAXSIZE];
int mincost[MAXSIZE];
int sum[MAXSIZE];
int dl[4] = { -1, 0, 1, 0 };
int dc[4] = { 0, 1, 0, -1 };
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |