Submission #1360524

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360524		nataliaa	Gondola (IOI14_gondola)	C++20	25 / 100	27 ms	5280 KiB

gondola

#include<bits/stdc++.h>
#include"gondola.h"
using namespace std;

int valid(int n, int b[]){
    int a[2*n];
    map<int, int> mp;
    for(int i = 0; i < n; i++){
        a[i] = b[i];
        a[i+n] = b[i];
        if(mp[a[i]]==1) return 0;
        mp[a[i]]=1;
    }
    for(int i = 0; i < n; i++){
        if(a[i]<=n){
            int k = a[i];
            for(int j = i; j<2*n; j++){
                if(a[j]<=n&&a[j]!=k) return 0;
                k++;
                if(k>n) k-=n;
            }
            return 1;
        }
    }
    return 1;
}
int replacement(int n, int a[], int b[]){
    int mx = 0;
    map<int, int> mp;
    for(int i = 0; i < n;i++) {
        mx = max(mx, a[i]);
        mp[a[i]] = 1;
    }
    int l = 0;
    for(int i = 1; i<= mx; i++){
        if(mp[i]!=1) {
            b[l] = i;
            l++;
        }
    }
    return l;

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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