# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
14604 |
2015-05-21T15:24:32 Z |
ioojh6654 |
공장 (KOI13_factory) |
C++ |
|
1000 ms |
8896 KB |
#include<stdio.h>
int a[1000000];
int b[1000000];
int main()
{
int n;
int i, j, count=0;
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)
{
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++;
}
}
}
if(i<j)
{
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++;
}
}
}
if(i==j)
{
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++;
}
}
}
}
}
}
printf("%d", count/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 |
0 ms |
8896 KB |
Output is correct |
4 |
Correct |
17 ms |
8896 KB |
Output is correct |
5 |
Correct |
72 ms |
8896 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
750 ms |
8896 KB |
Output is correct |
2 |
Execution timed out |
1000 ms |
8892 KB |
Program timed out |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1000 ms |
8892 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1000 ms |
8892 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1000 ms |
8892 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |