Submission #107783

#	Time	Username	Problem	Language	Result	Execution time	Memory
107783		FiloSanza	Gondola (IOI14_gondola)	C++14	45 / 100	55 ms	4864 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid(int N, int inputSeq[])
{
    vector<int> v, s;
    v.reserve(N);
    map<int, int> cont;
    for(int i=0; i<N; i++) 
        if(inputSeq[i] <= N)
            v.push_back(inputSeq[i]);
        else
            s.push_back(inputSeq[i]);
    
    for(auto i : v) cont[i]++;
    for(auto i : s) cont[i]++;

    int mini = min_element(v.begin(), v.end()) - v.begin();
    for(auto i : cont) if(i.second > 1) return 0;

    for(int i=mini+1; i!=mini; i=(i+1)%v.size()){
        if(i == 0 && v.back() >= v.front()) return 0;
        if(v[i] <= v[i-1]) return 0;
    }

    return 1;
}

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

int replacement(int N, int gondolaSeq[], int replacementSeq[])
{
    int cont = 0;
    vector<int> seq;
    vector<pair<int, int>> s;
    vector<int> v;

    for(int i=0; i<N; i++) 
        if(gondolaSeq[i] <= N)
            v.push_back(gondolaSeq[i]);

    sort(v.begin(), v.end());

    if(!v.empty()){
        deque<int> q;
        for(int i=0; i<N; i++) q.push_back(gondolaSeq[i]);

        while(q.front() != v.front()){
            q.push_front(q.back());
            q.pop_back();
        }

        for(int i=1; i<v.front(); i++){
            q.push_front(q.back());
            q.pop_back();
        }
        
        while(!q.empty()){
            seq.push_back(q.front());
            q.pop_front();
        }
    }
    else{
        for(int i=0; i<N; i++) seq.push_back(gondolaSeq[i]);
    }
    
    for(int i=0; i<N; i++){
        if(seq[i] >= N)
            s.push_back({seq[i], i+1});
    }

    sort(s.begin(), s.end());

    if(s.empty()) return 0;

    int nxt = N+1;
    for(auto i : s){
        int to = i.second;
        while(nxt <= i.first){
            replacementSeq[cont++] = to;
            to = nxt;
            nxt++;
        }
    }

    return cont;
}

//----------------------
const int MOD = 1e9+9;

int countReplacement(int N, int gondolaSeq[])
{
    if(valid(N, gondolaSeq) == 0) return 0;

    int cont = 0;
    vector<int> seq;
    vector<int> s;
    vector<int> v;

    for(int i=0; i<N; i++) 
        if(gondolaSeq[i] <= N)
            v.push_back(gondolaSeq[i]);

    sort(v.begin(), v.end());

    if(!v.empty()){
        deque<int> q;
        for(int i=0; i<N; i++) q.push_back(gondolaSeq[i]);

        while(q.front() != v.front()){
            q.push_front(q.back());
            q.pop_back();
        }

        for(int i=1; i<v.front(); i++){
            q.push_front(q.back());
            q.pop_back();
        }
        
        while(!q.empty()){
            seq.push_back(q.front());
            q.pop_front();
        }
    }
    else{
        for(int i=0; i<N; i++) seq.push_back(gondolaSeq[i]);
    }    
    for(int i=0; i<N; i++){
        if(seq[i] >= N)
            s.push_back(seq[i]);
    }

    sort(s.begin(), s.end());

    if(s.empty()) return 0;
    int curr = N+1, pos = 0;
    int ans = 1;
    while(curr < s.back()){
        if(curr == s[pos]){
            curr++;
            pos++;
            continue;
        }

        ans = (ans * (s.size() - pos)) % MOD;
        curr++;
    }    
    if(s.size() == N) ans = (ans * N) % MOD;
    return ans;
}

Compilation message (stderr)

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:151:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size() == N) ans = (ans * N) % MOD;
        ~~~~~~~~~^~~~
gondola.cpp:98:9: warning: unused variable 'cont' [-Wunused-variable]
     int cont = 0;
         ^~~~

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