제출 #230289

#제출 시각아이디문제언어결과실행 시간메모리
230289monus1042곤돌라 (IOI14_gondola)C++17
20 / 100
29 ms4240 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { unordered_set<int> ch; for (int i=0; i<n; i++){ ch.insert(inputSeq[i]); } if ((int)ch.size()==n){ int fi=1000000, se=1000000; for (int i=0; i<n; i++){ if (1<=inputSeq[i] && inputSeq[i]<=n && inputSeq[i]<fi){ fi=inputSeq[i]; se=i; } } if (fi==1000000){ return 1; }else{ bool check=1; for (int i=se, track=fi; i<se+n; i++, track++){ if (1<=inputSeq[i%n] && inputSeq[i%n]<=n){ if (inputSeq[i%n] == track){ }else{ check=0; break; } } } if (check) return 1; return 0; } }else{ return 0; } } //---------------------- 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...