# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41555 | alenam0161 | Cave (IOI13_cave) | C++14 | 523 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 <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include "cave.h"
using namespace std;
const int N = 5e3 + 7;
int a[N];
int use[N];
int b[N];
int wh[N];
int an[N];
int con[N];
void pri(int n, int ma[]) {
for (int i = 0; i < n; ++i) {
cout << ma[i] << " ";
}
cout << endl;
}
void pr(int n, int ma[],int an) {
pri(n, ma);
cout << "ANS=" <<an;
cout << endl;
}
void exploreCave(int N) {
for (int i = 0; i < N; ++i) {
int n = 0;
for (int j = 0; j < N; ++j) {
if (use[j])continue;
a[n++] = j;
# | 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... |