| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1174 | kriii | 공장 (KOI13_factory) | C++98 | 265 ms | 8696 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int N,V[1000010],B[1000010];
long long ans;
int main()
{
int i,x,u;
scanf ("%d",&N);
for (i=1;i<=N;i++){
scanf ("%d",&x);
V[x] = i;
}
for (i=1;i<=N;i++){
scanf ("%d",&x); x = N - V[x] + 1;
for (u=x;u;u-=u&(-u)) ans += B[u];
for (u=x;u<=N;u+=u&(-u)) B[u]++;
}
printf ("%lld\n",ans);
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
