Submission #1146204

#	Time	Username	Problem	Language	Result	Execution time	Memory
1146204		enzy	Gondola (IOI14_gondola)	C++20	0 / 100	1 ms	328 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn=3e5+10;

int valid(int n, int v[])
{
    int val=v[1];
    for(int i=2;i<=n;i++){
        val++; val%=(n+1);
        if(!val) val++;
        if(v[i]>n) continue;
        if(val!=v[i]) return 0;
    }
    return 1;
}

int marc[maxn];
int replacement(int n, int v[], int resp[])
{
    int maior=1;
    for(int i=1;i<=n;i++) maior=max(maior,v[i]);
    for(int i=1;i<=maior;i++) marc[i]=0;
    for(int i=1;i<=n;i++) marc[v[i]]++;
    int id=0;
    for(int i=1;i<=maior;i++){
        if(!marc[i]){
            resp[id]=i;
            id++;
        }
    }
    return id;
}

int countReplacement(int n, int inputSeq[])
{
    return -3;
}
               

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10