Submission #600526

#TimeUsernameProblemLanguageResultExecution timeMemory
600526MarceantasyGondola (IOI14_gondola)C++17
10 / 100
8 ms1108 KiB
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std; 

#define ll long long
#define ar array

const int mxN = 1e5+5; 

int valid(int n, int inputSeq[]){
    int cnt = 0; 
    for(int i = 1; i<n; ++i){
        cnt += (inputSeq[i]<inputSeq[i-1]);
    }
    return ((cnt<=1)?1:0);
}

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

int countReplacement(int n, int inputSeq[]){
    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...