제출 #138708

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138708		zoooma13	곤돌라 (IOI14_gondola)	C++14	25 / 100	52 ms	4712 KiB

gondola

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

int valid(int n, int inputSeq[]){
    int mi_idx = min_element(inputSeq ,inputSeq+n)-inputSeq;
    set <int> ss;
    for(int i=0; i<n; i++)
        ss.insert(inputSeq[i]);
    if(ss.size() != n)
        return 0;
    if(inputSeq[mi_idx] >= n)
        return 1;
    int nxt = inputSeq[mi_idx];
    for(int i=mi_idx; nxt<=n; i++){
        if(inputSeq[i%n] != nxt && inputSeq[i%n] <= n)
            return 0;
        nxt++;
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    vector <pair<int ,int>> vii;
    int mi_idx = min_element(gondolaSeq ,gondolaSeq+n)-gondolaSeq;
    int nxt = gondolaSeq[mi_idx];
    if(nxt > n)
        nxt = 1;
    for(int i=mi_idx; i<mi_idx+n; i++){
        vii.push_back({gondolaSeq[i%n] ,nxt});
        nxt = (nxt == n ? 1 : nxt+1);
    }
    sort(vii.begin() ,vii.end());
    nxt = n+1;
    vector <int> ret;
    for(auto&p : vii){
        if(p.first <= n)
            continue;
        ret.push_back(p.second);
        while(nxt != p.first){
            ret.push_back(nxt);
            nxt++;
        }
    }
    for(int i=0; i<ret.size(); i++)
        replacementSeq[i] = ret[i];
    return ret.size();
}

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

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

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:10:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(ss.size() != n)
        ~~~~~~~~~~^~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:48:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<ret.size(); i++)
                  ~^~~~~~~~~~~

• 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