제출 #1304534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1304534		Warinchai	Gondola (IOI14_gondola)	C++20	20 / 100	43 ms	8392 KiB

gondola

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

int valid(int n, int ar[])
{
    map<int,int>mp;
    vector<int>v;
    int cnt=0;
    int mx=0;
    for(int i=0;i<n;i++){
        mp[ar[i]]++;
        mx=max(mx,ar[i]);
        if(ar[i]<=n)v.push_back(ar[i]);
        cnt+=(mp[ar[i]]>1?2:0);
    }
    //cerr<<"cnt:"<<cnt<<"\n";
    int st=0;
    int mn=n+1;
    for(int i=0;i<n;i++){
        if(ar[i]<mn){
            mn=ar[i];
            st=i;
        }
    }
    //cerr<<"mn:"<<mn<<" "<<st<<"\n";
    if(mn<=n){
        int cur=mn;
        for(int i=0;i<n;i++){
            int id=(i+st)%n;
            if(ar[id]<=n){
                if(ar[id]!=cur)cnt+=2;
            }
            cur++;
        }
    }
    //cerr<<"cnt:"<<cnt<<"\n";
    for(int i=n+1;i<=mx;i++)if(mp[i]==0)cnt+=2;
    return cnt<=1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{

  return -2;
}

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

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 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