Submission #543109

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
543109	2022-03-29 11:14:47	Saeed_247	Job Scheduling (CEOI12_jobs)	C++14	100 / 100	222 ms	16896 KiB

jobs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, d, arr[N];
vector<int> adj[N];
bool check(int x) {
    queue<int> st;
    int delay = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < arr[i]; j++) st.push(i);
        int t = st.size();
        for (int j = 0; j < min(x, t); j++) {
            delay = max(delay, abs(i - st.front()));
            st.pop();
        }
    }
    if (!st.empty()) {
        return false;
    }
    return delay <= d;
}
void print(int x) {
    queue<int> st;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < arr[i]; j++) st.push(adj[i][j]);
        int t = st.size();
        for (int j = 0; j < min(x, t); j++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100