# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106343 | Kenzo_1114 | Cave (IOI13_cave) | C++14 | 606 ms | 640 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"cave.h"
#define debug(args...) //fprintf(stderr,args)
using namespace std;
const int MAXN=5010;
int N,resp[MAXN],porta[MAXN],v[MAXN],s[MAXN];
/*
int tryCombination(int v[])
{
for(int i=0;i<N;i++) printf("%d ",v[i]);
printf("\n");
int a;
scanf("%d",&a);
return a;
}*/
void color(int i,int j,int v[])
{
for(;i<=j;i++)
{
if(s[i]==1) continue;
v[i]=0;
}
}
void color2(int i,int j,int v[])
{
for(;i<=j;i++)
{
# | 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... |