| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1234631 | PenguinsAreCute | Park (JOI17_park) | C++17 | 39 ms | 328 KiB |
#include "park.h"
#include <bits/stdc++.h>
using namespace std;
void Detect(int T, int N) {
int Place[N];
for(int i=0;i<N;i++)
for(int j=i+1;j<N;j++) {
memset(Place,0,sizeof(Place));
Place[i] = Place[j] = 1;
if(Ask(i, j, Place))
Answer(i, 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... | ||||
