| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1360533 | nini_gvenetadze | Gondola (IOI14_gondola) | C++20 | 967 ms | 756 KiB |
#include<bits/stdc++.h>
using namespace std;
#include "gondola.h"
int valid(int n, int inputseq[])
{
for(int i=0; i<n; i++)
{
for(int j=i+1; j<n; j++)
{
if(inputseq[i]==inputseq[j])
{
return 0;
}
}
}
int k=-1;
int c=-1;
for(int i=0; i<n; i++)
{
if(inputseq[i]<=n)
{
if(c==-1)
{
c=inputseq[i];
k=i;
continue;
}
if(inputseq[i]==1)
{
c=inputseq[i];
k=i;
continue;
}
if(inputseq[i]-c!=i-k)
{
return 0;
}
c=inputseq[i];
k=i;
}
}
return 1;
}
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... | ||||
