Submission #1321355

#TimeUsernameProblemLanguageResultExecution timeMemory
1321355nikaa123곤돌라 (IOI14_gondola)C++20
15 / 100
6 ms1204 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]){ vector <int> s; for (int i = 0; i < n; i++) { if (inputSeq[i] <= n) { s.push_back(inputSeq[i]); } } int cnt = 0; for (int i = 1; i < (s).size(); i++) { if (s[i] < s[i-1]) cnt++; } return (cnt <= 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...