Submission #118819

#	Time	Username	Problem	Language	Result	Execution time	Memory
118819		ly20	곤돌라 (IOI14_gondola)	C++17	10 / 100	12 ms	1280 KiB

gondola

#include<bits/stdc++.h>
using namespace std;
const int INF=1123456789;
#include "gondola.h"
int valid(int n,int seq[])
{
	int mn=INF,at=INF,at2=INF;
	int st=0;
	bool vl=1;
	for(int i=0;i<n;i++)
	{
		if(st==0)
		{
			if(seq[i]<at && seq[i]<=n && at==INF)
			{
				at=seq[i];mn=seq[i];
			}
			else if(seq[i]<at && seq[i]<=n)
			{
				at2=seq[i];st=1;
			}
			else at=seq[i];
		}
		else
		{
			if(seq[i]>n)continue;
			if(seq[i]<at2 || seq[i]>mn || seq[i]>at)vl=0;
			at2=seq[i];
		}
	}	
	return vl;
}
int replacement(int n,int gondolaseq[],int replacementseq[])
{
	return 0;
}
int countReplacement(int n,int inputSeq[])
{
	return 0;
}

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