제출 #792264

#제출 시각아이디문제언어결과실행 시간메모리
792264MODDI곤돌라 (IOI14_gondola)C++17
25 / 100
7 ms636 KiB
#include "gondola.h" //#include "grader.cpp" #include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair typedef long long ll; typedef pair<long long, long long> pll; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<ll> vl; int valid(int n, int inputSeq[]) { int pos = -1; for(int i = 0; i < n; i++){ if(inputSeq[i] == 1){ pos = i; break; } } bool seq = true; int at = 1, lim = pos; while(pos < n){ if(inputSeq[pos] == at){ pos++; at++; } else{ seq = false; break; } } if(!seq) return 0; pos = 0; while(pos < lim){ if(inputSeq[pos] == at){ pos++; at++; } else{ seq = false; break; } } if(!seq) return 0; return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]) { int pos = -1; for(int i = 0; i < n; i++){ if(gondolaSeq[i] >= 1 && gondolaSeq[i] <= n){ pos = i; break; } } if(pos == -1){ vi arr(n); for(int i = 0; i < n; i++) arr[i] = gondolaSeq[i]; sort(arr.begin(), arr.end()); int at = 1, j = 0, rez =0; for(int i = 0; i < n; i++){ while(at < arr[i]){ replacementSeq[j++] = at++; rez++; } at++; } return rez; } else{ set<int> active; map<int,int> replace; for(int i = 0; i < n; i++) active.insert(gondolaSeq[i]); int at = gondolaSeq[pos]; while(at <= n){ at++; pos++; pos%=n; } int j = 0, rez = 0; at=1; for(int i = pos; i < n; i++){ replace[gondolaSeq[i]] = at++; } for(int i = 0; i < pos; i++) replace[gondolaSeq[i]] = at++; //cout<<"Starting pos: "<<pos<<endl; for(int i = pos; i < n; i++){ while(at < gondolaSeq[i]){ if(active.find(at) != active.end()){ replacementSeq[j++] = replace[at++]; rez++; } else{ replacementSeq[j++] = at++; rez++; } } } for(int i = 0; i < pos; i++){ while(at < gondolaSeq[i]){ if(active.find(at) != active.end()){ replacementSeq[j++] = replace[at++]; rez++; } else{ replacementSeq[j++] = at++; rez++; } } } if(replace[at] != 0){ replacementSeq[j++] = replace[at]; rez++; } //cout<<"Ending at: "<<at<<endl; return rez; } } //---------------------- 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...