Submission #582190

#TimeUsernameProblemLanguageResultExecution timeMemory
582190kamelfanger83Gondola (IOI14_gondola)C++14
20 / 100
16 ms656 KiB
#include <iostream>
#include <vector>
#include "gondola.h"
#include <limits>

using namespace std;

int valid(int n, int inputSeq[]){
    int one = numeric_limits<int>::min();
    vector<bool> used (250001, false);
    for(int c = 0; c < n; c++){
        if(inputSeq[c] <= n){
            if(one == numeric_limits<int>::min()) one = c - inputSeq[c] + 1;
            if((c - one + 1) % n != inputSeq[c] % n) return 0; 
        }
        else{
            if(used[inputSeq[c]]) return 0;
            used[inputSeq[c]] = true;
        }
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){

}

int countReplacement(int n, int inputSeq[]){

}

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
   26 | }
      | ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:30:1: warning: no return statement in function returning non-void [-Wreturn-type]
   30 | }
      | ^
#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...