Submission #1276167

#TimeUsernameProblemLanguageResultExecution timeMemory
1276167KindaGoodGamesGondola (IOI14_gondola)C++20
0 / 100
1 ms348 KiB
#include "gondola.h"
#include<bits/stdc++.h>

using namespace std;
#define pii pair<int,int>

int INF = 1e9;
int valid(int n, int arr[])
{   
    set<int> occ;
    for(int i = 0; i < n; i++){
        if(occ.count(arr[i])){
            return 0;
        }
        occ.insert(arr[i]);
    }

    pii mpos = {INF,INF};
    for(int i = 0; i < n; i++){
        mpos = min(mpos,{arr[i],i});
    }

    int s = mpos.second;
    int cnt = 1;
    for(int i = 0; i < n; i++){
        int p = (s+i)%n;
        if(arr[p] < n && p != arr[p]){
            return 0;
        }
    }
    return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{ 
    return -1;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{ 
    return -1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...