oj.uz

Submission #60000

# Submission time Handle Problem Language Result Execution time Memory
60000 2018-07-23T12:00:01 Z baekjoon 공장 (KOI13_factory) C++14
20 / 20
 465 ms 8556 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int l;
void update(vector<int> &a, int i, int diff) {
    while (i <= l) {
        a[i] += diff;
        i += (i & -i);
    }
}
int sum(vector<int> &a, int i) {
    int ans = 0;
    while (i > 0) {
        ans += a[i];
        i -= (i & -i);
    }
    return ans;
}
int sum(vector<int> &a, int l, int r) {
    if (l > r) return 0;
    return sum(a, r) - sum(a, l-1);
}
int d[1000001];
int main() {
    int n;
    scanf("%d",&n);
    vector<int> a(n);
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
    }
    for (int i=0; i<n; i++) {
        int num;
        scanf("%d",&num);
        d[num] = i+1;
    }
    long long ans = 0;
    vector<int> tree(n+1);
    l = n;
    for (int i=0; i<n; i++) {
        ans += (long long)sum(tree, d[a[i]]+1, n);
        update(tree, d[a[i]], 1);
    }
    printf("%lld\n",ans);
    return 0;
}

Compilation message

factory.cpp: In function 'int main()':
factory.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
factory.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i]);
         ~~~~~^~~~~~~~~~~~
factory.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&num);
         ~~~~~^~~~~~~~~~~

Subtask #1
2.2 / 2.2

# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 356 KB Output is correct
3 Correct 4 ms 520 KB Output is correct
4 Correct 3 ms 1464 KB Output is correct
5 Correct 5 ms 2052 KB Output is correct

Subtask #2
3.4 / 3.4

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2948 KB Output is correct
2 Correct 9 ms 4356 KB Output is correct
3 Correct 14 ms 4484 KB Output is correct

Subtask #3
3.8 / 3.8

# Verdict Execution time Memory Grader output
1 Correct 32 ms 4612 KB Output is correct
2 Correct 48 ms 4768 KB Output is correct
3 Correct 61 ms 4896 KB Output is correct

Subtask #4
4.8 / 4.8

# Verdict Execution time Memory Grader output
1 Correct 94 ms 5220 KB Output is correct
2 Correct 151 ms 5664 KB Output is correct
3 Correct 192 ms 6048 KB Output is correct
4 Correct 242 ms 6776 KB Output is correct

Subtask #5
5.8 / 5.8

# Verdict Execution time Memory Grader output
1 Correct 326 ms 7716 KB Output is correct
2 Correct 365 ms 8356 KB Output is correct
3 Correct 369 ms 8356 KB Output is correct
4 Correct 465 ms 8360 KB Output is correct
5 Correct 393 ms 8556 KB Output is correct
6 Correct 378 ms 8556 KB Output is correct