oj.uz

답안 #947856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947856 2024-03-17T06:59:56 Z quanlt206 Job Scheduling (IOI19_job) C++17
5 / 100
 53 ms 10784 KB 
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 2e5 + 7;

int p[N], u[N], d[N], n;

bool checkSub1() {
    REP(i, 1, n)
        if (p[i] != i - 1) return false;
    return true;
}
namespace sub1 {
    ll Process() {
        ll res = 0, sum_t = 0;
        REP(i, 0, n) {
            sum_t+=d[i];
            res+=1LL * u[i] * sum_t;
        }
        return res;
    }
}

int64_t scheduling_cost(vector<int> P, vector<int> U, vector<int> D) {
    n = P.size();
    REP(i, 0, n) {
        p[i] = P[i];
        u[i] = U[i];
        d[i] = D[i];
    }
    if (checkSub1()) {
        return sub1::Process();
    }
}

Compilation message

job.cpp: In function 'int64_t scheduling_cost(std::vector<int>, std::vector<int>, std::vector<int>)':
job.cpp:72:1: warning: control reaches end of non-void function [-Wreturn-type]
   72 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 12 ms 2824 KB Output is correct
6 Correct 21 ms 5456 KB Output is correct
7 Correct 36 ms 8016 KB Output is correct
8 Correct 43 ms 10576 KB Output is correct
9 Correct 41 ms 10576 KB Output is correct
10 Correct 53 ms 10552 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 43 ms 10452 KB Output is correct
13 Correct 41 ms 10576 KB Output is correct
14 Correct 42 ms 10576 KB Output is correct
15 Correct 42 ms 10584 KB Output is correct
16 Correct 42 ms 10448 KB Output is correct
17 Correct 42 ms 10584 KB Output is correct
18 Correct 43 ms 10784 KB Output is correct
19 Correct 41 ms 10452 KB Output is correct
20 Correct 42 ms 10596 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 12 ms 2824 KB Output is correct
6 Correct 21 ms 5456 KB Output is correct
7 Correct 36 ms 8016 KB Output is correct
8 Correct 43 ms 10576 KB Output is correct
9 Correct 41 ms 10576 KB Output is correct
10 Correct 53 ms 10552 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 43 ms 10452 KB Output is correct
13 Correct 41 ms 10576 KB Output is correct
14 Correct 42 ms 10576 KB Output is correct
15 Correct 42 ms 10584 KB Output is correct
16 Correct 42 ms 10448 KB Output is correct
17 Correct 42 ms 10584 KB Output is correct
18 Correct 43 ms 10784 KB Output is correct
19 Correct 41 ms 10452 KB Output is correct
20 Correct 42 ms 10596 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -