| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1328996 | jasonic | Gondola (IOI14_gondola) | C++20 | 1 ms | 424 KiB |
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define ll long long
int valid(int n, int a[]) {
int offset = -1;
for(int i = 0; i < n; i++) {
if(a[i] <= n) {
if(offset == -1) offset = a[i] - i;
else if(offset != a[i] - i) offset = -n*105;
}
}
return offset > -2;
}
int replacement(int n, int a[], int rep[]) {
}
const ll M = 1e9 + 9; // prime
int countReplacement(int n, int a[]) {
}
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... | ||||
| # | 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... | ||||
