Submission #953548

#TimeUsernameProblemLanguageResultExecution timeMemory
953548irmuunGondola (IOI14_gondola)C++17
20 / 100
36 ms5224 KiB
#include<bits/stdc++.h> #include "gondola.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() int valid(int n, int in[]){ int mn=n+1,pos=-1; map<int,bool>used; for(int i=0;i<n;i++){ if(used[in[i]]){ return 0; } used[in[i]]=true; if(in[i]<=n){ if(in[i]<mn){ mn=in[i]; pos=i; } } } if(pos==-1) return 0; for(int i=0;i<n;i++){ int p=(pos+i)%n; if(in[p]<=n){ if(in[p]!=mn+i) return 0; } } return 1; } int replacement(int n, int gon[], int rep[]){ return 0; } int countReplacement(int n, int in[]){ return 0; }
#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...