oj.uz

Submission #1125

# Submission time Handle Problem Language Result Execution time Memory
1125 2013-06-26T07:04:26 Z ainta 공장 (KOI13_factory) C++
20 / 20
 262 ms 8696 KB 
#include<stdio.h>
int N,ord[1000001],BIT[500010],i,w[500010];
long long Res;
int Sum(int a){
int s=0;
while(a){
s+=BIT[a];
a=a&(a-1);
}
return s;
}
void add(int a){
while(a<=N){
BIT[a]++;
a=2*a-(a&(a-1));
}
}
int main()
{
int a;
scanf("%d",&N);
for(i=1;i<=N;i++){
scanf("%d",&a);
ord[a]=i;
}
for(i=1;i<=N;i++){
scanf("%d",&a);
w[ord[a]]=i;
}
for(i=1;i<=N;i++){
add(w[i]);
Res=Res+w[i]-Sum(w[i]);
}
printf("%lld\n",Res);
}

Subtask #1
2.2 / 2.2

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

Subtask #2
3.4 / 3.4

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8696 KB Output is correct
2 Correct 1 ms 8696 KB Output is correct
3 Correct 4 ms 8696 KB Output is correct

Subtask #3
3.8 / 3.8

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8696 KB Output is correct
2 Correct 25 ms 8696 KB Output is correct
3 Correct 33 ms 8696 KB Output is correct

Subtask #4
4.8 / 4.8

# Verdict Execution time Memory Grader output
1 Correct 50 ms 8696 KB Output is correct
2 Correct 72 ms 8696 KB Output is correct
3 Correct 99 ms 8696 KB Output is correct
4 Correct 153 ms 8696 KB Output is correct

Subtask #5
5.8 / 5.8

# Verdict Execution time Memory Grader output
1 Correct 212 ms 8696 KB Output is correct
2 Correct 221 ms 8696 KB Output is correct
3 Correct 225 ms 8696 KB Output is correct
4 Correct 261 ms 8696 KB Output is correct
5 Correct 260 ms 8696 KB Output is correct
6 Correct 262 ms 8696 KB Output is correct