# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20216 | forever426 | 탐사 (KOI13_probe) | C11 | 2081 ms | 376 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 <stdio.h>
#include <stdlib.h>
#include <string.h>
int K, N;
typedef struct st
{
int s;
int e;
int n;
}SEARCH;
SEARCH S[1000+10];
int Map[40+5];
int End[40+5];
int Check_sum[41][41];
int Check_line[41][2];
int CMP(const void * a, const void * b)
{
return ((SEARCH*)a)->e - ((SEARCH*)b)->e;
}
int DFS(int n, int c)
{
int i, m;
if(n>K) return 1;
Map[n] = c;
for(i=n; i>0; i--) Check_sum[i][n] = Check_sum[i][n-1] + c;
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... |