제출 #1218081

#제출 시각아이디문제언어결과실행 시간메모리
1218081LeonidCuk곤돌라 (IOI14_gondola)C++20
25 / 100
35 ms4680 KiB
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n, int v[])
{
    map<int,int>mp;
    int k=1e9,x=-1;
    for(int i=0;i<n;i++)
    {
        if(mp[v[i]]==1)return 0;
        mp[v[i]]++;
        if(v[i]<k)
        {
            x=i;
            k=v[i];
        }
    }
    if(k>n)return 1;
    if(k==n)k=0;
    k++;
    int a=x;
    x=(x+1)%n;
    while(x!=a)
    {
        if(v[x]<=n&&v[x]!=k)return 0;
        x=(x+1)%n;
        if(k==n)k=0;
        k++;
    }
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    return 0;
}
int countReplacement(int n, int inputSeq[])
{
    return 1;
}
#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...