제출 #842808

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
842808		Pacybwoah	곤돌라 (IOI14_gondola)	C++17	55 / 100	15 ms	2388 KiB

gondola

#include<algorithm>
#include<vector>
#include<utility>
#include<iostream>
#include"gondola.h"
using namespace std;

int valid(int n, int inp[])
{
    vector<int> vec;
    for(int i=0;i<n;i++) vec.push_back(inp[i]);
    sort(vec.begin(),vec.end());
    if(unique(vec.begin(),vec.end())-vec.begin()!=n) return 0;
    int first=-1;
    for(int i=0;i<n;i++){
        if(inp[i]<=n){
            first=i;
            break;
        }
    }
    if(first==-1) return 1;
    bool flag=1;
    for(int i=0;i<n;i++){
        if(inp[i]!=(inp[first]+i-first-1+n)%n+1&&inp[i]<=n){
            flag=0;
            break;
        }
    }
    return flag;
}

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

int replacement(int n, int inp[], int ans[])
{
    int first=-1,fnum;
    vector<pair<int,int> > repl;
    for(int i=0;i<n;i++){
        if(inp[i]<=n){
            first=i;
            fnum=inp[i];
        }  
        else repl.push_back(make_pair(inp[i],i));
    }
    if(first==-1) first=0,fnum=1;
    sort(repl.begin(),repl.end());
    if(repl.size()==0) return 0;
    int cnt=0,last=n+1;
    for(auto x:repl){
        ans[cnt++]=(fnum+x.second-first-1+n)%n+1;
        for(int i=last;i<x.first;i++) ans[cnt++]=i;
        last=x.first+1;
    }
    return cnt;
}

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

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: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10