Submission #1204742

#TimeUsernameProblemLanguageResultExecution timeMemory
1204742m5588ohammedGondola (IOI14_gondola)C++20
20 / 100
6 ms584 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int arr[]) { vector <int> v; long long mn=1e18,idx=0; for(int i=0;i<n;i++){ if(arr[i]<mn){ mn=arr[i]; idx=i; } } int cnt=1; for(int i=idx;i<idx+n;i++){ if(arr[i%n]>n) { arr[i%n]=cnt++; } if(arr[i%n]!=cnt) return 0; cnt++; } return 1; } //---------------------- int replacement(int n, int arr[], int rep[]) { vector <int> v; long long mn=1e18,idx=0; for(int i=0;i<n;i++){ if(arr[i]<mn){ mn=arr[i]; idx=i; } } int cnt=1,l=0; for(int i=idx;i<idx+n;i++){ if(arr[i%n]>n){ rep[arr[i%n]-n-1]=cnt; l++; } cnt++; } return l; } //---------------------- 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...