# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171746 | abdulaziz707 | Job Scheduling (CEOI12_jobs) | C++20 | 217 ms | 31120 KiB |
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
using namespace std;
using ll = long long;
const int inf = 2e18 + 31, mod = 1e9 + 7, MX = 1e5 + 1;
const double eps = 1e-8;
int gcd(int a, int b){
return b ? gcd(b, a%b) : a;
}
int lcm(int a, int b){
return a/gcd(a, b)*b;
}
void solve(){
/*
8 2 12
1 2 4 2 1 3 5 6 2 3 6 4
*/
int n, d, m;
cin >> n >> d >> m;
vector<pair<int,int>> job(m);
for(int day, i = 0; i < m; i++){
cin >> day;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |