제출 #107721

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107721		FiloSanza	곤돌라 (IOI14_gondola)	C++14	25 / 100	71 ms	5468 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);
    for(int i=0; i<N; i++) 
        if(inputSeq[i] <= N)
            v.push_back(inputSeq[i]);
        else
            s.push_back(inputSeq[i]);

    sort(s.begin(), s.end());
    for(int i=1; i<s.size(); i++) if(s[i-1] == s[i]) return 0;
    if(!s.empty() && s.back() > N + s.size()) return 0;

    int mini = min_element(v.begin(), v.end()) - v.begin();

    map<int, int> cont;
    for(auto i : v) cont[i]++;

    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<int> v, s;
    for(int i=0; i<N; i++) 
        if(gondolaSeq[i] <= N)
            v.push_back(gondolaSeq[i]);
        else
            s.push_back(gondolaSeq[i]);

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

    if(s.empty()) return 0;

    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{
        seq = s;
    }
    
    vector<pair<int, int>> todo;

    for(int i=0; i<N; i++){
        if(seq[i] == 1+i+N)
            replacementSeq[cont++] = i+1;
        else if(seq[i] > N){
            todo.push_back({seq[i], i+1});
        }
    }

    if(todo.empty()) return cont;
    sort(todo.begin(), todo.end());

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

    return cont;
}

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

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

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:17:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1; i<s.size(); i++) if(s[i-1] == s[i]) return 0;
                  ~^~~~~~~~~
gondola.cpp:18:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(!s.empty() && s.back() > N + s.size()) 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