Submission #953529

#TimeUsernameProblemLanguageResultExecution timeMemory
953529irmuunGondola (IOI14_gondola)C++17
10 / 100
9 ms1332 KiB
#include<bits/stdc++.h>
#include "gondola.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int valid(int n, int in[]){
    int mn=n+1,pos=-1;
    for(int i=0;i<n;i++){
        if(in[i]<=n){
            if(in[i]<mn){
                mn=min(mn,in[i]);
                pos=i;
            }
        }
    }
    if(pos==-1) return 1;
    for(int i=0;i<n;i++){
        int p=(pos+i)%n;
        if(in[p]<=n&&in[p]!=mn+i) return 0;
    }
    return 1;
}
int replacement(int n, int gon[], int rep[]){
    return 0;
}
int countReplacement(int n, int in[]){
    return 0;
}
#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...