# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
928741 |
2024-02-17T03:36:31 Z |
Juanchoki |
Cave (IOI13_cave) |
C++14 |
|
9 ms |
564 KB |
#include"cave.h"
#include <bits/stdc++.h>
using namespace std;
/*
int S[1<<20], D[1<<20];
int N;
int tryCombination(int comb[])
{
int mini = 1<<20;
for (int i = 0; i < N; i++)
if (S[i] != comb[i])
mini = min (mini, D[i]);
if (mini == 1<<20) mini = -1;
return mini;
}
void answer (int arr[], int otro[])
{
for (int i = 0; i < N; i++)
if (arr[i] != S[i])
{
cout << "WA";
return;
}
for (int i = 0; i < N; i++)
if (otro[i] != D[i])
{
cout << "WA";
return;
}
cout << "AC";
}
void imprime (int arr[])
{
for (int i = 0; i < N; i++)
cout << arr[i] << " ";
cout << '\n';
}
*/
void exploreCave(int N)
{
int arr[N];
int otro[N];
for (int i = 0; i < N; i++)
arr[i] = 0;
int last = 0;
while (last < N)
{
arr[last] = 1;
int temp = tryCombination(arr);
otro[last] = temp;
arr[last] = 0;
last++;
}
//imprime(arr);
//imprime(otro);
answer(arr, otro);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
360 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
8 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
504 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
8 ms |
344 KB |
Output is correct |
7 |
Correct |
8 ms |
344 KB |
Output is correct |
8 |
Correct |
9 ms |
564 KB |
Output is correct |
9 |
Correct |
8 ms |
348 KB |
Output is correct |
10 |
Correct |
8 ms |
348 KB |
Output is correct |
11 |
Correct |
8 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Answer is wrong |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Answer is wrong |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
360 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |