| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1360465 | lizi14 | Gondola (IOI14_gondola) | C++20 | 7 ms | 756 KiB |
#include <bits/stdc++.h>
using namespace std;
#include "gondola.h"
int valid(int n, int inputSeq[]){
int hi=0;
for(int i=0; i<n-1; i++){
//cout<<inputSeq[i]<<" ";
if(inputSeq[i]>n)i++;
if(inputSeq[i]+1!=inputSeq[i+1]){
if(inputSeq[i]<=n){
if(inputSeq[i+1]>n){
i++;
continue;
}
else{
if(inputSeq[i+1]!=1){
hi=1;
break;
}
}
}
}
}
if(hi==1)return false;
else return true;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return 0;
}
int countReplacement(int n, int inputSeq[]){
return 0;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
