제출 #230312

#제출 시각아이디문제언어결과실행 시간메모리
230312dannber_BR곤돌라 (IOI14_gondola)C++14
10 / 100
16 ms640 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { bool fair = true; bool probably_fair = true; for(int i = 1;i < n;i++) { if((inputSeq[i] > inputSeq[i - 1]) and (fair) and (inputSeq[i -1] != inputSeq[i + 1])) { fair = true; probably_fair = true; } else { if(probably_fair) { probably_fair = false; } else { fair = false; return 0; } } } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
#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...