Submission #906290

# Submission time Handle Problem Language Result Execution time Memory
906290 2024-01-13T23:16:39 Z vjudge1 Job Scheduling (IOI19_job) C++17
5 / 100
46 ms 8496 KB
#include "job.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define endl '\n'
#define K first
#define V second

using namespace std;
using namespace __gnu_pbds;


template<typename T>
ostream_iterator<T> oit(const string &s = " "){
    return ostream_iterator<T>(cout,s.c_str());
}

struct chash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

template<typename T, typename U> using pb_map = gp_hash_table<T, U, chash>;
template<typename T> using pb_set = gp_hash_table<T, null_type, chash>;

typedef long long ll;
typedef long double ld;

typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;

constexpr ll NN = 2e5;
constexpr ll M = 1000000007;



long long scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d) {
	ll ans = 0;
    int n = (int)p.size();
    bool case1 = true;
    for(int i=1;i<n;i++){
        case1 &= p[i]==i-1;
    }

    if(case1){
        ll time = 0;
        for(int i=0;i<n;i++){
            time += d[i];
            ans += time*u[i];
        }
        return ans;
    }


    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 11 ms 2140 KB Output is correct
6 Correct 21 ms 4284 KB Output is correct
7 Correct 33 ms 6080 KB Output is correct
8 Correct 46 ms 8264 KB Output is correct
9 Correct 44 ms 8128 KB Output is correct
10 Correct 44 ms 8496 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 44 ms 8240 KB Output is correct
13 Correct 43 ms 8244 KB Output is correct
14 Correct 42 ms 8276 KB Output is correct
15 Correct 43 ms 8280 KB Output is correct
16 Correct 43 ms 8276 KB Output is correct
17 Correct 43 ms 8124 KB Output is correct
18 Correct 45 ms 8276 KB Output is correct
19 Correct 42 ms 8140 KB Output is correct
20 Correct 46 ms 8140 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 11 ms 2140 KB Output is correct
6 Correct 21 ms 4284 KB Output is correct
7 Correct 33 ms 6080 KB Output is correct
8 Correct 46 ms 8264 KB Output is correct
9 Correct 44 ms 8128 KB Output is correct
10 Correct 44 ms 8496 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 44 ms 8240 KB Output is correct
13 Correct 43 ms 8244 KB Output is correct
14 Correct 42 ms 8276 KB Output is correct
15 Correct 43 ms 8280 KB Output is correct
16 Correct 43 ms 8276 KB Output is correct
17 Correct 43 ms 8124 KB Output is correct
18 Correct 45 ms 8276 KB Output is correct
19 Correct 42 ms 8140 KB Output is correct
20 Correct 46 ms 8140 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -