oj.uz

Submission #14618

# Submission time Handle Problem Language Result Execution time Memory
14618 2015-05-21T23:08:34 Z ioojh6654 공장 (KOI13_factory) C++
2.2 / 20
 1000 ms 8896 KB 
#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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8896 KB Output is correct
2 Correct 0 ms 8896 KB Output is correct
3 Correct 1 ms 8896 KB Output is correct
4 Correct 17 ms 8896 KB Output is correct
5 Correct 72 ms 8896 KB Output is correct

Subtask #2
0.0 / 3.4

# Verdict Execution time Memory Grader output
1 Correct 758 ms 8896 KB Output is correct
2 Execution timed out 1000 ms 8892 KB Program timed out
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 3.8

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 8892 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 4.8

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 8892 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 5.8

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 8892 KB Program timed out
2 Halted 0 ms 0 KB -