Submission #1304527

#TimeUsernameProblemLanguageResultExecution timeMemory
1304527WarinchaiGondola (IOI14_gondola)C++20
10 / 100
27 ms4916 KiB
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int ar[])
{
    map<int,int>mp;
    vector<int>v;
    int cnt=0;
    for(int i=0;i<n;i++){
        if(ar[i]<=n)v.push_back(ar[i]),mp[ar[i]]++,cnt+=(mp[ar[i]]>1?2:0);
    }
    for(int i=0;i<v.size()-1;i++){
        if(v[i]>v[i+1])cnt++;
    }
    return cnt<=1;
}

//----------------------

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...