Submission #433402

#TimeUsernameProblemLanguageResultExecution timeMemory
433402muhammad_hokimiyon곤돌라 (IOI14_gondola)C++14
5 / 100
1 ms332 KiB
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

int valid(int n, int inputSeq[])
{
  return -1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
        int mx = 0;
        for(int i = 0; i < n; i++)mx = max(mx, gondolaSeq[i]);
        vector<int> used(mx + 1, 0);
        for(int i = 0; i < n; i++)used[gondolaSeq[i]] = 1;
        int l = 0;
        for(int i = 1; i <= mx; i++){
                if(!used[i]){
                        replacementSeq[l++] = i;
                }
        }
        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...