제출 #14618

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
14618		ioojh6654	공장 (KOI13_factory)	C++98	2.20 / 20	1000 ms	8896 KiB

factory

#include<stdio.h>
int a[1000000];
int b[1000000];
int job(register unsigned int i,register unsigned int j, int n)
{
	register unsigned int x, y;
	register unsigned int count=0;
	for(x=n; x>i; x--)
	{
		for(y=1; y<j; y++)
		{
			if(a[x]==b[y]) count++;
		}
	}
	for(x=1; x<i; x++)
	{
		for(y=n; y>j; y--)
		{
			if(a[x]==b[y]) count++;
		}
	}
	
	return count;
	
}

int main()
{
	register unsigned int n;
	register unsigned int i, j, count=0;
	register unsigned int x, y;
	
	scanf("%d", &n);
	
	for(i=1; i<=n; i++)scanf("%d", &a[i]);
	for(j=1; j<=n; j++)scanf("%d", &b[j]);
	
	for(i=1; i<=n; i++)
	{
		for(j=1; j<=n; j++)
		{
			if(a[i]==b[j])
			{
				if(i>j)
				{
					count=count+job(i, j, n);
				}
				if(i<j)
				{
					count=count+job(i, j, n);
				}
				if(i==j)
				{
					count=count+job(i, j, n);
				}
			}
		}
	}
	printf("%d", count/2);
}

• Subtask 1: 2.2 / 2.2
• Subtask 2: 0 / 3.4
• Subtask 3: 0 / 3.8
• Subtask 4: 0 / 4.8
• Subtask 5: 0 / 5.8