Submission #574425

#	Time	Username	Problem	Language	Result	Execution time	Memory
574425		MohamedFaresNebili	Gondola (IOI14_gondola)	C++14	25 / 100	10 ms	10096 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define lb lower_bound

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;



        int valid(int n, int arr[])
        {
            int occ[250001]; memset(occ, 0, sizeof occ);
            for(int l = 0; l < n; l++) {
                occ[arr[l]]++;
                if(occ[arr[l]] > 1) return 0;
            }
            for(int l = 1; l < n; l++) {
                if(arr[l] != arr[l - 1] + 1 && arr[l] != 1)
                    return 0;
            }
            return 1;
        }

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

        int replacement(int n, int arr[], int replacementSeq[])
        {
            int occ[2500001]; memset(occ, 0, sizeof occ);
            int mx = 0; int res = 0;
            for(int l = 0; l < n; l++) {
                occ[arr[l]]++; mx = max(mx, arr[l]);
            }
            for(int l = 1; l <= mx; l++) {
                if(occ[l]) continue;
                replacementSeq[res++] = l;
            }
            return res;
        }

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

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

• 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