oj.uz

Submission #210782

# Submission time Handle Problem Language Result Execution time Memory
210782 2020-03-18T10:53:24 Z ToMmyDong Job Scheduling (IOI19_job) C++14
5 / 100
 115 ms 5148 KB 
#include <bits/stdc++.h>
typedef long long ll;

long long scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d) {

    int n = p.size();
    assert(p.size() == n);
    assert(u.size() == n);
    assert(d.size() == n);

    ll ans = 0, sum = 0;
    for (int i=0; i<n; i++) {
        sum += d[i];
        ans += sum * u[i];
    }

    return ans;
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from job.cpp:1:
job.cpp: In function 'long long int scheduling_cost(std::vector<int>, std::vector<int>, std::vector<int>)':
job.cpp:7:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     assert(p.size() == n);
            ~~~~~~~~~^~~~
job.cpp:8:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     assert(u.size() == n);
            ~~~~~~~~~^~~~
job.cpp:9:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     assert(d.size() == n);
            ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 256 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 6 ms 256 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 36 ms 1556 KB Output is correct
6 Correct 55 ms 2684 KB Output is correct
7 Correct 93 ms 3832 KB Output is correct
8 Correct 112 ms 5148 KB Output is correct
9 Correct 108 ms 4984 KB Output is correct
10 Correct 108 ms 5060 KB Output is correct
11 Correct 6 ms 256 KB Output is correct
12 Correct 114 ms 5084 KB Output is correct
13 Correct 110 ms 5104 KB Output is correct
14 Correct 104 ms 4984 KB Output is correct
15 Correct 115 ms 4984 KB Output is correct
16 Correct 114 ms 5084 KB Output is correct
17 Correct 108 ms 5012 KB Output is correct
18 Correct 111 ms 4984 KB Output is correct
19 Correct 105 ms 5112 KB Output is correct
20 Correct 106 ms 5128 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 256 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 6 ms 256 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 36 ms 1556 KB Output is correct
6 Correct 55 ms 2684 KB Output is correct
7 Correct 93 ms 3832 KB Output is correct
8 Correct 112 ms 5148 KB Output is correct
9 Correct 108 ms 4984 KB Output is correct
10 Correct 108 ms 5060 KB Output is correct
11 Correct 6 ms 256 KB Output is correct
12 Correct 114 ms 5084 KB Output is correct
13 Correct 110 ms 5104 KB Output is correct
14 Correct 104 ms 4984 KB Output is correct
15 Correct 115 ms 4984 KB Output is correct
16 Correct 114 ms 5084 KB Output is correct
17 Correct 108 ms 5012 KB Output is correct
18 Correct 111 ms 4984 KB Output is correct
19 Correct 105 ms 5112 KB Output is correct
20 Correct 106 ms 5128 KB Output is correct
21 Incorrect 7 ms 256 KB Output isn't correct
22 Halted 0 ms 0 KB -